| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rattlin (0) - 52 freq rettlin (1) - 2 freq battlin (1) - 5 freq rattlin' (1) - 1 freq sattlin (1) - 4 freq brattlin (1) - 8 freq rattlan (1) - 5 freq prattlin (1) - 1 freq cattlie (2) - 2 freq ruttin (2) - 1 freq battling (2) - 1 freq fettlin (2) - 6 freq rammlin (2) - 2 freq rattlet (2) - 1 freq jattin (2) - 1 freq catilin (2) - 1 freq wrastlin (2) - 3 freq cuttlin (2) - 1 freq rottin (2) - 10 freq raivlin (2) - 1 freq ratin (2) - 1 freq attain (2) - 2 freq rantin (2) - 9 freq sprattlin (2) - 4 freq rattles (2) - 11 freq |
rattlin (0) - 52 freq rettlin (1) - 2 freq rattlan (1) - 5 freq battlin (2) - 5 freq rattlin' (2) - 1 freq prattlin (2) - 1 freq brattlin (2) - 8 freq sattlin (2) - 4 freq rattoun (3) - 1 freq kettlin (3) - 3 freq rattled (3) - 34 freq rattil (3) - 1 freq littlin (3) - 17 freq ratton (3) - 51 freq rustlin (3) - 10 freq trottlin (3) - 1 freq tittlin (3) - 1 freq rattlt (3) - 1 freq rattle (3) - 35 freq drittlin (3) - 2 freq ettlin (3) - 315 freq nettlin (3) - 1 freq futtlin (3) - 1 freq settlin (3) - 38 freq battlen (3) - 2 freq |
SoundEx code - R345 rattlin - 52 freq riddlum - 1 freq riddlums - 2 freq retellin - 4 freq riddlings - 1 freq redolent - 4 freq rattlin' - 1 freq rettlin - 2 freq rattlan - 5 freq riddlin - 1 freq re-tellin - 1 freq reideileen - 6 freq |
MetaPhone code - RTLN rattlin - 52 freq retellin - 4 freq rattlin' - 1 freq rettlin - 2 freq rattlan - 5 freq riddlin - 1 freq re-tellin - 1 freq reideileen - 6 freq |
RATTLIN |
| Time to execute Levenshtein function - 0.489127 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.896554 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.092775 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.110566 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.000882 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. |