| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| renovatin (0) - 1 freq renivatien (2) - 1 freq renovate (2) - 1 freq resonatin (2) - 1 freq recoontin (3) - 3 freq retreatin (3) - 1 freq decoratin (3) - 6 freq resortin (3) - 3 freq pentratin (3) - 1 freq reportin (3) - 15 freq recountin (3) - 1 freq relocatit (3) - 1 freq repeatin (3) - 24 freq derogatin (3) - 1 freq recoverin (3) - 7 freq revoltin (3) - 1 freq reloadin (3) - 1 freq innovation (3) - 6 freq removin (3) - 4 freq rentin (3) - 2 freq relocation (3) - 2 freq reheatin (3) - 1 freq relatin (3) - 9 freq elevatin (3) - 1 freq novation (3) - 1 freq |
renovatin (0) - 1 freq renivatien (2) - 1 freq renovate (3) - 1 freq rentin (4) - 2 freq novation (4) - 1 freq innovation (4) - 6 freq resonatin (4) - 1 freq elevatin (5) - 1 freq relocation (5) - 2 freq relatin (5) - 9 freq reheatin (5) - 1 freq urinatin (5) - 1 freq renton (5) - 4 freq rantin (5) - 9 freq reunitin (5) - 1 freq renditon (5) - 1 freq rendeition (5) - 1 freq rendition (5) - 5 freq invitin (5) - 16 freq rendeetion (5) - 1 freq removin (5) - 4 freq resortin (5) - 3 freq retreatin (5) - 1 freq recoontin (5) - 3 freq recountin (5) - 1 freq |
SoundEx code - R513 roonaboot - 17 freq removed - 15 freq rounaboot - 8 freq rimbaud - 1 freq rounaboots - 1 freq remuived - 5 freq renivatien - 1 freq ramped - 3 freq rampit - 2 freq roonaboots - 3 freq roun-about - 2 freq renoved - 1 freq rainbowed - 1 freq runabout - 1 freq rimbaud's - 1 freq rounabout - 1 freq rinaboots - 1 freq removit - 1 freq renovatin - 1 freq romped - 1 freq r'umpteenth - 1 freq re-invadit - 1 freq renovate - 1 freq runfatboyrun - 1 freq |
MetaPhone code - RNFTN renivatien - 1 freq renovatin - 1 freq |
RENOVATIN |
| Time to execute Levenshtein function - 0.214332 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.443349 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.035302 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.047727 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.001095 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. |