| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| returnit (0) - 6 freq return't (1) - 1 freq returnt (1) - 16 freq returnin (1) - 14 freq upturnit (2) - 1 freq retirit (2) - 3 freq returns (2) - 29 freq returnin' (2) - 1 freq return (2) - 132 freq retortit (2) - 2 freq returnan (2) - 1 freq retrunit (2) - 1 freq turnit (2) - 27 freq returning (2) - 9 freq retuirnt (2) - 3 freq returned (2) - 48 freq seturn (3) - 12 freq referrit (3) - 11 freq resultit (3) - 5 freq regrait (3) - 1 freq detroit (3) - 21 freq learnit (3) - 12 freq recruit (3) - 2 freq eternity (3) - 18 freq petunia (3) - 3 freq |
returnit (0) - 6 freq returnt (1) - 16 freq retuirnt (2) - 3 freq retrunit (2) - 1 freq returnin (2) - 14 freq return't (2) - 1 freq returned (3) - 48 freq returnan (3) - 1 freq turnit (3) - 27 freq retortit (3) - 2 freq upturnit (3) - 1 freq returns (3) - 29 freq retirit (3) - 3 freq return (3) - 132 freq retourin (4) - 4 freq retirnan (4) - 1 freq retort (4) - 3 freq upturnt (4) - 8 freq sternit (4) - 1 freq retirin (4) - 10 freq retrain (4) - 2 freq retirt (4) - 1 freq retourt (4) - 1 freq retiret (4) - 1 freq retir't (4) - 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 - RTRNT returned - 48 freq retuirnt - 3 freq returnit - 6 freq retrunit - 1 freq returnt - 16 freq return't - 1 freq |
RETURNIT |
| Time to execute Levenshtein function - 0.203662 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.380683 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.028082 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.050547 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.004490 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. |