18 search results - page 3 / 4 » Unsupervised Induction of Tree Substitution Grammars for Dep... |
ACL
2009
13 years 3 months ago
2009
We investigate the task of unsupervised constituency parsing from bilingual parallel corpora. Our goal is to use bilingual cues to learn improved parsing models for each language ...
EMNLP
2010
13 years 3 months ago
2010
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...
NAACL
2010
13 years 3 months ago
2010
Adaptor grammars extend probabilistic context-free grammars to define prior distributions over trees with "rich get richer" dynamics. Inference for adaptor grammars seek...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
EMNLP
2011
12 years 5 months ago
2011
We present a quasi-synchronous dependency grammar (Smith and Eisner, 2006) for machine translation in which the leaves of the tree are phrases rather than words as in previous wor...