| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tippermuir (0) - 1 freq tipperin (3) - 2 freq uppermair (3) - 4 freq ivermair (4) - 3 freq tipper (4) - 14 freq tippertaes (4) - 1 freq allermuir (4) - 1 freq pipperin (4) - 3 freq lammermuir (4) - 4 freq lipperous (4) - 1 freq nivermair (4) - 1 freq tippered (4) - 1 freq kipperin (4) - 1 freq lipperin (4) - 8 freq tippertaed (4) - 1 freq dispersit (5) - 1 freq tripper (5) - 1 freq uppermost (5) - 6 freq tippie (5) - 3 freq tierin (5) - 2 freq permis (5) - 1 freq pepperoni (5) - 3 freq tippin (5) - 4 freq tapper (5) - 1 freq swippertlie (5) - 12 freq |
tippermuir (0) - 1 freq uppermair (4) - 4 freq tipperin (5) - 2 freq tippered (6) - 1 freq tippertaed (6) - 1 freq tipper (6) - 14 freq tippertaes (6) - 1 freq temperatur (7) - 1 freq tippm (7) - 1 freq pepperami (7) - 1 freq tapper (7) - 1 freq tapperon (7) - 1 freq topper's (7) - 2 freq topper (7) - 12 freq lipperin (7) - 8 freq pipperin (7) - 3 freq allermuir (7) - 1 freq ivermair (7) - 3 freq lammermuir (7) - 4 freq lipperous (7) - 1 freq nivermair (7) - 1 freq kipperin (7) - 1 freq permit (8) - 7 freq pipper (8) - 2 freq temperit (8) - 1 freq |
SoundEx code - T165 touberin - 1 freq tavern - 16 freq tavern's - 1 freq taivern - 14 freq twa-fur-wan - 1 freq taverns - 9 freq tabernacle - 3 freq tapewirm - 1 freq tipperin - 2 freq twa-pronged - 1 freq tap-brainch - 1 freq taperin - 1 freq tobarandualchais - 1 freq taeburns - 1 freq tippermuir - 1 freq theferryinn - 1 freq tavernier - 1 freq tapperon - 1 freq tippermuirbooks - 62 freq thefearmerchant - 1 freq thebrainofspock - 1 freq theformerd - 1 freq tfrm - 1 freq |
MetaPhone code - TPRMR tippermuir - 1 freq |
TIPPERMUIR |
| Time to execute Levenshtein function - 0.207176 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.356223 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.029687 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.049688 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.001157 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. |