Sciweavers

66 search results - page 2 / 14
» Evolving natural language grammars without supervision
Sort
View
EMNLP
2010
13 years 3 months ago
Unsupervised Induction of Tree Substitution Grammars for Dependency Parsing
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
Phil Blunsom, Trevor Cohn
CSL
2006
Springer
13 years 5 months ago
Unsupervised grammar induction using history based approach
Grammar induction, also known as grammar inference, is one of the most important research areas in the domain of natural language processing. Availability of large corpora has enc...
Heshaam Feili, Gholamreza Ghassem-Sani
EMNLP
2011
12 years 5 months ago
Unsupervised Dependency Parsing without Gold Part-of-Speech Tags
We show that categories induced by unsupervised word clustering can surpass the performance of gold part-of-speech tags in dependency grammar induction. Unlike classic clustering ...
Valentin I. Spitkovsky, Hiyan Alshawi, Angel X. Ch...
EACL
1989
ACL Anthology
13 years 6 months ago
French Order Without Order
To account for the semi-freeword order ofFrench, Unification Categorial Grammar is extended in two ways. First, verbal valencies are contained in a set rather than in a list. Seco...
Gabriel G. Bès, Claire Gardent
EMNLP
2010
13 years 3 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead