Find nearest-matching string from a set

Computes shortest distance between a key string and a set of strings to find the nearest match.
1,3K téléchargements
Mise à jour 19 août 2013

Afficher la licence

Uses a modified Vagner-Fischer algorithm to find the Levenshtein distance between each pair of strings. Progressively narrows the threshold to equal the distance of the best match found so far, reducing run time.

Updated to correct the algorithm. (sorry!)

Optional behaviors include an upper-bound threshold distance, detect first or multiple matches of equal distance, case insensitivity.


>> [i,d]=strnearest({'first string'},{'string 2','abcdefgh','FURSrtd','firststring'})

i =


d =


>> [i,d]=strnearest({'1','first string'},{'string 2','abcdefgh','1st string','FURSrtd','seconaaad string','2'})

i =

[6] [3]

d =

1 5


Citation pour cette source

Brandon Kuczenski (2024). Find nearest-matching string from a set (, MATLAB Central File Exchange. Récupéré le .

Compatibilité avec les versions de MATLAB
Créé avec R2011b
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
En savoir plus sur Characters and Strings dans Help Center et MATLAB Answers

Inspiré par : Calculation of distance between strings

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Publié le Notes de version

Updated to correct an error in the code and to add working examples to the description.

Add link to strdist.m