1388 search results - page 66 / 278 » Querying Linguistic Trees |
97
Voted
ACL
2010
14 years 10 months ago
2010
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
176
Voted
SIGMOD
2007
ACM
16 years 21 days ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
225
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
100
Voted
CL
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
ACL
2010
14 years 10 months ago
2010
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...