Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ratherryan (0) - 1 freq rathfrilan (3) - 4 freq gatheran (3) - 2 freq gaitheran (4) - 2 freq lutheran (4) - 1 freq raither'n (4) - 1 freq batherin (4) - 5 freq wathery (4) - 1 freq patteran (4) - 3 freq sterran (4) - 1 freq leatherman (4) - 1 freq kerryan (4) - 1 freq carryan (4) - 2 freq fatherly (4) - 1 freq rather (4) - 114 freq fathersday (4) - 2 freq herryin (4) - 2 freq kathryn (4) - 1 freq watherin (4) - 1 freq untherstan (4) - 1 freq gatherin (4) - 9 freq cathedral (4) - 67 freq athenian (4) - 14 freq wathervane (4) - 1 freq ethernan (4) - 5 freq |
ratherryan (0) - 1 freq raither'n (5) - 1 freq gatheran (5) - 2 freq rathfrilan (5) - 4 freq gatherin (6) - 9 freq ethernan (6) - 5 freq watherin (6) - 1 freq kathryn (6) - 1 freq katheryne (6) - 1 freq hurryan (6) - 1 freq gaetheran (6) - 3 freq rutherglen (6) - 3 freq herryin (6) - 2 freq gathern (6) - 1 freq wathervane (6) - 1 freq sterran (6) - 1 freq batherin (6) - 5 freq lutheran (6) - 1 freq gaitheran (6) - 2 freq leatherman (6) - 1 freq rather (6) - 114 freq getherin (7) - 34 freq mitherlaun (7) - 1 freq rathsmen (7) - 1 freq there-in (7) - 1 freq |
SoundEx code - R365 returned - 48 freq returns - 29 freq return - 132 freq roadrunner - 9 freq returnin - 14 freq retuirnt - 3 freq retuirn - 1 freq returnit - 6 freq retrun - 1 freq retrunit - 1 freq retirement - 17 freq retiring - 4 freq retirin - 10 freq returnable - 1 freq returnt - 16 freq reteirment - 1 freq reedrimmed - 1 freq retirement's - 1 freq reed-ringed - 1 freq returning - 9 freq return't - 1 freq rudderin - 1 freq returnin' - 1 freq returnan - 1 freq retourin - 4 freq raither'n - 1 freq retouring - 1 freq rederendum - 1 freq retirnan - 1 freq ratherryan - 1 freq retirementtales - 1 freq retrain - 2 freq |
MetaPhone code - R0RYN ratherryan - 1 freq |
RATHERRYAN |
Time to execute Levenshtein function - 0.207103 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.376489 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.027254 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.037450 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.000900 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. |