621 search results - page 2 / 125 » Parsing As Tree Traversal |
GRAMMARS
2000
13 years 5 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
ACL
2006
13 years 6 months ago
2006
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
ACL
2009
13 years 3 months ago
2009
The automatic extraction of relations between entities expressed in natural language text is an important problem for IR and text understanding. In this paper we show how differen...
ENTCS
2002
13 years 5 months ago
2002
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
APLAS
2003
ACM
13 years 10 months ago
2003
ACM
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...