| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poonin (0) - 1 freq poondin (1) - 3 freq poodin (1) - 10 freq pookin (1) - 1 freq doonin (1) - 1 freq pooin (1) - 5 freq poopin (1) - 1 freq poorin (1) - 45 freq poolin (1) - 2 freq pootin (1) - 1 freq roonin (1) - 1 freq phonin (1) - 22 freq soonin (1) - 1 freq poohin (1) - 1 freq pooerin (2) - 1 freq poon (2) - 2 freq poemin (2) - 1 freq hookin (2) - 2 freq mornin (2) - 962 freq polonie (2) - 1 freq soonit (2) - 1 freq soomin (2) - 7 freq moontin (2) - 13 freq pokin (2) - 19 freq proponin (2) - 3 freq |
poonin (0) - 1 freq soonin (2) - 1 freq roonin (2) - 1 freq poohin (2) - 1 freq peenin (2) - 3 freq poinun (2) - 1 freq pootin (2) - 1 freq pynin (2) - 1 freq phonin (2) - 22 freq poondin (2) - 3 freq doonin (2) - 1 freq pookin (2) - 1 freq poolin (2) - 2 freq pooin (2) - 5 freq poorin (2) - 45 freq poopin (2) - 1 freq poodin (2) - 10 freq poundin (3) - 12 freq poncin (3) - 1 freq poona (3) - 1 freq openin (3) - 126 freq pinyin (3) - 1 freq coinin (3) - 1 freq ironin (3) - 8 freq pourin (3) - 23 freq |
SoundEx code - P550 phnom - 1 freq pen-name - 4 freq pynin - 1 freq phonin - 22 freq peenin - 3 freq pennin - 2 freq pinnin - 4 freq poinun - 1 freq penim - 1 freq pieman - 4 freq poonin - 1 freq pannin - 2 freq punnin - 1 freq penman - 1 freq penann - 1 freq phonan - 2 freq pinyin - 1 freq panama - 1 freq pennan - 2 freq panini - 1 freq pmwn - 1 freq poemin - 1 freq |
MetaPhone code - PNN pynin - 1 freq peenin - 3 freq pennin - 2 freq pinnin - 4 freq poinun - 1 freq poonin - 1 freq pannin - 2 freq punnin - 1 freq penann - 1 freq pennan - 2 freq panini - 1 freq |
POONIN |
| Time to execute Levenshtein function - 0.220684 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.420292 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.030241 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.037940 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.000931 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. |