| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tree-lined (0) - 2 freq treelined (1) - 1 freq new-lined (3) - 1 freq re-lived (3) - 1 freq treetlin (3) - 5 freq reeined (3) - 1 freq three-leiged (3) - 2 freq true-life (3) - 1 freq treetled (3) - 5 freq stane-lined (3) - 1 freq bee-line (3) - 3 freq treeple (4) - 1 freq refined (4) - 8 freq tremmled (4) - 3 freq remained (4) - 17 freq free-online (4) - 18 freq greined (4) - 2 freq preened (4) - 14 freq tremlin (4) - 2 freq dreebled (4) - 2 freq treeded (4) - 1 freq ee-lid (4) - 2 freq three-times (4) - 8 freq trembling (4) - 4 freq refrained (4) - 1 freq |
tree-lined (0) - 2 freq treelined (2) - 1 freq treetled (5) - 5 freq fur-lined (5) - 2 freq three-leiged (5) - 2 freq stane-lined (5) - 1 freq true-life (5) - 1 freq new-lined (5) - 1 freq re-lived (5) - 1 freq treetlin (5) - 5 freq trevelin (6) - 4 freq traetened (6) - 1 freq trevelled (6) - 6 freq trevlin (6) - 1 freq trewlins (6) - 3 freq treend (6) - 1 freq truelins (6) - 4 freq tramlines (6) - 5 freq trainline (6) - 3 freq trained (6) - 27 freq tory-awned (6) - 1 freq greenland (6) - 16 freq tremlin (6) - 2 freq reeined (6) - 1 freq bee-line (6) - 3 freq |
SoundEx code - T645 trailin - 27 freq trilingual - 8 freq truelins - 4 freq thirlin-tae - 1 freq trailing - 6 freq tirlin - 13 freq twirlin' - 1 freq trailen - 1 freq tirlan - 5 freq traalin - 1 freq thairlane - 4 freq treelined - 1 freq thirlins - 4 freq thirlin - 7 freq trewlins - 3 freq twirlin - 5 freq trellan - 2 freq trawlin - 12 freq tri-lingual - 1 freq trillin - 1 freq tree-lined - 2 freq tarland - 4 freq tarlan - 4 freq trillions - 1 freq trilingualism - 1 freq trillion - 1 freq twirling - 1 freq trailin' - 1 freq trolling - 3 freq trollin - 1 freq thrilling - 1 freq therealmac - 1 freq |
MetaPhone code - TRLNT draalin-da - 1 freq treelined - 1 freq tree-lined - 2 freq tarland - 4 freq |
TREE-LINED |
| Time to execute Levenshtein function - 0.239317 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.375281 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.028575 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.038423 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.000920 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. |