N-gram similarity and distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 115-126

  Kondrak, Grzegorz ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATION THEORY; EXPERIMENTS; FINITE ELEMENT METHOD; MEASUREMENT THEORY; NUMERICAL ANALYSIS;

FINITE ALPHABET; RECURSIVE DEFINITIONS;

ALGORITHMS;

EID: 33646745344     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_13     Document Type: Conference Paper

References (14)

1. Chris Brew and David McKelvie. 1996. Word-pair extraction for lexicography. In Proc. of the 2nd Intl Conf. on New Methods in Language Processing, pages 45-55.
2. Vacláv Chvátal and David Sankoff. 1975. Longest common subsequences of two random sequences. Journal of Applied Probability, 12:306-315.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms. The MIT Press, second edition.
4. John Hewson. 1993. A computer-generated dictionary of proto-Algonquian. Hull, Quebec: Canadian Museum of Civilization.
5. Bruce L. Lambert, Swu-Jane Lin, Ken-Yu Chang, and Sanjay K. Gandhi. 1999. Similarity As a Risk Factor in Drug-Name Confusion Errors: The Look-Alike (Orthographic) and Sound-Alike (Phonetic) Model. Medical Care, 37(12):1214-1225.
6. A. Marzal and E. Vidal. 1993. Computation of normalized edit distance and applications. IEEE Trans. Pattern Analysis and Machine Intelligence, 15(9):926-932.
7. I. Dan Melamed. 1998. Manual annotation of translational equivalence: The Blinker project. Technical Report IRCS #98-07, University of Pennsylvania.
8. I. Dan Melamed. 1999. Bitext maps and alignment via pattern recognition. Computational Linguistics, 25(1):107-130.
9. D. Sankoff and J. B. Kruskal, editors. 1983. Time warps, string edits, and macromolecules: the theory and practice of sequence comparison. Addison-Wesley.
10. Bill Smyth. 2003. Computing Patterns in Strings. Pearson.
11. Dan Tufis. 2002. A cheap and fast way to build useful translation lexicons. In Proc. of the 19th Intl Conf. on Computational Linguistics, pages 1030-1036.
12. Esko Ukkonen. 1992. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92:191-211.
13. Use caution - avoid confusion. United States Pharmacopeial Convention Quality Review, No. 76, March 2001. Available from http://www.bhhs.org/pdf/qr76. pdf.
14. Robert A. Wagner and Michael J. Fischer. 1974. The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1):168-173.