Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
returned (0) - 48 freq retorted (2) - 5 freq return (2) - 132 freq returnit (2) - 6 freq returnt (2) - 16 freq returnan (2) - 1 freq turned (2) - 496 freq returnin (2) - 14 freq returns (2) - 29 freq retired (2) - 42 freq unturned (2) - 3 freq upturned (2) - 7 freq return't (2) - 1 freq retained (2) - 2 freq retoured (2) - 14 freq refereed (3) - 1 freq reduced (3) - 25 freq regarded (3) - 5 freq refused (3) - 41 freq murned (3) - 4 freq seturn (3) - 12 freq rejoined (3) - 1 freq seturn's (3) - 1 freq turne (3) - 1 freq gestured (3) - 13 freq |
returned (0) - 48 freq retired (3) - 42 freq returns (3) - 29 freq upturned (3) - 7 freq retained (3) - 2 freq retoured (3) - 14 freq returnin (3) - 14 freq unturned (3) - 3 freq turned (3) - 496 freq retorted (3) - 5 freq returnit (3) - 6 freq return (3) - 132 freq returnan (3) - 1 freq returnt (3) - 16 freq retirnan (4) - 1 freq tirned (4) - 24 freq rationed (4) - 4 freq reteired (4) - 3 freq rotund (4) - 1 freq retuirnt (4) - 3 freq retuirn (4) - 1 freq retraced (4) - 1 freq retard (4) - 2 freq return't (4) - 1 freq returnin' (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 - RTRNT returned - 48 freq retuirnt - 3 freq returnit - 6 freq retrunit - 1 freq returnt - 16 freq return't - 1 freq |
RETURNED |
Time to execute Levenshtein function - 0.217577 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.368237 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.027768 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.037415 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.000968 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. |