| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tolerate (0) - 7 freq tolerated (1) - 5 freq €˜tolerate (2) - 1 freq toleratit (2) - 1 freq moderate (2) - 5 freq tolerant (2) - 1 freq tolerance (2) - 7 freq operate (2) - 12 freq tolerable (2) - 1 freq sperate (3) - 1 freq souerte (3) - 2 freq overgate (3) - 3 freq eelebrate (3) - 1 freq tholerance (3) - 1 freq delegate (3) - 3 freq toblerone (3) - 1 freq olate (3) - 1 freq colgate (3) - 2 freq coverage (3) - 15 freq temerat (3) - 1 freq coleraine (3) - 4 freq toate (3) - 1 freq generate (3) - 4 freq cooperate (3) - 2 freq owerlate (3) - 1 freq |
tolerate (0) - 7 freq tolerated (2) - 5 freq tolerant (3) - 1 freq toleratit (3) - 1 freq toleration (4) - 2 freq trate (4) - 2 freq temerat (4) - 1 freq towert (4) - 1 freq tolerable (4) - 1 freq moderate (4) - 5 freq €˜tolerate (4) - 1 freq tolerance (4) - 7 freq operate (4) - 12 freq loert (5) - 2 freq clert (5) - 1 freq tolt (5) - 138 freq yollert (5) - 2 freq towart (5) - 54 freq stalemate (5) - 2 freq tyle't (5) - 1 freq elevate (5) - 2 freq seperate (5) - 2 freq berate (5) - 1 freq tylers (5) - 1 freq tylerin (5) - 1 freq |
SoundEx code - T463 tolerated - 5 freq tolerate - 7 freq tailored - 3 freq toleration - 2 freq toleratit - 1 freq €˜tolerate - 1 freq taylordauthor - 2 freq ‘tolerateÂ’ - 1 freq tullyard - 2 freq |
MetaPhone code - TLRT deleerit - 8 freq dalriada - 8 freq tolerate - 7 freq tailored - 3 freq deleirit - 1 freq €˜tolerate - 1 freq ‘tolerateÂ’ - 1 freq dalyrd - 1 freq |
TOLERATE |
| Time to execute Levenshtein function - 0.775550 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 - 1.501901 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.092940 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.103094 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.000917 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. |