1388 search results - page 12 / 278 » Querying Linguistic Trees |
RTA
2004
Springer
15 years 5 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
109
click to vote
DATESO
2009
14 years 10 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
COLING
2008
15 years 1 months ago
2008
In this paper, we will describe a search tool for a huge set of ngrams. The tool supports queries with an arbitrary number of wildcards. It takes a fraction of a second for a sear...
110
Voted
DEXAW
2004
IEEE
15 years 4 months ago
2004
IEEE
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
105
click to vote
ACL
2009
14 years 10 months ago
2009
This paper presents a system for querying treebanks. The system consists of a powerful query language with natural support for cross-layer queries, a client interface with a graph...