| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roosevelt (0) - 1 freq goose-gut (4) - 1 freq roosters (4) - 3 freq roost (4) - 41 freq rooshie (4) - 1 freq rosebed (4) - 1 freq oorseels (4) - 2 freq rooteen (4) - 1 freq rosehill (4) - 3 freq roondest (4) - 2 freq croosely (4) - 2 freq lookeet (4) - 1 freq rooster (4) - 18 freq hooseless (4) - 1 freq revolt (4) - 3 freq hoose'll (4) - 2 freq moose'll (4) - 1 freq ronseal (4) - 1 freq foretelt (4) - 4 freq joogelt (4) - 1 freq brouselt (4) - 1 freq whosever (4) - 1 freq hoosehald (4) - 1 freq goosefat (4) - 1 freq rootet (4) - 1 freq |
roosevelt (0) - 1 freq revolt (5) - 3 freq revealt (5) - 1 freq reishelt (5) - 1 freq raivelt (5) - 20 freq ravelt (5) - 1 freq reeshelt (5) - 2 freq russelt (5) - 1 freq rustlt (6) - 1 freq levelt (6) - 1 freq revel (6) - 2 freq rostert (6) - 2 freq tooslet (6) - 1 freq rebelt (6) - 1 freq revealit (6) - 2 freq roostie (6) - 2 freq revell (6) - 1 freq revert (6) - 4 freq roswell (6) - 1 freq roosit (6) - 2 freq roostit (6) - 6 freq severt (6) - 1 freq grevelt (6) - 1 freq roset (6) - 2 freq risult (6) - 1 freq |
SoundEx code - R214 reek-bleckened - 1 freq rockpools - 1 freq resplendent - 4 freq re-spell - 1 freq risible - 1 freq respellin - 1 freq roosevelt - 1 freq re-shuffle - 2 freq rrjvalentine - 1 freq rihcpl - 1 freq roezvlrkac - 1 freq |
MetaPhone code - RSFLT roosevelt - 1 freq |
ROOSEVELT |
| Time to execute Levenshtein function - 0.231942 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.396375 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.031227 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037702 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000945 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |