621 search results - page 11 / 125 » Parsing As Tree Traversal |
AMTA
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. We present an approach to semantic interpretation of syntactically parsed Japanese sentences that works largely parser-independent. The approach relies on a standardized ...
EMNLP
2008
13 years 11 months ago
2008
We show that jointly parsing a bitext can substantially improve parse quality on both sides. In a maximum entropy bitext parsing model, we define a distribution over source trees,...
ACL
2009
13 years 7 months ago
2009
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
EGH
2010
Springer
13 years 7 months ago
2010
Springer
A ray cast algorithm utilizing a hierarchical acceleration structure needs to perform a tree traversal in the hierarchy. In its basic form, executing the traversal requires a stac...
MPC
1992
Springer
14 years 1 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...