318 search results - page 13 / 64 » A New Indexing Method for Approximate String Matching |
IQIS
2007
ACM
14 years 11 months ago
2007
ACM
Approximate join is an important part of many data cleaning and integration methodologies. Various similarity measures have been proposed for accurate and efficient matching of st...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
80
Voted
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
CPM
2001
Springer
15 years 1 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
ICDAR
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper describes a system for efficient indexing and retrieval of words in collections of document images. The proposed method is based on two main principles: unsupervised pr...