154 search results - page 14 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
SIGIR
1998
ACM
15 years 3 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
103
click to vote
ICDE
2011
IEEE
14 years 3 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
VLDB
2007
ACM
15 years 5 months ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
190
click to vote
FCCM
2011
IEEE
14 years 3 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...