LevenshteinDistance - Teradata Vantage

Machine Learning Engine Analytic Function Reference

Product
Teradata Vantage
Release Number
8.00
1.0
Published
May 2019
Language
English (United States)
Last Update
2019-11-22
dita:mapPath
blj1506016597986.ditamap
dita:ditavalPath
blj1506016597986.ditaval
dita:id
B700-4003
lifecycle
previous
Product Category
Teradata Vantageā„¢

The LevenshteinDistance function computes the Levenshtein distance between two text values. The Levenshtein distance (or edit distance) is the number of edits needed to transform one string into the other. An edit is an insertion, deletion, or substitution of a single character.

The Levenshtein distance is useful for fuzzy matching of sequences and strings. The LevenshteinDistance function is often used to resolve a user-entered value to a standard value. For example, when a enters "Jon Dow" when searching for "John Doe".

A typical application of the LevenshteinDistance function is genome sequencing.