All Questions
3 questions
1
vote
2
answers
261
views
How do I efficiently find pairs of strings in a list with low (Damerau-)Levenshtein distance? [closed]
I currently contribute to a certain wiki database that currently has about 500000 entries. Some of these entries have keywords attached. Due to a previous lack of restrictions on the database, people ...
- 19
2
votes
1
answer
413
views
C spell checking, string concepts, algorithms
this is my first question on stack overflow. Some quick background, this is not for a school project, just for fun and practice and learning. I'm trying to make a spell checker in C. The problem I'm ...
- 39
0
votes
2
answers
2k
views
efficient algorithm to perform spell check on HTML document
I have a HTML document, a list of common spelling mistakes, and the correct spelling for each case.
The HTML documents will be up to ~50 pages and there are ~30K spelling correction entries.
What is ...
- 29.5k