| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| returns (0) - 27 freq returnt (1) - 16 freq return (1) - 130 freq retours (2) - 4 freq returned (2) - 47 freq retorts (2) - 2 freq returnit (2) - 6 freq retains (2) - 4 freq seturn (2) - 12 freq seturn's (2) - 1 freq retuirnt (2) - 3 freq retards (2) - 1 freq turns (2) - 354 freq return't (2) - 1 freq returnin (2) - 14 freq retuirn (2) - 1 freq reruns (2) - 1 freq u-turns (2) - 1 freq returnan (2) - 1 freq requires (3) - 8 freq gestures (3) - 21 freq rehung (3) - 1 freq hepburns (3) - 1 freq rituals (3) - 3 freq rer's (3) - 1 freq |
returns (0) - 27 freq return (2) - 130 freq returnt (2) - 16 freq turns (3) - 354 freq retards (3) - 1 freq returnin (3) - 14 freq u-turns (3) - 1 freq returnan (3) - 1 freq retuirnt (3) - 3 freq retuirn (3) - 1 freq reruns (3) - 1 freq retorts (3) - 2 freq retours (3) - 4 freq returnit (3) - 6 freq returned (3) - 47 freq retains (3) - 4 freq tarns (4) - 1 freq rations (4) - 8 freq retourin (4) - 4 freq retinas (4) - 1 freq retouring (4) - 1 freq rattens (4) - 2 freq starns (4) - 82 freq turnus (4) - 1 freq turnis (4) - 6 freq |
SoundEx code - R365 returned - 47 freq returns - 27 freq return - 130 freq roadrunner - 8 freq returnin - 14 freq retuirnt - 3 freq retuirn - 1 freq returnit - 6 freq retrun - 1 freq retrunit - 1 freq retiring - 4 freq retirin - 10 freq returnable - 1 freq returnt - 16 freq reteirment - 1 freq retirement - 14 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 - 27 freq |
RETURNS |
| Time to execute Levenshtein function - 0.294913 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.728638 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.075809 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.092319 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.000808 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. |