675 search results - page 36 / 135 » On Compression of Parse Trees |
128
click to vote
EACL
2003
ACL Anthology
15 years 5 months ago
2003
ACL Anthology
Two apparently opposing DOP models exist in the literature: one which computes the parse tree involving the most frequent subtrees from a treebank and one which computes the parse...
133
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
121
click to vote
COLING
2010
14 years 11 months ago
2010
In this paper we present a novel phrase structure parsing approach with the help of dependency structure. Different with existing phrase parsers, in our approach the inference pro...
109
click to vote
ACL
2001
15 years 5 months ago
2001
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
133
click to vote
COLING
2000
15 years 5 months ago
2000
Common wisdom has it that tile bias of stochastic grammars in favor of shorter deriwttions of a sentence is hamfful and should be redressed. We show that the common wisdom is wron...