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
>>
인용 양식
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. 검색됨 .
MATLAB 릴리스 호환 정보
플랫폼 호환성
Windows macOS Linux카테고리
태그
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!