103 search results - page 13 / 21 » Prototype-Driven Grammar Induction |
105
click to vote
ACL
2000
15 years 1 months ago
2000
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
CEC
2010
IEEE
15 years 24 days 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...
108
click to vote
NAACL
2010
14 years 9 months ago
2010
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
117
click to vote
EMNLP
2011
13 years 11 months ago
2011
When translating among languages that differ substantially in word order, machine translation (MT) systems benefit from syntactic preordering—an approach that uses features fro...
FLAIRS
2008
15 years 2 months ago
2008
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...