Find nearest-matching string from a set
Computes shortest distance between a key string and a set of strings to find the nearest match.
現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
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 (2026). Find nearest-matching string from a set (https://jp.mathworks.com/matlabcentral/fileexchange/36981-find-nearest-matching-string-from-a-set), MATLAB Central File Exchange. に取得済み.
謝辞
ヒントを得たファイル: Calculation of distance between strings
