| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tippertaed (0) - 1 freq tippertaes (1) - 1 freq tippie-taed (2) - 1 freq tippy-taed (2) - 3 freq tippered (2) - 1 freq tippexed (3) - 1 freq tip-taed (3) - 2 freq tiptaed (3) - 3 freq pippered (3) - 1 freq lippered (3) - 2 freq tippytae (3) - 1 freq tippytaes (3) - 1 freq tip-exed (4) - 1 freq slippered (4) - 2 freq timberland (4) - 2 freq supported (4) - 11 freq imported (4) - 4 freq diverted (4) - 1 freq inverted (4) - 2 freq tipper (4) - 14 freq tiptoed (4) - 2 freq tempered (4) - 3 freq timmered (4) - 1 freq stoppered (4) - 1 freq dispersed (4) - 4 freq |
tippertaed (0) - 1 freq tippertaes (2) - 1 freq tippered (3) - 1 freq tippy-taed (3) - 3 freq tippie-taed (3) - 1 freq tippytae (5) - 1 freq supported (5) - 11 freq lippered (5) - 2 freq tippytaes (5) - 1 freq pippered (5) - 1 freq tip-taed (5) - 2 freq tippexed (5) - 1 freq tiptaed (5) - 3 freq propertied (6) - 1 freq lippert (6) - 1 freq tipped (6) - 14 freq tapered (6) - 2 freq tippy-toes (6) - 1 freq tip-toed (6) - 1 freq peppered (6) - 1 freq tippermuir (6) - 1 freq tippets (6) - 1 freq rappered (6) - 1 freq tipperin (6) - 2 freq tipper (6) - 14 freq |
SoundEx code - T163 tea-pairty - 4 freq tea-perty - 1 freq tea-party - 3 freq tippertaed - 1 freq tapert - 2 freq typewriter - 5 freq tay-pairty - 1 freq taypairty - 1 freq tayport - 2 freq tae-pairty - 2 freq tobered - 1 freq tapered - 2 freq taivert - 2 freq taiver't - 1 freq taivert-lke - 1 freq tap-root - 1 freq twa-pairt - 1 freq tippertaes - 1 freq tippered - 1 freq tuiberdrola - 1 freq thebridge - 1 freq theforthbridges - 4 freq tbrwood - 1 freq |
MetaPhone code - TPRTT depairtit - 14 freq tippertaed - 1 freq departit - 5 freq depairted - 3 freq departed - 10 freq deportit - 1 freq deep-rootit - 1 freq |
TIPPERTAED |
| Time to execute Levenshtein function - 0.203823 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.357436 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.028048 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.037845 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.000872 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. |