675 search results - page 22 / 135 » On Compression of Parse Trees |
150
click to vote
NAACL
2010
15 years 2 months ago
2010
Syntactic machine translation systems extract rules from bilingual, word-aligned, syntactically parsed text, but current systems for parsing and word alignment are at best cascade...
133
click to vote
ACL
1990
15 years 5 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
133
click to vote
ACL
2006
15 years 5 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
154
click to vote
ACL
1996
15 years 5 months ago
1996
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
131
click to vote
ICIP
1999
IEEE
15 years 8 months ago
1999
IEEE
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...