Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tryan (0) - 32 freq tryen (1) - 21 freq dryan (1) - 2 freq bryan (1) - 17 freq tryan- (1) - 1 freq cryan (1) - 1 freq tyan (1) - 2 freq traan (1) - 1 freq ryan (1) - 29 freq tryin (1) - 688 freq bryanb (2) - 1 freq tyran (2) - 1 freq praan (2) - 4 freq tray (2) - 48 freq takan (2) - 10 freq trax (2) - 10 freq trojan (2) - 5 freq layan (2) - 1 freq tman (2) - 1 freq tean (2) - 1 freq trial (2) - 82 freq troon (2) - 5 freq fran (2) - 1 freq tarzan (2) - 4 freq buyan (2) - 3 freq |
tryan (0) - 32 freq traan (1) - 1 freq tryin (1) - 688 freq tryen (1) - 21 freq tyrian (2) - 1 freq triyin (2) - 2 freq tryne (2) - 5 freq trein (2) - 1 freq treen (2) - 4 freq train (2) - 146 freq tyran (2) - 1 freq troon (2) - 5 freq cryan (2) - 1 freq tryan- (2) - 1 freq tyan (2) - 2 freq dryan (2) - 2 freq tron (2) - 11 freq ryan (2) - 29 freq bryan (2) - 17 freq erran (3) - 3 freq titan (3) - 5 freq trap (3) - 60 freq tryve (3) - 1 freq tread (3) - 13 freq tryed (3) - 3 freq |
SoundEx code - T650 tryin - 688 freq term - 98 freq turn - 793 freq thrawin - 17 freq thorn - 9 freq tirrin - 3 freq trym - 1 freq tearin - 10 freq train - 146 freq throwin - 31 freq tryin- - 3 freq thrown - 43 freq tureen - 4 freq throne - 45 freq tirryin - 1 freq torn - 50 freq trenn - 1 freq thrawn - 108 freq tearoom - 3 freq terrain - 10 freq tyranny - 9 freq thraan - 12 freq taurn - 1 freq tirn - 35 freq trim - 15 freq trauma - 8 freq trooin - 1 freq tram - 16 freq teerin - 5 freq tirin - 4 freq tryin'ae - 1 freq teirin - 6 freq tourin - 5 freq tierin - 2 freq thrym - 10 freq treen - 4 freq troon - 5 freq thrum - 12 freq trewin - 1 freq tryen - 21 freq throwen - 1 freq tryin' - 8 freq thoarn - 11 freq tramway - 1 freq tron - 11 freq thereon - 1 freq throen - 1 freq towerin - 12 freq thran - 22 freq turn' - 1 freq trauma' - 1 freq trehin - 7 freq thorny - 2 freq tryan - 32 freq thern-wi - 1 freq turne - 1 freq thorn' - 1 freq 'turn - 1 freq thraain - 1 freq thron - 1 freq tooerin - 1 freq tirn-wye - 1 freq trönnie - 1 freq tronn - 1 freq throwan - 4 freq tyrone - 6 freq tea-room - 4 freq trein - 1 freq thern - 1 freq toarn - 1 freq theorem - 1 freq trainee - 3 freq thairm - 3 freq tournie - 1 freq train' - 1 freq triyin - 2 freq tryan- - 1 freq trannie - 5 freq thrummie - 1 freq thairin - 1 freq tairm - 13 freq tyran - 1 freq traan - 1 freq turnie - 2 freq throw-han - 2 freq tarin - 1 freq thrain - 1 freq tryne - 5 freq thare-in - 1 freq tharein - 1 freq touerin - 1 freq €œtrum - 1 freq trine - 2 freq thairn - 1 freq there-in - 1 freq tern - 1 freq €˜train - 1 freq tyrian - 1 freq threne - 1 freq three-han - 1 freq therein - 3 freq trainie - 3 freq tarim - 1 freq €œtryin - 1 freq tranny - 2 freq tirannie - 1 freq trone - 6 freq traiän - 2 freq terryann - 3 freq tryÂ’n - 1 freq tierney - 1 freq tarrin - 1 freq 'thrawn - 2 freq ‘thrawn - 1 freq 'thrawn' - 1 freq 'thran' - 1 freq |
MetaPhone code - TRYN tryin - 688 freq tryin- - 3 freq tirryin - 1 freq dryin - 37 freq tryin'ae - 1 freq tryen - 21 freq dryen - 1 freq tryin' - 8 freq tryan - 32 freq dryan - 2 freq triyin - 2 freq tryan- - 1 freq dairyin - 1 freq €œtryin - 1 freq terryann - 3 freq driyin - 1 freq |
TRYAN |
Time to execute Levenshtein function - 0.254734 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.349613 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.027333 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.036723 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.000849 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. |