| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retirnan (0) - 1 freq returnan (1) - 1 freq retinas (2) - 1 freq retirin (2) - 10 freq returnin (2) - 14 freq retinal (2) - 1 freq retiral (2) - 5 freq eternal (3) - 29 freq rainan (3) - 1 freq resignin (3) - 2 freq retuirnt (3) - 3 freq beginnan (3) - 11 freq rational (3) - 27 freq tirlan (3) - 5 freq ethernan (3) - 5 freq retuirn (3) - 1 freq remarkan (3) - 3 freq regional (3) - 106 freq returned (3) - 48 freq reversan (3) - 1 freq veteran (3) - 4 freq retreat (3) - 26 freq retrain (3) - 2 freq returnit (3) - 6 freq rewirin (3) - 1 freq |
retirnan (0) - 1 freq returnan (1) - 1 freq returnin (2) - 14 freq retirin (3) - 10 freq return (4) - 132 freq retrun (4) - 1 freq returnin' (4) - 1 freq returnit (4) - 6 freq retiring (4) - 4 freq retrain (4) - 2 freq retainin (4) - 6 freq returns (4) - 29 freq returning (4) - 9 freq rationin (4) - 3 freq returned (4) - 48 freq tirnin (4) - 5 freq turnan (4) - 20 freq returnt (4) - 16 freq retiral (4) - 5 freq retuirn (4) - 1 freq retuirnt (4) - 3 freq retinal (4) - 1 freq retinas (4) - 1 freq yernan (5) - 1 freq trainan (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 - RTRNN returnin - 14 freq returnin' - 1 freq returnan - 1 freq retirnan - 1 freq |
RETIRNAN |
| Time to execute Levenshtein function - 0.228137 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.395328 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.031189 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.046486 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.000909 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. |