675 search results - page 36 / 135 » On Compression of Parse Trees |
EACL
2003
ACL Anthology
13 years 10 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...
DCC
2008
IEEE
14 years 8 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...
COLING
2010
13 years 3 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...
ACL
2001
13 years 10 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...
COLING
2000
13 years 10 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...