| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| returned (0) - 47 freq returnin (2) - 14 freq retained (2) - 2 freq unturned (2) - 3 freq retoured (2) - 14 freq returnit (2) - 6 freq returns (2) - 27 freq returnan (2) - 1 freq returnt (2) - 16 freq retorted (2) - 5 freq retired (2) - 40 freq turned (2) - 491 freq upturned (2) - 7 freq return (2) - 130 freq return't (2) - 1 freq purned (3) - 1 freq rebutted (3) - 1 freq reisgned (3) - 1 freq detained (3) - 1 freq secured (3) - 4 freq rotund (3) - 1 freq retiret (3) - 1 freq reformed (3) - 5 freq renowned (3) - 4 freq reined (3) - 2 freq |
returned (0) - 47 freq returnt (3) - 16 freq retired (3) - 40 freq turned (3) - 491 freq return (3) - 130 freq upturned (3) - 7 freq returnan (3) - 1 freq retorted (3) - 5 freq retained (3) - 2 freq returns (3) - 27 freq unturned (3) - 3 freq returnin (3) - 14 freq retoured (3) - 14 freq returnit (3) - 6 freq retuirn (4) - 1 freq retuirnt (4) - 3 freq retirnan (4) - 1 freq tirned (4) - 24 freq rationed (4) - 4 freq retraced (4) - 1 freq reteired (4) - 3 freq retard (4) - 2 freq rotund (4) - 1 freq return't (4) - 1 freq turner (5) - 8 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 - RTRNT returned - 47 freq retuirnt - 3 freq returnit - 6 freq retrunit - 1 freq returnt - 16 freq return't - 1 freq |
RETURNED |
| Time to execute Levenshtein function - 0.185641 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.377857 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.028120 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.039568 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.000981 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. |