116 search results - page 15 / 24 » An Efficient Parsing Algorithm for Tree Adjoining Grammars |
88
Voted
EACL
2003
ACL Anthology
15 years 1 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
COLING
2008
15 years 1 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
117
Voted
ECML
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
ACL
1992
15 years 25 days ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
ACL
1998
15 years 1 months ago
1998
Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...