| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pouskered (0) - 1 freq pooskered (1) - 3 freq puckered (2) - 3 freq fuskered (2) - 1 freq pokered (2) - 1 freq pouered (2) - 4 freq poussed (3) - 4 freq pocketed (3) - 2 freq tuckered (3) - 1 freq touseled (3) - 1 freq holstered (3) - 1 freq bloustered (3) - 1 freq poodered (3) - 10 freq pondered (3) - 4 freq pouked (3) - 1 freq potsherd (3) - 1 freq fuspered (3) - 22 freq clustered (3) - 1 freq poured (3) - 28 freq touered (3) - 1 freq frustered (3) - 1 freq coulered (3) - 1 freq possesed (3) - 1 freq pottered (3) - 1 freq kyuckered (3) - 3 freq |
pouskered (0) - 1 freq pooskered (1) - 3 freq pokered (3) - 1 freq puckered (3) - 3 freq fuskered (3) - 1 freq pestered (4) - 1 freq pouered (4) - 4 freq hunkered (5) - 29 freq pooered (5) - 3 freq peuthered (5) - 1 freq plistered (5) - 1 freq kyuckered (5) - 3 freq mustered (5) - 1 freq plastered (5) - 12 freq poukerie (5) - 1 freq ploutered (5) - 2 freq skared (5) - 1 freq skyred (5) - 1 freq pousters (5) - 1 freq pottered (5) - 1 freq ushered (5) - 5 freq powdered (5) - 2 freq powered (5) - 2 freq prospered (5) - 1 freq pondered (5) - 4 freq |
SoundEx code - P263 pokert - 1 freq puckert-up - 1 freq puckert - 2 freq pichert - 1 freq pooskered - 3 freq puckered - 3 freq password - 5 freq pyochered - 3 freq pouskered - 1 freq pokered - 1 freq |
MetaPhone code - PSKRT pooskered - 3 freq pouskered - 1 freq |
POUSKERED |
| Time to execute Levenshtein function - 0.414961 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.664753 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.040909 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.088357 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.001287 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. |