Fast Levenshtein distance in R?

r performance packages levenshtein-distance stringdist
mbq picture mbq · Jul 5, 2010 · Viewed 16.6k times · Source

Is there a package that contains Levenshtein distance counting function which is implemented as a C or Fortran code? I have many strings to compare and stringMatch from MiscPsycho is too slow for this.

Answer

Ben picture Ben · Mar 28, 2014

And stringdist in the stringdist package does it too, even faster than levenshteinDist under certain conditions (1)

Related questions

Append an object to a list in R in amortized constant time, O(1)?

If I have some R list mylist, you can append an item obj to it like so: mylist[[length(mylist)+1]] <- obj But surely there is some more compact way. When I was new at R, I tried writing …

Read More
How to convert a huge list-of-vector to a matrix more efficiently?

I have a list of length 130,000 where each element is a character vector of length 110. I would like to convert this list to a matrix with dimension 1,430,000*10. How can I do it more efficiently?\ My code is : output=NULL for(…

Read More
Split a large dataframe into a list of data frames based on common value in column

I have a data frame with 10 columns, collecting actions of "users", where one of the columns contains an ID (not unique, identifying user)(column 10). the length of the data frame is about 750000 rows. I am trying to extract individual data …

Read More