| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rettlin (0) - 2 freq rattlin (1) - 52 freq ettlin (1) - 315 freq nettlin (1) - 1 freq settlin (1) - 38 freq kettlin (1) - 3 freq fettlin (1) - 6 freq rattlan (2) - 5 freq settlit (2) - 7 freq ettlan (2) - 1 freq nestlin (2) - 2 freq tittlin (2) - 1 freq ettling (2) - 2 freq bettin (2) - 12 freq brattlin (2) - 8 freq kettlie (2) - 3 freq wrestlin (2) - 4 freq rattlin' (2) - 1 freq nettin (2) - 6 freq prattlin (2) - 1 freq beettlin (2) - 1 freq ettin (2) - 13 freq setlin (2) - 1 freq rellin (2) - 1 freq ettlin' (2) - 1 freq |
rettlin (0) - 2 freq rattlin (1) - 52 freq rattlan (2) - 5 freq kettlin (2) - 3 freq fettlin (2) - 6 freq settlin (2) - 38 freq nettlin (2) - 1 freq ettlin (2) - 315 freq futtlin (3) - 1 freq rettle (3) - 1 freq littlin (3) - 17 freq ettilin (3) - 1 freq kittlin (3) - 59 freq ruttin (3) - 1 freq bottlin (3) - 2 freq cuttlin (3) - 1 freq sattlin (3) - 4 freq drittlin (3) - 2 freq retellin (3) - 4 freq trottlin (3) - 1 freq battlin (3) - 5 freq rustlin (3) - 10 freq rettled (3) - 1 freq tittlin (3) - 1 freq rottin (3) - 10 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 |
RETTLIN |
| Time to execute Levenshtein function - 0.240943 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.493067 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.033794 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.041714 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.000915 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. |