Sciweavers

13 search results - page 1 / 3
» Generalized Mongue-Elkan Method for Approximate Text String ...
Sort
View
CICLING
2009
Springer
13 years 5 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
13 years 10 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
SPIRE
2010
Springer
13 years 3 months ago
Text Comparison Using Soft Cardinality
Abstract. The classical set theory provides a method for comparing objects using cardinality and intersection, in combination with well-known resemblance coefficients such as Dice,...
Sergio Jimenez, Fabio Gonzalez, Alexander F. Gelbu...
FUIN
2006
98views more  FUIN 2006»
13 years 4 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
CIKM
2001
Springer
13 years 9 months ago
Improved String Matching Under Noisy Channel Conditions
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
Kevyn Collins-Thompson, Charles Schweizer, Susan T...