| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yplan (0) - 1 freq plan (1) - 236 freq uplan (1) - 4 freq klan (2) - 1 freq dylan (2) - 15 freq plat (2) - 4 freq uplans (2) - 2 freq pan (2) - 137 freq rypan (2) - 1 freq plain (2) - 178 freq plane (2) - 68 freq yappan (2) - 1 freq yulin (2) - 1 freq spean (2) - 2 freq pran (2) - 1 freq oilan (2) - 1 freq upoan (2) - 7 freq paan (2) - 3 freq splat (2) - 8 freq 'play (2) - 1 freq inlan (2) - 1 freq plant (2) - 82 freq plan' (2) - 1 freq ulan (2) - 1 freq ellan (2) - 2 freq |
yplan (0) - 1 freq uplan (1) - 4 freq plan (1) - 236 freq plaan (2) - 1 freq plen (2) - 109 freq plain (2) - 178 freq plane (2) - 68 freq plaen (2) - 1 freq lan (3) - 139 freq plans (3) - 104 freq plank (3) - 29 freq flan (3) - 3 freq 'plane (3) - 1 freq 'alan (3) - 2 freq plae (3) - 1 freq pleen (3) - 1 freq milan (3) - 3 freq solan (3) - 7 freq clan (3) - 56 freq plaw (3) - 1 freq play (3) - 748 freq plaein (3) - 1 freq pylon (3) - 1 freq pilin (3) - 9 freq plooan (3) - 1 freq |
SoundEx code - Y145 yabblin - 2 freq yiblins - 1 freq yplan - 1 freq yvlnycx - 1 freq |
MetaPhone code - PLN plain - 178 freq pilin - 9 freq pullin - 107 freq peelin - 5 freq plan - 236 freq plane - 68 freq pulein - 2 freq pailin - 8 freq plooin - 17 freq plouin - 13 freq 'plane - 1 freq pullen - 1 freq plaan - 1 freq pylon - 1 freq pleuan - 1 freq paulin' - 1 freq pauline - 36 freq plen - 109 freq pallin - 2 freq palin - 4 freq pey-line - 1 freq plaen - 1 freq plene - 1 freq plenn - 4 freq polonie - 1 freq plooan - 1 freq pillion - 1 freq pullan - 6 freq pewlin - 1 freq pollen - 3 freq plaine - 1 freq plein - 1 freq pallion - 1 freq pulin - 1 freq pollin - 10 freq €˜plain - 5 freq pùllin - 1 freq plaein - 1 freq poolin - 2 freq pawlin - 1 freq plena - 2 freq puhlin - 1 freq pleen - 1 freq pollença - 1 freq yplan - 1 freq plan' - 1 freq “plain - 1 freq |
YPLAN |
| Time to execute Levenshtein function - 0.240419 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.351851 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.028425 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.037381 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.000911 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. |