Sciweavers

212 search results - page 7 / 43
» Second-Order Simple Grammars
Sort
View
ACL
2006
14 years 11 months ago
Learning Accurate, Compact, and Interpretable Tree Annotation
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting...
Slav Petrov, Leon Barrett, Romain Thibaux, Dan Kle...
BIRTHDAY
2001
Springer
15 years 2 months ago
Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars
A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) is a kind of generative grammar, where parsing can be performed without backtracking. In this paper, we invest...
Jia Lee, Kenichi Morita
ANLP
2000
96views more  ANLP 2000»
14 years 11 months ago
Experiments with Corpus-based LFG Specialization
Sophisticated grammar formalisms, such as LFG, allow concisely capturing complex linguistic phenomena. The powerful operators provided by such formalisms can however introduce spu...
Nicola Cancedda, Christer Samuelsson
EMNLP
2010
14 years 7 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
COLING
2000
14 years 11 months ago
An HPSG-to-CFG Approximation of Japanese
We present a simple approximation method for turning a Head-Driven Phrase Structure Grammar into a context-free grammar. The approximation method can be seen as the construction o...
Bernd Kiefer, Hans-Ulrich Krieger, Melanie Siegel