621 search results - page 13 / 125 » Parsing As Tree Traversal |
COLING
2010
13 years 4 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 11 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 ...
OPODIS
2004
13 years 11 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
CP
2009
Springer
14 years 10 months ago
2009
Springer
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
ACL
2012
12 years 7 days 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-...