Questions tagged [edit-distance]
A class of problems concerned with finding or minimizing the sequence of change operations (such as insertion, deletion, substitution, or transposition) to convert one list or string into another
119 questions
3 votes
1 answer
282 views
Damerau-Levenshtein distance performance improvements
I am working on a Python C-extension to calculate Damerau-Levenshtein distance. I am not really familiar with C at all--I just know that it generally has better performance. However, I am not sure how ...
- 133
2 votes
0 answers
114 views
Simple diff utility in Java using OOP take 2
(See the previous iteration here.) After further revising my code, I have: com.github.coderodde.diff.Diff.java: ...
- 32.3k
2 votes
1 answer
161 views
Simple diff utility in Java using OOP
(Previous and initial iteration lives here.) (The next iteration is here.) Now I was able to spare some lines by putting diff related state in an object. Also, I relied on ...
- 32.3k
0 votes
2 answers
183 views
New String similarity algorithm (java)
Recently I have been developing a library for Java which provides utility functions for arrays, strings, etc.. While researching string similarity algorithms, I managed to write one of my own. I am ...
- 49
2 votes
0 answers
52 views
Loop through the nearest switch and deletion neighbours of a Boolean assignment
My goal is to look for nearest neighbours in a Boolean-assigned mapping (a Python dictionary). For this purpose I'm looping through the candidates, starting from those with the closest distance. The ...
- 121
5 votes
1 answer
126 views
calculating upper bound on normalized weighted levenshtein distance
Current implementation I am using a normalized weighted Levenshtein distance for two utf32 strings with the following costs (insertion: 1, deletion: 1, replacement: 2). The normalization is performed ...
- 151
1 vote
1 answer
204 views
"Edit Distance" algorithm
I have a piece of code that calculates the edit distance between words and works, but it's apparently not fast enough. ClosestWords.java: ...
- 113
1 vote
1 answer
103 views
Filter string with min distance in r
I have the following sample data: target <- "Stackoverflow" candidates <- c("Stackflow", "Stackflow", "Stckoverfow") I would like to filter the string from ...
- 113