Find nearest-matching string from a set
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.
Examples:
>> [i,d]=strnearest({'first string'},{'string 2','abcdefgh','FURSrtd','firststring'})
i =
[4]
d =
2
>> [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 (https://www.mathworks.com/matlabcentral/fileexchange/36981-find-nearest-matching-string-from-a-set), MATLAB Central File Exchange. Récupéré le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
Tags
Remerciements
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!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
1.2.0.0 | Updated to correct an error in the code and to add working examples to the description. |
||
1.1.0.0 | Add link to strdist.m |
||
1.0.0.0 |