| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daith-tree (0) - 1 freq daith-trap (2) - 2 freq aik-tree (3) - 3 freq tail-tree (3) - 1 freq paittren (4) - 1 freq faithered (4) - 3 freq dule-tree (4) - 1 freq fig-tree (4) - 3 freq 'th-three (4) - 1 freq bath-time (4) - 1 freq daithlie (4) - 1 freq gaitheren (4) - 8 freq fir-tree (4) - 3 freq nit-trie (4) - 2 freq lime-tree (4) - 1 freq faut-free (4) - 2 freq daither (4) - 1 freq daith-white (4) - 1 freq gaitheret (4) - 1 freq rantletree (4) - 3 freq daithbed (4) - 3 freq gaitherer (4) - 4 freq duty-free (4) - 1 freq gaithered (4) - 70 freq gaitherie (4) - 2 freq |
daith-tree (0) - 1 freq daith-trap (3) - 2 freq tail-tree (5) - 1 freq 'th-three (6) - 1 freq bath-time (6) - 1 freq daither (6) - 1 freq nit-trie (6) - 2 freq dule-tree (6) - 1 freq duty-free (6) - 1 freq aik-tree (6) - 3 freq twa-tree (7) - 1 freq aiple-tree (7) - 1 freq gaitherie (7) - 2 freq debt-free (7) - 1 freq dichter (7) - 2 freq daughter (7) - 44 freq dauchter (7) - 18 freq gaitherer (7) - 4 freq dithery (7) - 1 freq cash-tray (7) - 1 freq ash-tray (7) - 1 freq daithbed (7) - 3 freq fir-tree (7) - 3 freq dachter (7) - 2 freq dither (7) - 2 freq |
SoundEx code - D336 daith-trap - 2 freq daith-tree - 1 freq do-do-tron-tron - 1 freq |
MetaPhone code - T0TR daith-tree - 1 freq |
DAITH-TREE |
| Time to execute Levenshtein function - 0.245905 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.484580 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.029552 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.038229 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.001022 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. |