| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| impoverished (0) - 1 freq dimoleished (4) - 1 freq perished (4) - 8 freq imperilled (4) - 1 freq imprisoned (5) - 6 freq replenished (5) - 2 freq poleeshed (5) - 1 freq impressed (5) - 52 freq imposed (5) - 9 freq nourished (5) - 2 freq improvise (5) - 1 freq immersed (5) - 4 freq impeached (5) - 1 freq empowered (5) - 2 freq flourished (5) - 4 freq plenished (5) - 1 freq poalished (5) - 1 freq pulverised (5) - 1 freq modernised (5) - 1 freq polarised (5) - 1 freq perishes (5) - 1 freq cherished (5) - 9 freq mesmerised (5) - 8 freq parished (5) - 1 freq €˜pulverised (5) - 1 freq |
impoverished (0) - 1 freq perished (6) - 8 freq impressed (7) - 52 freq parished (7) - 1 freq imprisoned (7) - 6 freq imperilled (7) - 1 freq mesmerised (8) - 8 freq motorised (8) - 1 freq polished (8) - 39 freq perishes (8) - 1 freq cherished (8) - 9 freq unpolished (8) - 2 freq empressed (8) - 1 freq empouered (8) - 1 freq polarised (8) - 1 freq imoressed (8) - 1 freq imprinted (8) - 2 freq imported (8) - 4 freq immersed (8) - 4 freq impeached (8) - 1 freq replenished (8) - 2 freq nourished (8) - 2 freq dimoleished (8) - 1 freq poleeshed (8) - 1 freq empowered (8) - 2 freq |
SoundEx code - I511 infeft - 2 freq invioved - 1 freq infoboxes - 3 freq infobox - 1 freq imbibe - 1 freq immoveable - 1 freq infeftments - 1 freq ionafyfe - 94 freq infobears - 1 freq impoverished - 1 freq iainpope - 6 freq |
MetaPhone code - IMPFRXT impoverished - 1 freq |
IMPOVERISHED |
| Time to execute Levenshtein function - 0.219103 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.581171 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.067210 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.092686 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.000939 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. |