cross language dependency parsing using a bilingual lexicon

Ngày tải lên: 17/03/2014, 01:20

... motivated grammar-driven parsing systems achieved high accuracy which are comparable to the treebank-based statistical parsers. Notably are the constraint-based linguistic frameworks with mathematical ... Svetoslav Marinov, and Erwin Marsi. 2007b. Maltparser: A language- independent system for data-driven dependency parsing. Natural Language Engineering, 13(1):1–41. Stephan Oepen, Helge Dyvik, Jan ... Michael Riley, Brian Roark, and Richard Sproat. 2006. Map adaptation of stochastic grammars. Computer speech and language, 20(1):41–68. Sabine Buchholz and Erwin Marsi. 2006. CoNLL-X shared task...

Ngày tải lên: 08/03/2014, 00:20

... by using a Japanese depen- dency analyzer such as KNP (Kurohashi and Na- gao, 1994) or CaboCha (Kudo and Matsumoto, 2002). Although this information is less accu- rate than manually annotated ... the parsing accuracy. We can also verify that the parsing accuracy improves by using imprecise information obtained from an automati- cally parsed corpus. Klein and Manning proposed a generative model ... data we used was Kyodai Cor- pus 3.0, a corpus manually annotated with depen- dency relations (Kurohashi and Nagao, 199 8a) . The statistics of the data are as follows: • Training data: 24,263 sentences,...

Ngày tải lên: 20/02/2014, 12:20

Ngày tải lên: 31/03/2014, 01:20

... linearization rules. It would also be interesting to attempt to de- scribe other languages in this formalism, con- figurational languages such as English or French, as well as languages such as ... of Utrecht. Kahane Sylvain, Alexis Nasr, Owen Rambow, 1998, “Pseudo-Projectivity: a Polynomially Parsable Non-Projective Dependency Grammar”, COLING- ACL’98, Montreal, 646-52. Kathol Andreas, 1995, Linearization-based ... in contrast to X-bar syntax, 3.1 Definition of the Grammar For a grammar, the parameters to instantiate are the vocabulary V, the set of (lexical) cate- gories C, the set of syntactic relations...

Ngày tải lên: 20/02/2014, 18:20

... Inducing head-driven PCFGs with latent heads: Refining a tree-bank grammar for parsing. In Proc. of ECML. Khalil Sima’an, Alon Itai, Yoad Winter, Alon Altman, and Noa Nativ. 2001. Building a Tree-Bank ... ACL. Yoav Golderg, Reut Tsarfaty, Meni Adler, and Michael Elhadad. 2009. Enhancing unlexicalized parsing per- formance using a wide coverage lexicon, fuzzy tag-set mapping, and em-hmm-based lexical ... with latent variable grammars. In Proceedings of the ACL Workshop on Parsing German. Slav Petrov, Leon Barrett, Romain Thibaux, and Dan Klein. 2006. Learning accurate, compact, and in- terpretable...

Ngày tải lên: 17/03/2014, 00:20

Ngày tải lên: 17/03/2014, 02:20

Ngày tải lên: 30/03/2014, 17:20

... comparable cor- pora are mostly based on the idea that semantically similar words appear in similar contexts (Fung, 1995; Rapp, 1995; Kaji and Aizono, 1996; Tanaka and Iwasaki, 1996; Fung and ... contextual sim- ilarities across languages, earlier works such as Fung (1995), Rapp (1995), and Tanaka and Iwasaki (1996) studied to mea- sure the similarities of contextual co-occurrence patterns across ... } Retrieval of Bilingual Article Pair WWW (News Sites) Effect of Cross- Language IR in Bilingual Lexicon Acquisition from Comparable Corpora Takehito Utsuro  Takashi Horiuchi and Kohei Hino Graduate...

Ngày tải lên: 22/02/2014, 02:20

Ngày tải lên: 17/03/2014, 22:20

Ngày tải lên: 30/03/2014, 21:20

Ngày tải lên: 11/12/2013, 23:48

Ngày tải lên: 14/12/2013, 00:41

... Than Sentences in Active Learning for Japanese Dependency Parsing Manabu Sassano Yahoo Japan Corporation Midtown Tower, 9-7-1 Akasaka, Minato-ku, Tokyo 107-6211, Japan msassano@yahoo-corp.jp Sadao ... bunsetsus: Lisa-ga, kare-ni, ano, pen-wo, and age-ta where ga, ni, and wo are postpositions and ta is a verb ending for past tense. 3.2 Constraints of Japanese Dependency Analysis Japanese is a head final language ... selection for statistical parsing. Computational Linguistics, 30(3):253–276. Masakazu Iwatate, Masayuki Asahara, and Yuji Mat- sumoto. 2008. Japanese dependency parsing us- ing a tournament model....

Ngày tải lên: 20/02/2014, 04:20

... that are assigned the correct head. Complete accuracy (CA) indicates the fraction of sentences that have a complete cor- rect analysis. We also measure that root accuracy (RA) and leaf accuracy ... of the Annual Conference on Computational Natural Language Learning (CoNLL), pages 1–8. Association for Computa- tional Linguistics. D. Roth. 1998. Learning to resolve natural language ambi- guities: ... words after w 2 (as in (Yamada and Matsumoto, 2003)). The key additional feature we use, relative to (Ya- mada and Matsumoto, 2003), is that we include the previous predicted action as a feature....

Ngày tải lên: 20/02/2014, 12:20

... Science and Technology Nara, 630-0101, Japan {fatia-s, yosikawa, uemura}@is.aist-nara.ac.jp Masatoshi Yoshikawa Nagoya University Nagoya, 464-8601, Japan Shunsuke Uemura Nara Institute of Science and ... 2001. OAK System-Manual. New York Uni- versity. Bilingual Terminology Acquisition from Comparable Corpora and Phrasal Translation to Cross- Language Information Retrieval Fatiha Sadat Nara Institute ... Technology Nara, 630-0101, Japan Abstract The present paper will seek to present an approach to bilingual lexicon extrac- tion from non-aligned comparable cor- pora, phrasal translation as well as evalua- tions...

Ngày tải lên: 20/02/2014, 16:20

... Refined Lexicon Models for Statistical Machine Translation using a Maximum Entropy Approach Ismael Garc ´ a Varea Dpto. de Inform´atica Univ. de Castilla-La Mancha Campus Universitario s/n 02071 Albacete, ... dialog act. To include this additional information within the statistical framework we use the maximum en- tropy approach. This approach has been applied in natural language processing to a variety ... S. A. Della Pietra, et al. 1994. The candide system for machine translation. In Proc. , ARPA Workshop on Human Language Technology, pages 157–162. Adam L. Berger, Stephen A. Della Pietra, and...

Ngày tải lên: 20/02/2014, 18:20

... Parsing schemata Parsing schemata (Sikkel, 1997) provide a formal, simple and uniform way to describe, analyze and compare different constituency-based parsers. The notion of a parsing schema ... However, in the parsing schemata for these algorithms we can see (and formally prove) that they are related: one is a refinement of the other. Parsing schemata are also a formal tool that can be used ... keep track of the state of the automata used by the grammars. However, this abstract representation of its underlying seman- tics as a dependency parsing schema shows that this parsing strategy...

Ngày tải lên: 08/03/2014, 01:20

... developing an algorithm to automatically analyze a sentence using structural grammar, we hope that the advantages of structural analysis can improve the performance of natural language parsers. By assigning ... computational representation. Nevertheless, both structural and transformational grammar are taught at secondary and undergraduate levels. 2.2 Applications of structural grammar Structural grammar still has a number ... structural grammar Structural grammar is an approach to natural lan- guage based on the understanding that the major- ity of sentences in the English language can be matched to one of ten patterns....

Ngày tải lên: 08/03/2014, 01:20

... Ginsparg, J. M., A Robust Portable Natural Language Data Base Interface, Proc. Conf. Applied Natural Language Processing, 1983, pp.25-30. Grosz, B. J., TEAM: A Transportable Natural- Language ... represents a relationship to another class using a $class facet and mapping information to the database schema using a Sstorage facet. The value of a Sstorage facet denotes the class name which has ... have an attribute relationship. The phrase 'commodity A& apos; can modify the phrase 'to sell' both semantically and (Geneva) (commodity A) (to sell) (retailer) (name) S(Sales)...

Ngày tải lên: 09/03/2014, 01:20