| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| refettle (0) - 1 freq refete (2) - 1 freq fettle (2) - 23 freq reestle (2) - 1 freq rettle (2) - 1 freq rettie (3) - 1 freq teetle (3) - 10 freq kettle (3) - 85 freq nettle (3) - 8 freq rosette (3) - 5 freq reptile (3) - 1 freq resemble (3) - 3 freq etttle (3) - 1 freq repeople (3) - 3 freq refeese (3) - 1 freq refected (3) - 1 freq reestled (3) - 1 freq resettin (3) - 1 freq rettled (3) - 1 freq kyettle (3) - 1 freq leetle (3) - 2 freq beetle (3) - 4 freq fettled (3) - 1 freq eittle (3) - 1 freq reveille (3) - 1 freq |
refettle (0) - 1 freq fettle (3) - 23 freq rettle (3) - 1 freq reestle (4) - 1 freq refete (4) - 1 freq rattle (4) - 35 freq unsettle (5) - 1 freq mettle (5) - 12 freq recently (5) - 78 freq ettle (5) - 190 freq eittle (5) - 1 freq recentlie (5) - 2 freq seattle (5) - 3 freq resattled (5) - 1 freq fettil (5) - 3 freq repeatitly (5) - 2 freq rebuttal (5) - 1 freq fettled (5) - 1 freq khettle (5) - 1 freq settle (5) - 96 freq belittle (5) - 1 freq kettle (5) - 85 freq refected (5) - 1 freq etttle (5) - 1 freq rosette (5) - 5 freq |
SoundEx code - R134 revitalisin - 4 freq rabbit-hole - 9 freq rapidly - 17 freq refettle - 1 freq rabbit-hole-an - 1 freq rabbit-hol - 4 freq rabbit-holl - 3 freq reptile - 1 freq rebuttal - 1 freq robdelaney - 1 freq |
MetaPhone code - RFTL rightly - 10 freq refettle - 1 freq |
REFETTLE |
| Time to execute Levenshtein function - 0.269567 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.419371 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.035210 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.039544 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.000977 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. |