Sciweavers

254 search results - page 2 / 51
» Multiple Approximate String Matching
Sort
View
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 27 days ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
FUIN
2006
98views more  FUIN 2006»
13 years 7 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
DEBU
2010
108views more  DEBU 2010»
13 years 7 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 25 days ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
MJ
2006
138views more  MJ 2006»
13 years 7 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy