254 search results - page 21 / 51 » Multiple Approximate String Matching |
ICDAR
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
CPM
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
The task of object identification occurs when integrating information from multiple websites. The same data objects can exist in inconsistent text formats across sites, making it ...
CIBCB
2007
IEEE
14 years 2 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
CHI
1993
ACM
13 years 11 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...