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
>>
Cite As
Brandon Kuczenski (2021). 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. Retrieved .
Comments and Ratings (5)
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Acknowledgements
Inspired by: Calculation of distance between strings
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Oh...I see
It's actually the Levenshtein distance. The title "nearest-matching string" really confuses me.
This is weird, I tried
[x,d] = strnearest('ABC',{'""','"ABC"'})
but it return
x = [1 2]
d = 3
apologies- I have uploaded a corrected submission.
@@ -98,13 +98,16 @@
else
bb=list{T};
end
- luma=numel(key); lima=numel(bb);
- dl=dist*ones([luma+1,lima+1]);
- dl(1,:)=0:lima; dl(:,1)=0:luma;
+ eql=char({key;bb}); % equal length
+ keyy=eql(1,:); % space-padded key
+ bb=eql(2,:); % space-padded candidate
+ luma=numel(keyy);
+ dl=dist*ones([luma+1,luma+1]);
+ dl(1,:)=0:luma; dl(:,1)=0:luma;
%Distance
for i=1:luma
- for j=max([1,i-dist]):min([lima,i+dist])
- kr=krk*(~(key(j)==bb(i)));
+ for j=max([1,i-dist]):min([luma,i+dist])
+ kr=krk*(~(keyy(min([j luma]))==bb(i)));
dl(i+1,j+1)=min([dl(i,j)+kr,dl(i,j+1)+1,dl(i+1,j)+1]);
end
end
Still no working example? :)
Was this tested?
>> [index,distance] = strnearest({'first string'},{'string 2'})
index =
[1]
distance =
0
Perhaps a working example would be useful.