| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| returnin (0) - 14 freq returnin' (1) - 1 freq returnit (1) - 6 freq returnan (1) - 1 freq returning (1) - 9 freq retourin (2) - 4 freq retumin (2) - 1 freq returnt (2) - 16 freq turnin (2) - 321 freq recurrin (2) - 2 freq returns (2) - 29 freq return't (2) - 1 freq retrain (2) - 2 freq return (2) - 132 freq retirnan (2) - 1 freq retirin (2) - 10 freq returned (2) - 48 freq retainin (2) - 6 freq turnie (3) - 2 freq reponin (3) - 2 freq reparein (3) - 2 freq reconin (3) - 1 freq turning (3) - 31 freq murnin (3) - 14 freq refarin (3) - 1 freq |
returnin (0) - 14 freq returnan (1) - 1 freq retirnan (2) - 1 freq returning (2) - 9 freq returnin' (2) - 1 freq returnit (2) - 6 freq return (3) - 132 freq returned (3) - 48 freq retainin (3) - 6 freq retirin (3) - 10 freq retrain (3) - 2 freq retourin (3) - 4 freq returns (3) - 29 freq turnin (3) - 321 freq returnt (3) - 16 freq efternin (4) - 12 freq retrun (4) - 1 freq retouring (4) - 1 freq retiring (4) - 4 freq turnan (4) - 20 freq retuirnt (4) - 3 freq turnen (4) - 2 freq rationin (4) - 3 freq retuirn (4) - 1 freq tirnin (4) - 5 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 - RTRNN returnin - 14 freq returnin' - 1 freq returnan - 1 freq retirnan - 1 freq |
RETURNIN |
| Time to execute Levenshtein function - 0.211351 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.483715 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.027464 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.082970 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.000885 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. |