Distances on Strings and Permutations

Michel Marie Deza and Elena Deza
Additional contact information
Michel Marie Deza: École Normale Supérieure
Elena Deza: Moscow State Pedagogical University

Chapter Chapter 11 in Encyclopedia of Distances, 2013, pp 197-208 from Springer

Abstract: Abstract An alphabet is a finite set $\mathcal{A}$ , $|\mathcal{A}| \ge 2$ , elements of which are called characters (or symbols). A string (or word) is a sequence of characters over a given finite alphabet $\mathcal{A}$ . The set of all finite strings over the alphabet $\mathcal{A}$ is denoted by $W(\mathcal{A})$ . Examples of real world applications, using distances and similarities of string pairs, are Speech Recognition, Bioinformatics, Information Retrieval, Machine Translation, Lexicography, Dialectology.

Keywords: Edit Distance; Kolmogorov Complexity; Editing Operation; Minimal Total Cost; Longe Common Subsequence (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-30958-8_11

Ordering information: This item can be ordered from
http://www.springer.com/9783642309588

DOI: 10.1007/978-3-642-30958-8_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().