55 search results - page 7 / 11 » Fast index for approximate string matching |
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
SPIRE
2005
Springer
14 years 2 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
MJ
2006
13 years 8 months ago
2006
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
LREC
2010
13 years 10 months ago
2010
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...