NLPIR SEMINAR Y2018#9
\n<\/span><\/span><\/b>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u0010e\/x\u0011u%K ^\u0016lG<\/span><\/p>\n

INTRO<\/span><\/span><\/b>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u001fd\u0005N V\u0016V#p8M!i<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 <\/span>In the new semester, our Lab, Web Search Mining and Security Lab, plans to hold an academic seminar every Wednesdays, and each time a keynote speaker will share understanding of papers published in recent years with you.<\/span><\/span><\/span><\/p>\n

;K\u0002h\u0012n
\n`\u001dF\u0016D1N\u000ex0<\/span><\/p>\n

\u00a0<\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0$U\u0003G9n(u;|<\/span><\/p>\n

Arrangement<\/span><\/span><\/b>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u001b?\u001dL\/o\u0016q3\\&L\u000eq,B<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 <\/span>This week’s seminar is organized as follows:<\/span><\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0+C0R]:?’x\u001fs9p<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 <\/span>1. The seminar time is 1.pm, Wed<\/b>, at Zhongguancun Technology Park ,Building 5, 1306.<\/span><\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u000bo\u000eW:z\u001b[*A%{!o9P\u0017_\u0001u<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 <\/span>2. The lecturer is Yaofei Yang<\/b>, the paper’s titles are An Unsupervised Method for Uncovering Morphological Chains <\/b>and From Segmentation to Analyses A Probabilistic Model for Unsupervised Morphology Induction<\/b>.<\/span><\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0#T\u000eG&X(R\u0011|\u0001L\u0006N
\nf<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 <\/span>3. The seminar will be hosted Wang Gang.<\/span><\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u0013?\u0005I\u000er\u001av\u0012e\/S\u001dP\u001bf<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 <\/span>4. Attachment is the paper of this seminar, please download in advance<\/span><\/span><\/span><\/p>\n

0~
\nX!t d\u001fG\/Y F0<\/span><\/p>\n

\u00a0<\/span><\/span><\/p>\n

\u000f[M&~,j\u0006\\\u0004S\u0011m.V0<\/span><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 <\/span>Everyone interested in this topic is welcomed to join us. the following is the abstract for this week\u2019s paper<\/span><\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u000em*_,sN\u0018_\u0013u#{<\/span><\/p>\n

\u00a0<\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0(\\\u0019p+o\fx\u0013B#U\u0002]<\/span><\/p>\n

\n
An Unsupervised Method for Uncovering Morphological Chains<\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0&G\u0005o2w\u0018q:n<\/span><\/p>\n
Karthik Narasimhan\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/span>Regina Barzilay\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/span>Tommi Jaakkola<\/span><\/span><\/p>\n
\u0005c\u001d?\bQ\/e\u0006e#e\u0012}0<\/span><\/p>\n
Abstract<\/span><\/span><\/p>\n
#O\u001cn9?*]*A0<\/span><\/p>\n
Most state-of-the-art systems today produce morphological analysis based only on orthographic patterns. In contrast, we propose a model for unsupervised morphological analysis that integrates orthographic and semantic views of words. We model word formation in terms of morphological chains, from base words to the observed words, breaking the chains into parent-child relations. We use log-linear models with morpheme and wordlevel features to predict possible parents, including their modifications, for each word. The limited set of candidate parents for each word render contrastive estimation feasible. Our model consistently matches or outperforms five state-of-the-art systems on Arabic, English and Turkish.<\/span><\/span><\/span><\/p>\n
\u0016M;j
\nH0b;Y0<\/span><\/p>\n
\u00a0<\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u001aJ\u001dj\u0010_+D\u0015i\u001bS4F\u001fB\u0003T\u0011A<\/span><\/p>\n
From Segmentation to Analyses:<\/span><\/span><\/p>\n
\u001e`\u0014x\u000f]$?*d\bi*h\fU0<\/span><\/p>\n
A Probabilistic Model for Unsupervised Morphology Induction<\/span><\/span><\/p>\n
\u000bA0Q
\nj\u001b?\u001f{\u0007\\\u0004{4z\u0010p0<\/span><\/p>\n
Toms Bergmanis\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/span>Sharon Goldwater<\/span><\/span><\/p>\n
2S\u0010z\u0010v\b{\u001eN\u0005X\/M0<\/span><\/p>\n
Abstract<\/span><\/span><\/p>\n
\u0011?\u000bf1\\\u001dl
\ny-d8b\u000bt0<\/span><\/p>\n
\u00a0 \u00a0 \u00a0 \u00a0 A major motivation for unsupervised morphological analysis is to reduce the sparse data problem in under-resourced languages. Most previous work focuses on segmenting surface forms into their constituent morphs (e.g., taking: tak +ing), but surface form segmentation does not solve the sparse data problem as the analyses of take and taking are not connected to each other. We extend the MorphoChains system (Narasimhan et al., 2015) to provide morphological analyses that can abstract over spelling differences in functionally similar morphs. These analyses are not required to use all the orthographic material of a word (stopping: stop +ing), nor are they limited to only that material (acidified: acid +ify +ed). On average across six typologically varied languages our system has a similar or better F-score on EMMA (a measure of underlying morpheme accuracy) than three strong baselines; moreover, the total number of distinct morphemes identified by our system is on average 12.8% lower than for Morfessor (Virpioja et al., 2013), a state-of-the-art surface segmentation system.<\/span><\/span><\/span><\/p>\n
(L\u000eY:v8e$F%j\u0017m
\nw\u0017h\u0005i
\n]0<\/span><\/p>\n
\u00a0<\/span><\/span><\/p>\n
#[ o3O!z$R\u0014J S\u0014A0<\/span><\/p>\n<\/div>\n
\u00a0<\/span><\/span><\/p>\n
\u001fu’u:{9X\u0019q\fp0u0<\/span><\/p>\n
\u00a0<\/span><\/span><\/p>\n
\fwT\u0012R$J\/~5C0<\/span><\/p>\n
\u00a0<\/span><\/span>\u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0”c’I\u0018a%S\u0017L\u0017Q:P&^\u0015z<\/span><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
NLPIR SEMINAR Y2018#9 \u81ea\u7136\u8bed\u8a00\u5904\u7406\u4e0e\u4fe1\u606f\u68c0\u7d22\u5171\u4eab\u5e73\u53f0\u0010e\/ … \u7ee7\u7eed\u9605\u8bfb →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[37],"tags":[],"_links":{"self":[{"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/posts\/1077"}],"collection":[{"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/comments?post=1077"}],"version-history":[{"count":3,"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/posts\/1077\/revisions"}],"predecessor-version":[{"id":6154,"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/posts\/1077\/revisions\/6154"}],"wp:attachment":[{"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/media?parent=1077"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/categories?post=1077"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.nlpir.org\/wordpress\/wp-json\/wp\/v2\/tags?post=1077"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}