45 search results - page 1 / 9 » Indexing Text with Approximate q-Grams |
CPM
2000
Springer
13 years 10 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
SPIRE
2009
Springer
14 years 14 days ago
2009
Springer
We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new ind...
CIKM
1997
Springer
13 years 10 months ago
1997
Springer
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
MICS
2010
13 years 4 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...