Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
returning (0) - 9 freq returnin' (1) - 1 freq returnin (1) - 14 freq turning (2) - 28 freq returnit (2) - 6 freq returnan (2) - 1 freq retouring (2) - 1 freq retiring (2) - 4 freq recurring (2) - 1 freq reckoning (3) - 1 freq referring (3) - 6 freq regarding (3) - 5 freq re-jyning (3) - 1 freq reporting (3) - 2 freq refusing (3) - 5 freq running (3) - 47 freq featuring (3) - 4 freq returns (3) - 27 freq turnin (3) - 316 freq return (3) - 130 freq retainin (3) - 6 freq stunning (3) - 4 freq return't (3) - 1 freq gurning (3) - 2 freq reasoning (3) - 4 freq |
returning (0) - 9 freq returnin (2) - 14 freq returnin' (2) - 1 freq retiring (3) - 4 freq retouring (3) - 1 freq turning (3) - 28 freq returnan (3) - 1 freq retirnan (4) - 1 freq recurring (4) - 1 freq returnit (4) - 6 freq rewarding (5) - 1 freq retourin (5) - 4 freq maturing (5) - 1 freq reworking (5) - 2 freq remaining (5) - 5 freq returnt (5) - 16 freq burning (5) - 12 freq returned (5) - 47 freq retching (5) - 1 freq ruining (5) - 2 freq restoring (5) - 1 freq retreating (5) - 1 freq requiring (5) - 2 freq turnin' (5) - 2 freq mourning (5) - 2 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 - RTRNNK returning - 9 freq |
RETURNING |
Time to execute Levenshtein function - 0.232142 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.363019 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.027665 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.037178 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.000843 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. |