178 search results - page 19 / 36 » Fast Algorithms for Top-k Approximate String Matching |
122
click to vote
ANCS
2005
ACM
15 years 3 months ago
2005
ACM
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
DIS
2006
Springer
15 years 1 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
69
Voted
ICAIL
2003
ACM
15 years 2 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
CHI
1993
ACM
15 years 1 months ago
1993
ACM
We describe pictographic naming, a new approach to naming for pen-based computers, in which filenames are pictures rather than ASCII strings. Handwriting recognition (HWX) of a n...
CPM
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...