1000 search results - page 20 / 200 » Dependency Tree Automata |
155
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
171
click to vote
LICS
2007
IEEE
16 years 5 days ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
189
click to vote
COLING
2008
15 years 7 months ago
2008
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...
149
click to vote
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
138
click to vote
ACL
1998
15 years 7 months ago
1998
This paper proposes decoupling the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a word...