| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tsipras (0) - 1 freq tips (3) - 26 freq tiptaes (3) - 3 freq thirs (3) - 41 freq osiers (3) - 1 freq trivias (3) - 1 freq shipraw (3) - 1 freq tairms (3) - 11 freq thirls (3) - 5 freq tras (3) - 1 freq tairts (3) - 5 freq trip's (3) - 3 freq tripes (3) - 1 freq tirls (3) - 4 freq shirras (3) - 1 freq thir's (3) - 121 freq tirvs (3) - 1 freq triplar (3) - 1 freq tirgs (3) - 1 freq siura (3) - 1 freq sorras (3) - 6 freq tippa (3) - 4 freq sirs (3) - 6 freq turas (3) - 1 freq teips (3) - 1 freq |
tsipras (0) - 1 freq sips (5) - 4 freq triers (5) - 2 freq spray (5) - 42 freq spyros (5) - 1 freq teirs (5) - 3 freq sprags (5) - 1 freq truipers (5) - 1 freq tires (5) - 2 freq tipps (5) - 1 freq osiris (5) - 1 freq tiers (5) - 5 freq ospreys (5) - 1 freq spears (5) - 28 freq spiers (5) - 15 freq spaars (5) - 1 freq tossers (5) - 7 freq spars (5) - 6 freq spires (5) - 2 freq tempers (5) - 2 freq sprees (5) - 2 freq spurs (5) - 17 freq topers (5) - 1 freq spares (5) - 1 freq sprose (5) - 2 freq |
SoundEx code - T216 tazper - 1 freq taxpeyer - 1 freq takeover - 2 freq tax-payers - 1 freq taxpayer - 1 freq tsipras - 1 freq task-forces - 1 freq task-force - 1 freq tgifridaysuk - 1 freq tasvrb - 1 freq tisfortracy - 1 freq tqjprmtqnx - 1 freq twgbr - 1 freq taegevver - 1 freq ticiaverveer - 1 freq tixqkbrmc - 1 freq taxiforshanksy - 1 freq |
MetaPhone code - TSPRS disappears - 19 freq disperse - 3 freq dispraise - 3 freq diasporas - 1 freq €˜disperse - 1 freq tsipras - 1 freq |
TSIPRAS |
| Time to execute Levenshtein function - 0.217890 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.394269 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.029943 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.038966 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.000919 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. |