| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rrotf (0) - 1 freq roof (2) - 104 freq rots (2) - 4 freq brot (2) - 1 freq wrote (2) - 147 freq roots (2) - 68 freq grott (2) - 1 freq groof (2) - 1 freq brote (2) - 1 freq roott (2) - 1 freq rota (2) - 1 freq rof (2) - 3 freq rot (2) - 39 freq rolf (2) - 1 freq vrote (2) - 1 freq rutf (2) - 1 freq riots (2) - 3 freq rote (2) - 2 freq broth (2) - 70 freq roth (2) - 2 freq prof (2) - 29 freq root (2) - 35 freq froth (2) - 6 freq wrot (2) - 8 freq trots (2) - 3 freq |
rrotf (0) - 1 freq rutf (3) - 1 freq wrot (4) - 8 freq froth (4) - 6 freq trots (4) - 3 freq prof (4) - 29 freq roth (4) - 2 freq riot (4) - 31 freq root (4) - 35 freq troth (4) - 18 freq irrate (4) - 1 freq grytfu (4) - 1 freq rarity (4) - 3 freq arrit (4) - 1 freq trot (4) - 17 freq trott (4) - 4 freq broth (4) - 70 freq proof (4) - 48 freq grott (4) - 1 freq roof (4) - 104 freq wrote (4) - 147 freq roots (4) - 68 freq rots (4) - 4 freq rote (4) - 2 freq brot (4) - 1 freq |
SoundEx code - R310 redup - 1 freq redd-up - 7 freq rutf - 1 freq rdf - 3 freq rowed-up - 2 freq ri¢tfu - 1 freq red-top - 1 freq reid-tap - 1 freq riddup - 3 freq redbhoy - 1 freq rrotf - 1 freq |
MetaPhone code - RTF rutf - 1 freq rdf - 3 freq ri¢tfu - 1 freq rrotf - 1 freq |
RROTF |
| Time to execute Levenshtein function - 0.277883 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.533197 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.039505 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.050404 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.001202 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. |