| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tailoring (0) - 1 freq tailors (3) - 7 freq failyeing (3) - 1 freq failing (3) - 2 freq mailing (3) - 3 freq galloping (3) - 1 freq tiring (3) - 1 freq sailing (3) - 6 freq tailin (3) - 1 freq tampering (3) - 1 freq airing (3) - 1 freq talking (3) - 56 freq railing (3) - 6 freq tailspin (3) - 1 freq trailing (3) - 6 freq tailor (3) - 28 freq nailing (3) - 3 freq tailor's (3) - 1 freq allowing (3) - 6 freq tailoreen (3) - 2 freq tilling (3) - 1 freq wailing (3) - 1 freq tailored (3) - 3 freq exploring (3) - 5 freq toiling (3) - 2 freq |
tailoring (0) - 1 freq tiring (4) - 1 freq tailoreen (4) - 2 freq talking (4) - 56 freq toiling (4) - 2 freq tilling (4) - 1 freq thring (5) - 2 freq wailing (5) - 1 freq pairing (5) - 2 freq tailored (5) - 3 freq exploring (5) - 5 freq colouring (5) - 2 freq tylerin (5) - 1 freq tearing (5) - 1 freq tring (5) - 1 freq blaring (5) - 2 freq louring (5) - 1 freq towering (5) - 2 freq telling (5) - 79 freq adoring (5) - 1 freq failing (5) - 2 freq sailing (5) - 6 freq airing (5) - 1 freq tampering (5) - 1 freq allowing (5) - 6 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 - TLRNK tailoring - 1 freq |
TAILORING |
| Time to execute Levenshtein function - 0.228973 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.390247 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.029155 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.038301 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.000941 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. |