| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tailfer (0) - 1 freq trailer (2) - 13 freq tilfers (2) - 1 freq taither (2) - 1 freq taaller (2) - 1 freq tiller (2) - 12 freq taicher (2) - 3 freq tailor (2) - 28 freq tailen (2) - 1 freq taaler (2) - 3 freq saifer (2) - 3 freq taller (2) - 24 freq taiver (2) - 2 freq tail-en (2) - 2 freq tailed (2) - 7 freq tailie (2) - 7 freq dailer (2) - 1 freq telfer (2) - 2 freq talker (2) - 3 freq liefer (3) - 5 freq traivler (3) - 2 freq tazper (3) - 1 freq aalter (3) - 1 freq aiger (3) - 2 freq bailey (3) - 6 freq |
tailfer (0) - 1 freq telfer (2) - 2 freq taaler (3) - 3 freq taller (3) - 24 freq tailor (3) - 28 freq talker (3) - 3 freq taaller (3) - 1 freq tilfers (3) - 1 freq tiller (3) - 12 freq taicher (4) - 3 freq golfer (4) - 1 freq liefer (4) - 5 freq teller (4) - 2 freq toolter (4) - 1 freq taylor (4) - 17 freq trailer (4) - 13 freq tailen (4) - 1 freq dailer (4) - 1 freq taiver (4) - 2 freq taither (4) - 1 freq saifer (4) - 3 freq tail-en (4) - 2 freq tailed (4) - 7 freq tyler (4) - 15 freq tailie (4) - 7 freq |
SoundEx code - T416 tulip-roots - 4 freq twelve-year-old - 1 freq tulip-ruits - 1 freq twelve-year-aulds - 1 freq tulip-röts - 1 freq tullyford - 1 freq twelvr - 1 freq tilfers - 1 freq toolbar - 1 freq teleport - 1 freq telfer - 2 freq twalbore - 1 freq tailfer - 1 freq |
MetaPhone code - TLFR deliver - 47 freq deleever - 3 freq delivery - 49 freq deleeverie - 1 freq deleiver - 4 freq deleiverie - 1 freq telfer - 2 freq tailfer - 1 freq |
TAILFER |
| Time to execute Levenshtein function - 0.219919 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.388261 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.031571 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.037645 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.000891 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. |