Edit distance with single-symbol combinations and splits

Proceedings of the Prague Stringology Conference 2008

Volumn , Issue , 2008, Pages 208-217

  Christodoulakis, Manolis ^a   Brey, Gerhard ^b  

^a UNIVERSITY OF EAST LONDON   (United Kingdom)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Combination; Edit distance; OCR; Split

Indexed keywords

BROKEN DOWN; COMBINATION; EDIT DISTANCE; SPLIT; STRING SIMILARITY; TOTAL LENGTH; UPPER BOUND;

OPTICAL CHARACTER RECOGNITION;

ALGORITHMS;

EID: 70749140901     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. A. V. Aho and M. J. Corasick: Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18(6) 1975, pp. 333-340.
2. M. Crochemore and W. Rytter: Jewels of Stringology: Text Algorithms, World Scientific, 2002.
3. V. I. Levenshtein: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10 1966, pp. 707-710.
4. G. Navarro: A guided tour to approximate string matching. ACM Computing Surveys, 33(1) 2001, pp. 31-88.
5. Nineteenth-Century Serials Edition (NCSE): http://www.ncse.ac.uk.
6. D. Sankoff and J. Kruskal, eds., Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, 1983.
7. B. Smyth: Computing Patterns in Strings, Pearson Education, 2003.