Sciweavers

18 search results - page 2 / 4
» Increased Bit-Parallelism for Approximate String Matching
Sort
View
AAAI
2010
13 years 7 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
CIKM
1997
Springer
13 years 9 months ago
Applications of Approximate Word Matching in Information Retrieval
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
James C. French, Allison L. Powell, Eric Schulman
DSD
2005
IEEE
123views Hardware» more  DSD 2005»
13 years 11 months ago
Hardware-Based Implementation of the Common Approximate Substring Algorithm
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
Kenneth B. Kent, Sharon Van Schaick, Jacqueline E....
IQIS
2007
ACM
13 years 7 months ago
Accuracy of Approximate String Joins Using Grams
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...
Oktie Hassanzadeh, Mohammad Sadoghi, Renée ...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 5 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos