Rank: 231 based on 469 downloads (last 30 days) and 7 files submitted
photo

Brandon Kuczenski

E-mail
Company/University
University of California

Personal Profile:

Postdoctoral Researcher, Environmental Science and Management


 

Watch this Author's files

 

Files Posted by Brandon Kuczenski View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
23 Sep 2013 Capitalize strings using titlecase Capitalize the first letter of each word in a string or cell array of strings Author: Brandon Kuczenski strings, case, title case 18 0
19 Aug 2013 Find nearest-matching string from a set Computes shortest distance between a key string and a set of strings to find the nearest match. Author: Brandon Kuczenski string matching, levenshtein distance, strdist 23 5
  • 4.0
4.0 | 2 ratings
26 Jan 2004 addplot.m Add and delete points from a data set graphically on a plot axes using the mouse. Author: Brandon Kuczenski data exploration, plot, graphical, manipulation, graphics 11 2
  • 5.0
5.0 | 2 ratings
10 Dec 2003 Screenshot Peekplot Mouse click to view data points on plot. Author: Brandon Kuczenski annotation, customization, plot, graphical inspection, mouse, click 12 3
  • 4.5
4.5 | 4 ratings
25 Mar 2002 moveplot.m Enables mouse-based on-screen manipulation of Plot data Author: Brandon Kuczenski data exploration, plot, graphical, manipulation, graphics, data 28 24
  • 4.58333
4.6 | 25 ratings
Comments and Ratings by Brandon Kuczenski
Updated File Comments Rating
16 Aug 2013 Find nearest-matching string from a set Computes shortest distance between a key string and a set of strings to find the nearest match. Author: Brandon Kuczenski

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

Comments and Ratings on Brandon Kuczenski's Files View all
Updated File Comment by Comments Rating
08 Jun 2014 hline and vline Draws 'low-impact' horizontal or vertical lines on the current axes Author: Brandon Kuczenski Alexander

03 May 2014 Find nearest-matching string from a set Computes shortest distance between a key string and a set of strings to find the nearest match. Author: Brandon Kuczenski Yung-Yeh

Oh...I see

It's actually the Levenshtein distance. The title "nearest-matching string" really confuses me.

03 May 2014 Find nearest-matching string from a set Computes shortest distance between a key string and a set of strings to find the nearest match. Author: Brandon Kuczenski Yung-Yeh

This is weird, I tried

[x,d] = strnearest('ABC',{'""','"ABC"'})

but it return
x = [1 2]
d = 3

19 Feb 2014 hline and vline Draws 'low-impact' horizontal or vertical lines on the current axes Author: Brandon Kuczenski Adrianne

Simple and they work great.

16 Aug 2013 Find nearest-matching string from a set Computes shortest distance between a key string and a set of strings to find the nearest match. Author: Brandon Kuczenski Brandon Kuczenski

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

Contact us