| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tolerence (0) - 1 freq tolerance (1) - 7 freq coherence (2) - 2 freq tholerance (2) - 1 freq terence (2) - 1 freq soverance (3) - 3 freq toblerone (3) - 1 freq reuerence (3) - 1 freq conference (3) - 46 freq reference (3) - 52 freq jflorence (3) - 1 freq torrance (3) - 1 freq tolerate (3) - 7 freq florence (3) - 29 freq deference (3) - 4 freq tolerant (3) - 1 freq adherence (3) - 3 freq confrence (3) - 1 freq clarence (3) - 2 freq intolerance (3) - 4 freq inference (3) - 2 freq owerance (3) - 35 freq raference (3) - 1 freq reverence (3) - 10 freq tolerable (3) - 1 freq |
tolerence (0) - 1 freq tolerance (1) - 7 freq tholerance (3) - 1 freq terence (3) - 1 freq torrance (4) - 1 freq tolerant (4) - 1 freq clarence (4) - 2 freq coherence (4) - 2 freq intolerance (4) - 4 freq florence (4) - 29 freq reverence (5) - 10 freq raference (5) - 1 freq owerance (5) - 35 freq laurence (5) - 10 freq clearance (5) - 16 freq tylerin (5) - 1 freq utterance (5) - 4 freq trance (5) - 10 freq inference (5) - 2 freq tolerable (5) - 1 freq trunce (5) - 3 freq toblerone (5) - 1 freq soverance (5) - 3 freq reference (5) - 52 freq jflorence (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 |
TOLERENCE |
| Time to execute Levenshtein function - 0.269200 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.529225 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.027691 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.043859 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. |