| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yrwuvgvi (0) - 1 freq yrivvi (3) - 1 freq rivvi (4) - 1 freq prwudqii (4) - 1 freq rougvie (4) - 1 freq trunge (5) - 1 freq rouved (5) - 1 freq revivit (5) - 1 freq wuvven (5) - 2 freq ywv (5) - 1 freq trough (5) - 6 freq druv (5) - 1 freq wrung (5) - 9 freq rugas (5) - 1 freq rung (5) - 25 freq ruairi (5) - 1 freq yuv (5) - 15 freq mcmvdvi (5) - 1 freq rougin (5) - 1 freq you've (5) - 120 freq wpygvb (5) - 1 freq trudge (5) - 5 freq bravi (5) - 1 freq young (5) - 1106 freq vwvg (5) - 1 freq |
yrwuvgvi (0) - 1 freq yrivvi (5) - 1 freq rougvie (6) - 1 freq rivvi (6) - 1 freq wvpgv (7) - 1 freq vwvg (7) - 1 freq rwg (7) - 1 freq revive (7) - 7 freq yywpivovu (8) - 1 freq kwuavb (8) - 1 freq zulvgvg (8) - 1 freq tkvvi (8) - 1 freq reugh (8) - 1 freq ruhgq (8) - 1 freq luvvy (8) - 5 freq rudge (8) - 1 freq wu've (8) - 2 freq rough (8) - 50 freq swudge (8) - 2 freq yougov (8) - 4 freq yrviq (8) - 1 freq drwsv (8) - 1 freq regi (8) - 24 freq airwaves (8) - 4 freq rungs (8) - 3 freq |
SoundEx code - Y612 yearbeuk - 1 freq yerbs - 2 freq yearbuik - 1 freq yerbaws - 1 freq yrwuvgvi - 1 freq yrfyyujirw - 1 freq yyyurhuifc - 1 freq yrviq - 1 freq |
MetaPhone code - RWFKF yrwuvgvi - 1 freq |
YRWUVGVI |
| Time to execute Levenshtein function - 0.268290 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.613020 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.030777 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.069411 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.001005 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. |