| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retrunit (0) - 1 freq returnit (2) - 6 freq recruit (2) - 2 freq retrun (2) - 1 freq refusit (3) - 6 freq pretenit (3) - 1 freq return't (3) - 1 freq recruits (3) - 6 freq reducit (3) - 1 freq renownit (3) - 1 freq recount (3) - 3 freq rebukit (3) - 3 freq petunia (3) - 3 freq retortit (3) - 2 freq requit (3) - 1 freq regrait (3) - 1 freq strunt (3) - 5 freq resignit (3) - 1 freq restaurit (3) - 1 freq rewynit (3) - 1 freq learnit (3) - 12 freq reckonit (3) - 2 freq retourin (3) - 4 freq reruns (3) - 1 freq straunit (3) - 1 freq |
retrunit (0) - 1 freq returnit (2) - 6 freq returnt (3) - 16 freq retrun (3) - 1 freq retuirnt (4) - 3 freq retrain (4) - 2 freq retreat (4) - 25 freq straunit (4) - 1 freq retourt (4) - 1 freq retirit (4) - 3 freq reprent (4) - 2 freq returnin (4) - 14 freq strunt (4) - 5 freq retreatit (4) - 7 freq retourin (4) - 4 freq return't (4) - 1 freq recruit (4) - 2 freq retortit (4) - 2 freq truant (5) - 2 freq reverant (5) - 3 freq upturnit (5) - 1 freq errant (5) - 2 freq retiring (5) - 4 freq refraint (5) - 1 freq retuirn (5) - 1 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 |
RETRUNIT |
| Time to execute Levenshtein function - 0.218883 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.418126 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.028415 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.037320 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.000777 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. |