675 search results - page 46 / 135 » On Compression of Parse Trees |
NAACL
2010
13 years 6 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of informati...
EMNLP
2009
13 years 6 months ago
2009
In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previo...
EMNLP
2007
13 years 10 months ago
2007
In this paper, we describe a new algorithm for recovering WH-trace empty nodes. Our approach combines a set of hand-written patterns together with a probabilistic model. Because t...
ACL
1998
13 years 10 months ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...