| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tynron (0) - 1 freq byron (2) - 9 freq tron (2) - 11 freq wynton (2) - 1 freq tyrone (2) - 6 freq tyran (2) - 1 freq thron (2) - 1 freq tynron's (2) - 1 freq tyoon (2) - 1 freq tenon (2) - 1 freq tynin (2) - 20 freq lyndon (2) - 7 freq cannon (3) - 13 freq twynin (3) - 6 freq typin (3) - 14 freq anon (3) - 6 freq munro (3) - 46 freq iron (3) - 103 freq onion (3) - 14 freq lundon (3) - 2 freq tmorn (3) - 1 freq lynin (3) - 1 freq ryngin (3) - 1 freq tetror (3) - 1 freq apron (3) - 24 freq |
tynron (0) - 1 freq tenon (3) - 1 freq tynin (3) - 20 freq thron (3) - 1 freq tyran (3) - 1 freq tron (3) - 11 freq tyrone (3) - 6 freq tinlin (4) - 1 freq troon (4) - 5 freq teerin (4) - 5 freq tension (4) - 32 freq thorn (4) - 9 freq tearin (4) - 10 freq jynerin (4) - 5 freq torn (4) - 50 freq tinkin (4) - 57 freq trone (4) - 6 freq teirin (4) - 6 freq tinnin (4) - 1 freq tirn (4) - 35 freq tinman (4) - 1 freq turn (4) - 793 freq thern (4) - 1 freq toarn (4) - 1 freq tinkan (4) - 1 freq |
SoundEx code - T565 the-morn - 2 freq tmorn - 1 freq themorn - 1 freq tynron's - 1 freq timmerin - 4 freq thunnerin - 1 freq tynron - 1 freq time-worn - 1 freq taniawren - 1 freq |
MetaPhone code - TNRN daunerin - 30 freq dannerin - 4 freq dunnerin - 8 freq daunnerin - 2 freq dennerin - 2 freq daanerin - 1 freq tynron - 1 freq taniawren - 1 freq |
TYNRON |
| Time to execute Levenshtein function - 0.256125 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.378203 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.028399 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.037678 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.000816 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. |