1064 search results - page 7 / 213 » Single Tree Grammars |
JMLR
2010
13 years 2 months ago
2010
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
ACL
2006
13 years 8 months ago
2006
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...
ACL
2010
13 years 5 months ago
2010
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is...
ACL
1992
13 years 8 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
ACL
1989
13 years 8 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...