| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tarland (0) - 4 freq garland (1) - 5 freq farland (1) - 1 freq tarlan (1) - 4 freq lapland (2) - 3 freq tirrand (2) - 3 freq thailand (2) - 7 freq warrand (2) - 5 freq tirlan (2) - 5 freq lawland (2) - 20 freq tartan (2) - 92 freq armand (2) - 1 freq maryland (2) - 2 freq tarlair (2) - 7 freq tailend (2) - 1 freq lamland (2) - 1 freq tarzan (2) - 4 freq irland (2) - 6 freq tartans (2) - 4 freq gairland (2) - 1 freq tland (2) - 3 freq airland (2) - 2 freq garlands (2) - 2 freq taand (2) - 1 freq norland (2) - 9 freq |
tarland (0) - 4 freq garland (2) - 5 freq tarlan (2) - 4 freq farland (2) - 1 freq irland (3) - 6 freq tailend (3) - 1 freq gairland (3) - 1 freq airland (3) - 2 freq maryland (3) - 2 freq tland (3) - 3 freq norland (3) - 9 freq tirlan (3) - 5 freq thailand (3) - 7 freq tirrand (3) - 3 freq treend (4) - 1 freq muirland (4) - 6 freq roland (4) - 2 freq erlend (4) - 4 freq ootland (4) - 5 freq toonland (4) - 1 freq taloned (4) - 1 freq orlando (4) - 1 freq outland (4) - 2 freq lapland (4) - 3 freq faireland (4) - 1 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 |
TARLAND |
| Time to execute Levenshtein function - 0.196166 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.387214 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.027736 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.068153 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.000827 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. |