621 search results - page 33 / 125 » Parsing As Tree Traversal |
DCC
2011
IEEE
13 years 4 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
CORR
2000
Springer
13 years 9 months ago
2000
Springer
This paper presents a semantic parsing approach for non domain-specific texts. Semantic parsing is one of the major bottlenecks of Natural Language Understanding (NLU) systems and...
ACL
2009
13 years 7 months ago
2009
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
COLING
1996
13 years 11 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
SIGMETRICS
1987
ACM
14 years 1 months ago
1987
ACM
Expressions are found for the throughput and delay performance of a Tree Conflict Resolution Algorithm that is used in a Local Area Network with carrier sensing (and possibly also ...