| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tail-tree (0) - 1 freq aik-tree (2) - 3 freq tail-eyne (3) - 1 freq twa-tree (3) - 1 freq fig-tree (3) - 3 freq aiple-tree (3) - 1 freq tailoreen (3) - 2 freq tailored (3) - 3 freq hail-time (3) - 1 freq fir-tree (3) - 3 freq tail-en (3) - 2 freq daith-tree (3) - 1 freq tailrace (4) - 1 freq tailed (4) - 7 freq alc-free (4) - 1 freq nit-trie (4) - 2 freq time-free (4) - 1 freq roof-tree (4) - 1 freq tell-tale (4) - 2 freq tailor (4) - 28 freq tiltet (4) - 1 freq hailthie (4) - 1 freq twartree (4) - 111 freq twittee (4) - 1 freq failures (4) - 6 freq |
tail-tree (0) - 1 freq aiple-tree (4) - 1 freq twa-tree (4) - 1 freq aik-tree (4) - 3 freq tail-en (5) - 2 freq daith-tree (5) - 1 freq tay-tray (5) - 1 freq dule-tree (5) - 1 freq fir-tree (5) - 3 freq hail-time (5) - 1 freq tail-eyne (5) - 1 freq fig-tree (5) - 3 freq twaa-three (6) - 1 freq twa-three (6) - 130 freq ballatrie (6) - 1 freq lime-tree (6) - 1 freq tae-time (6) - 1 freq rose-tree (6) - 18 freq toiletries (6) - 1 freq tae-tae (6) - 2 freq tilted (6) - 5 freq tailfer (6) - 1 freq tel-tail (6) - 1 freq aipple-tree (6) - 1 freq tiltered (6) - 1 freq |
SoundEx code - T436 toilet-roll - 1 freq tiltered - 1 freq tillydrone - 2 freq tail-tree - 1 freq tildarg - 1 freq toiletries - 1 freq theliteracytree - 1 freq toolter - 1 freq |
MetaPhone code - TLTR dule-tree - 1 freq dolder - 1 freq tail-tree - 1 freq dilatory - 1 freq toolter - 1 freq |
TAIL-TREE |
| Time to execute Levenshtein function - 0.238077 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.593248 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.065463 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.040342 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.000889 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. |