| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retainin (0) - 6 freq remainin (1) - 13 freq refinin (2) - 2 freq remainit (2) - 1 freq retain (2) - 8 freq stainin (2) - 1 freq repairin (2) - 3 freq remainan (2) - 2 freq obtainin (2) - 1 freq reddinin (2) - 1 freq rainin (2) - 41 freq retirin (2) - 10 freq returnin (2) - 14 freq retains (2) - 4 freq retained (2) - 2 freq remaining (2) - 5 freq definin (3) - 4 freq retrain (3) - 2 freq outlinin (3) - 1 freq retails (3) - 1 freq sustainin (3) - 1 freq rinin (3) - 2 freq drainin (3) - 14 freq recantin (3) - 1 freq trainin (3) - 59 freq |
retainin (0) - 6 freq remainin (2) - 13 freq retirin (3) - 10 freq rainin (3) - 41 freq returnin (3) - 14 freq retained (3) - 2 freq rationin (3) - 3 freq obtainin (3) - 1 freq retains (3) - 4 freq refinin (3) - 2 freq retain (3) - 8 freq stainin (3) - 1 freq remainan (3) - 2 freq remaineen (4) - 1 freq reponin (4) - 2 freq reasonin (4) - 5 freq reconin (4) - 1 freq reinen (4) - 1 freq ranin (4) - 1 freq tuinin (4) - 1 freq reedenin (4) - 4 freq retinal (4) - 1 freq rainan (4) - 1 freq yearnin (4) - 1 freq earnin (4) - 8 freq |
SoundEx code - R355 ruddiman - 2 freq redeemin - 1 freq rationin - 3 freq reedenin - 4 freq rudimentary - 2 freq retainin - 6 freq retumin - 1 freq roadman - 3 freq reddening - 1 freq reddinin - 1 freq road-man - 1 freq roadmen - 1 freq redmond - 2 freq redmondlabour - 1 freq rothiemoon - 3 freq rdamentalist - 1 freq |
MetaPhone code - RTNN reedenin - 4 freq retainin - 6 freq reddinin - 1 freq |
RETAININ |
| Time to execute Levenshtein function - 0.189628 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.350788 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.027522 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.038635 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.000933 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. |