Statistical Analysis Stack Exchange
Statistical Analysis Stack Exchange

Questions tagged [levenshtein-distance]

a string metric for measuring the difference between two sequences

The Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions, or substitutions) required to change one word into the other.

--Wikipedia

3 questions
6
votes
2 answers

Levenshtein Distance vs Damerau Levenstein vs Optimal String Alignment Distance

Could anyone explain in simple words (and maybe with an example) what the difference between the Levenshtein Distance, Damerau Levenstein, and Optimal String Alignment Distance? When would one use one over the other distance algorithm? And the Math…
Pluviophile
  • 2,381
  • 8
  • 18
  • 45
1
vote
0 answers

How should I go about recoding open-ended answers from a survey?

I have some open-ended survey data that I'm trying to recode, but the range of answers is very large (e.g. one question got responses of 'word', 'separate', 'mesabatainia', and 'abra cadabra alakazam'). I'm hoping to, for each question, recode the…
Jodast
  • 155
  • 5
0
votes
0 answers

matlab cluster algorithms for a known distance matrix computed by Levenshtein distance

I have a large number of string and I calculated their pairwise Levenshtein distance to form a distance matrix. I tried hierarchy clustring in Matlab but the results do not make much sense. I think it is because I do not use a built in distance…
Jiaming Luo
  • 1