1388 search results - page 154 / 278 » Querying Linguistic Trees |
187
click to vote
SIGMOD
2006
ACM
16 years 25 days ago
2006
ACM
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...
100
Voted
BIRTHDAY
1992
Springer
15 years 4 months ago
1992
Springer
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
COLING
2002
15 years 16 days ago
2002
This paper describes an indexing substrate for typed feature structures (ISTFS), which is an efficient retrieval engine for typed feature structures. Given a set of typed feature ...
87
Voted
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
114
Voted
KES
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Search engines traditionally index unstructured text and return ranked lists of documents that match a given query. As search engines functionally move in the direction o...