Levenshtein Distance
CHF 37.10
Auf Lager
SKU
GJ0OO9EFAO5
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Mi., 29.10.2025 und Do., 30.10.2025
Details
In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance). The Levenshtein distance between two strings is given by the minimum number of operations needed to transform one string into the other, where an operation is an insertion, deletion, or substitution of a single character. A generalization of the Levenshtein distance (Damerau Levenshtein distance) allows the transposition of two characters as an operation. Some Translation Environment Tools, such as translation memory leveraging applications, use the Levenhstein algorithm to measure the edit distance between two fuzzy matching content segments.The metric is named after Vladimir Levenshtein, who considered this distance in 1965. It is often used in applications that need to determine how similar, or different, two strings are, such as spell checkers
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130216900
- Editor Frederic P. Miller, Agnes F. Vandome, John McBrewster
- Sprache Englisch
- Größe H3mm x B220mm x T150mm
- Jahr 2009
- EAN 9786130216900
- Format Fachbuch
- ISBN 978-613-0-21690-0
- Titel Levenshtein Distance
- Untertitel Information theory, Computer science, String (computer science), String metric, Damerau-Levenshtein distance, Spell checker, Hamming distance
- Gewicht 107g
- Herausgeber Alphascript Publishing
- Anzahl Seiten 68
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
