Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
returns (0) - 29 freq return (1) - 132 freq returnt (1) - 16 freq returned (2) - 48 freq turns (2) - 367 freq returnit (2) - 6 freq returnin (2) - 14 freq seturn's (2) - 1 freq retains (2) - 4 freq retuirnt (2) - 3 freq retorts (2) - 2 freq u-turns (2) - 1 freq retards (2) - 1 freq returnan (2) - 1 freq reruns (2) - 1 freq retuirn (2) - 1 freq retours (2) - 4 freq return't (2) - 1 freq seturn (2) - 12 freq regards (3) - 11 freq re-twins (3) - 1 freq rottans (3) - 7 freq eterne (3) - 2 freq retire (3) - 11 freq resins (3) - 1 freq |
returns (0) - 29 freq returnt (2) - 16 freq return (2) - 132 freq u-turns (3) - 1 freq retards (3) - 1 freq retuirn (3) - 1 freq retours (3) - 4 freq retorts (3) - 2 freq reruns (3) - 1 freq returnan (3) - 1 freq returned (3) - 48 freq retuirnt (3) - 3 freq returnit (3) - 6 freq turns (3) - 367 freq returnin (3) - 14 freq retains (3) - 4 freq retirin (4) - 10 freq reuter's (4) - 1 freq rattans (4) - 3 freq retourin (4) - 4 freq ritirs (4) - 1 freq sterns (4) - 26 freq retrun (4) - 1 freq terns (4) - 2 freq tirns (4) - 4 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 - RTRNS returns - 29 freq |
RETURNS |
Time to execute Levenshtein function - 0.187244 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.355230 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.027991 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.037687 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.000889 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. |