| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pokered (0) - 1 freq powered (1) - 2 freq pooered (1) - 3 freq pouered (1) - 4 freq poodered (2) - 10 freq powdered (2) - 2 freq pokert (2) - 1 freq peered (2) - 26 freq pouskered (2) - 1 freq pooskered (2) - 3 freq pottered (2) - 1 freq lowered (2) - 25 freq touered (2) - 1 freq towered (2) - 1 freq puckered (2) - 3 freq tobered (2) - 1 freq dovered (2) - 6 freq pocketed (2) - 2 freq sobered (2) - 1 freq poored (2) - 56 freq poker (2) - 22 freq hovered (2) - 11 freq petered (2) - 3 freq papered (2) - 1 freq tooered (2) - 1 freq |
pokered (0) - 1 freq pooered (2) - 3 freq pouered (2) - 4 freq powered (2) - 2 freq poker (3) - 22 freq pooerd (3) - 1 freq puckered (3) - 3 freq poored (3) - 56 freq poured (3) - 28 freq poked (3) - 5 freq pouskered (3) - 1 freq papered (3) - 1 freq poodered (3) - 10 freq pokert (3) - 1 freq peered (3) - 26 freq petered (3) - 3 freq pooskered (3) - 3 freq pioneered (4) - 1 freq mikerid (4) - 1 freq pared (4) - 2 freq purred (4) - 8 freq poukerie (4) - 1 freq pouked (4) - 1 freq pourd (4) - 1 freq preed (4) - 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 - PKRT pokert - 1 freq puckert - 2 freq hypocrite - 4 freq puckered - 3 freq pokered - 1 freq |
POKERED |
| Time to execute Levenshtein function - 0.196135 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.366995 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.027325 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.043416 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.000949 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. |