1388 search results - page 68 / 278 » Querying Linguistic Trees |
97
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
98
Voted
PODS
2007
ACM
16 years 21 days ago
2007
ACM
Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO...
92
Voted
ACL
2009
14 years 10 months ago
2009
User generated content is characterized by short, noisy documents, with many spelling errors and unexpected language usage. To bridge the vocabulary gap between the user's in...
114
Voted
SODA
2000
ACM
15 years 1 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...