Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
teamleon (0) - 1 freq tealou (3) - 3 freq tellen (3) - 3 freq trailen (3) - 1 freq teaspoon (3) - 6 freq tailen (3) - 1 freq teamed (3) - 1 freq teflon (3) - 2 freq teaspeen (3) - 1 freq teemen (3) - 2 freq seamless (3) - 5 freq teamie (3) - 1 freq tamason (3) - 2 freq gameon (3) - 1 freq sea-lion (3) - 1 freq teacheen (3) - 1 freq tampson (3) - 1 freq tamson (3) - 32 freq telleen (3) - 1 freq teason (3) - 2 freq templeton (3) - 2 freq seamen (3) - 5 freq thamson (3) - 1 freq tea-leaf (3) - 1 freq slammen (4) - 1 freq |
teamleon (0) - 1 freq telleen (4) - 1 freq teemen (4) - 2 freq tamason (4) - 2 freq teflon (4) - 2 freq tamson (4) - 32 freq tumlin (4) - 1 freq trailen (4) - 1 freq tellen (4) - 3 freq tailen (4) - 1 freq teamni (5) - 1 freq tempin (5) - 4 freq tremlin (5) - 2 freq traalin (5) - 1 freq tmlewin (5) - 1 freq tummlin (5) - 25 freq toulon (5) - 1 freq tellin (5) - 603 freq timeen (5) - 1 freq teuman (5) - 1 freq teeman (5) - 2 freq tailin (5) - 1 freq teimin (5) - 1 freq tampan (5) - 1 freq tarlan (5) - 4 freq |
SoundEx code - T545 tummlin - 25 freq toonlan - 2 freq toonland - 1 freq toonlan' - 1 freq toonlanns - 1 freq timeline - 14 freq tummlan - 1 freq tim'line - 1 freq tomlinson - 1 freq tummelin - 1 freq tumlin - 1 freq tinlin - 1 freq tmlewin - 1 freq teamleon - 1 freq tomlang - 3 freq tomholland - 1 freq |
MetaPhone code - TMLN tumblin - 4 freq tummlin - 25 freq timeline - 14 freq tummlan - 1 freq tim'line - 1 freq tummelin - 1 freq tumblan - 2 freq tumlin - 1 freq teamleon - 1 freq |
TEAMLEON |
Time to execute Levenshtein function - 0.202647 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.388684 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.027302 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.037240 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.000841 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. |