All Questions
Tagged with spell-checking algorithm
38 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 ...
-2
votes
1
answer
77
views
how to correct wrong or shortened written words [closed]
I have to fix a problem related to a large number of user-generated skills.
Users can add any skills to their profiles, and I want to merge the ones that are essentially the same.
I have these pairs (...
0
votes
0
answers
416
views
Swift Spell Check Algorithm
Stuck trying to make a function that can spell check without using built in UITextChecker. I'd like to assume something like 'ce3t' as 'cat'.
Only help I could find online:
https://airspeedvelocity....
2
votes
1
answer
146
views
Spell-Check: Find one-to-one token difference mapping between two strings
I recently stumbled over this question on an internet archive and am having some difficulty wrapping my head around it. I want to find a desired mapping amongst the different tokens between two ...
3
votes
1
answer
1k
views
how to stop a java spell checker program from correcting repetitive words
I've implemented a program that does the following:
scan all of the words in a web page into a string (using jsoup)
Filter out all of the HTML markup and code
Put these words into a spell checking ...
2
votes
1
answer
949
views
Peter Norvig's spell checker for multi-word matches
Peter Norvig's famous spellchecker (Java 8 version here) is able to correct single words, if something close to that word appears in training data. But how can I adapt it to handle entire phrases. For ...
1
vote
1
answer
71
views
Constant-time Spelling Correction on Ten Million Entities
I have a list of ~10M entities. I need to match an entity that a user types out with an entity from the list. Users often misspell the entities (ie. orang instead of orange). I need to correct 1-2 ...
0
votes
1
answer
188
views
Spell correction improvement based on a set of letters with similar forms in PHP
I'm developing a spell corrector system for non-English language which works on OCR output. I use very large dictionaries to check spelling errors and give suggestions.
Most of spelling errors are ...
0
votes
1
answer
23
views
Statistical Spell Checking: General Approach and Avoid Feedback Loops
A database I am building has a large number of names, that are often repeated. However, many names have misspellings, and I want to attempt to automatically correct the misspellings. I do not know the ...
1
vote
1
answer
285
views
Comparing word to targeted words in dictionary
I'm trying to write a program in JAVA that stores a dictionary in a hashmap (each word under a different key) and compares a given word to the words in the dictionary and comes up with a spelling ...
1
vote
1
answer
559
views
How do spellcheck algorithms optimize their search for suggested words?
From what I understand, spellcheck algorithms look for suggestions by checking the number of transformations (swapping letters, adding letters, removing letters, etc.) a given word would need to ...
0
votes
2
answers
1k
views
Spell Checker using Ternary Search tree
I made a spell checker using Ternary search tree (TST).
Can anybody tell me how to find the next possible word in the TST?
eg: If i want to search the word "Manly" in spell checker and if the word ...
1
vote
2
answers
757
views
Spell Checker : Ternary Search tree
i have made a spell checker code using Ternary search tree. Can anybody tell me how to find the next possible word in TST.
for example if i want to search if i search a word "Manly" in spell checker ...
2
votes
1
answer
1k
views
Algorithm for clustering names
I have people names (first name, last name and surname) in db column.
The data is not full, for example some rows
have only first name, last name or surname.
are in different order (surname, last ...
0
votes
0
answers
133
views
Best data structure for this sort of word lookup / spellcheck?
I have a list of words such as:
mmad
mmaaddd
bbad
bbaadddd
Let's suppose that mad and bad are considered to be valid words according to some dictionary. Is there any ideal algorithm or data-structure ...