Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
retourin (0) - 4 freq retouring (1) - 1 freq retour (2) - 32 freq retumin (2) - 1 freq retours (2) - 4 freq restorin (2) - 3 freq return (2) - 130 freq retirin (2) - 10 freq devourin (2) - 5 freq retoured (2) - 14 freq resourcin (2) - 5 freq returnin (2) - 14 freq tourin (2) - 5 freq retourt (2) - 1 freq stourin (2) - 6 freq roupin (3) - 4 freq tourit (3) - 2 freq getherin (3) - 34 freq reformin (3) - 3 freq retchin (3) - 2 freq returning (3) - 9 freq touerin (3) - 1 freq stoorin (3) - 2 freq courin (3) - 1 freq retortit (3) - 2 freq |
retourin (0) - 4 freq retouring (2) - 1 freq return (2) - 130 freq retirin (2) - 10 freq tourin (3) - 5 freq retourt (3) - 1 freq retrun (3) - 1 freq retuirn (3) - 1 freq returnin (3) - 14 freq stourin (3) - 6 freq retrain (3) - 2 freq retumin (3) - 1 freq retours (3) - 4 freq retour (3) - 32 freq restorin (3) - 3 freq retoured (3) - 14 freq retiring (4) - 4 freq repairin (4) - 3 freq returnit (4) - 6 freq refarin (4) - 1 freq retainin (4) - 6 freq retirit (4) - 3 freq etterin (4) - 1 freq rearin (4) - 8 freq retort (4) - 3 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 - RTRN return - 130 freq retuirn - 1 freq retrun - 1 freq retirin - 10 freq rudderin - 1 freq retourin - 4 freq retrain - 2 freq |
RETOURIN |
Time to execute Levenshtein function - 0.199286 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.392591 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.029199 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.038471 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.001009 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. |