242 search results - page 2 / 49 » Approximate substring selectivity estimation |
ICDAR
2009
IEEE
13 years 2 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
ISMB
1998
13 years 6 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
IDEAS
2008
IEEE
13 years 11 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
COOPIS
2004
IEEE
13 years 8 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...