675 search results - page 12 / 135 » On Compression of Parse Trees |
IWPT
2001
13 years 8 months ago
2001
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
COLING
2010
13 years 2 months ago
2010
As unlexicalized parsing lacks word token information, it is important to investigate novel parsing features to improve the accuracy. This paper studies a set of tree topological ...
ACL
2007
13 years 9 months ago
2007
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
ACL
2012
11 years 10 months ago
2012
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-...
LREC
2008
13 years 9 months ago
2008
Some alternatives to the standard evalb measures for parser evaluation are considered, principally the use of a tree-distance measure, which assigns a score to a linearity and anc...