| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tolerance (0) - 7 freq tholerance (1) - 1 freq tolerence (1) - 1 freq soverance (2) - 3 freq tolerate (2) - 7 freq tolerant (2) - 1 freq intolerance (2) - 4 freq tolerable (2) - 1 freq owerance (2) - 35 freq torrance (2) - 1 freq homerange (3) - 1 freq souerane (3) - 1 freq relevance (3) - 5 freq forderance (3) - 2 freq governance (3) - 19 freq tholance (3) - 1 freq toleratit (3) - 1 freq coleraine (3) - 4 freq elegance (3) - 2 freq clearance (3) - 16 freq iggerance (3) - 2 freq owerances (3) - 1 freq terence (3) - 1 freq toblerone (3) - 1 freq coherence (3) - 2 freq |
tolerance (0) - 7 freq tolerence (1) - 1 freq tholerance (2) - 1 freq intolerance (3) - 4 freq torrance (3) - 1 freq tolerant (3) - 1 freq clearance (4) - 16 freq trance (4) - 10 freq utterance (4) - 4 freq terence (4) - 1 freq tolerable (4) - 1 freq soverance (4) - 3 freq owerance (4) - 35 freq tolerate (4) - 7 freq apperance (5) - 2 freq tolerated (5) - 5 freq tailrace (5) - 1 freq coherence (5) - 2 freq clairance (5) - 1 freq clarence (5) - 2 freq tylerin (5) - 1 freq trunce (5) - 3 freq temperance (5) - 5 freq florence (5) - 29 freq toleratit (5) - 1 freq |
SoundEx code - T465 tolerant - 1 freq tolerance - 7 freq tailor-made - 1 freq tailoreen - 2 freq tailor-meed - 1 freq tolerence - 1 freq tailor-makkit - 1 freq tholerance - 1 freq tylerin - 1 freq tullyherron - 1 freq tailoring - 1 freq |
MetaPhone code - TLRNS tolerance - 7 freq tolerence - 1 freq |
TOLERANCE |
| Time to execute Levenshtein function - 0.194604 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.339958 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.026849 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.036843 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.000847 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. |