Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
retouring (0) - 1 freq retourin (1) - 4 freq returning (2) - 9 freq retiring (2) - 4 freq restoring (2) - 1 freq hectoring (3) - 1 freq recovering (3) - 2 freq restorin (3) - 3 freq returnin (3) - 14 freq labouring (3) - 2 freq resolving (3) - 1 freq returns (3) - 29 freq retching (3) - 1 freq stourin (3) - 6 freq return (3) - 132 freq referring (3) - 7 freq rendering (3) - 1 freq favouring (3) - 1 freq retourt (3) - 1 freq retours (3) - 4 freq pouring (3) - 2 freq louring (3) - 1 freq lecturing (3) - 1 freq touting (3) - 1 freq storing (3) - 2 freq |
retouring (0) - 1 freq retourin (2) - 4 freq retiring (2) - 4 freq returning (3) - 9 freq restoring (3) - 1 freq storing (4) - 2 freq returnt (4) - 16 freq maturing (4) - 1 freq returns (4) - 29 freq return (4) - 132 freq returnin (4) - 14 freq roaring (4) - 5 freq featuring (4) - 4 freq retirin (4) - 10 freq requiring (4) - 2 freq tring (5) - 1 freq tearing (5) - 1 freq entering (5) - 9 freq rating (5) - 1 freq colouring (5) - 2 freq restorin' (5) - 1 freq measuring (5) - 2 freq retour (5) - 32 freq refusing (5) - 5 freq retumin (5) - 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 - RTRNK retiring - 4 freq retouring - 1 freq |
RETOURING |
Time to execute Levenshtein function - 0.308563 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.460175 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.030515 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.043244 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.001003 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. |