Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ettle (0) - 190 freq ettlt (1) - 21 freq ettld (1) - 1 freq httle (1) - 1 freq settle (1) - 96 freq ettles (1) - 80 freq fettle (1) - 23 freq rettle (1) - 1 freq nettle (1) - 8 freq ettlet (1) - 8 freq etle (1) - 1 freq ettle' (1) - 1 freq eittle (1) - 1 freq etttle (1) - 1 freq mettle (1) - 12 freq ettie (1) - 4 freq kettle (1) - 85 freq ettled (1) - 76 freq etter (2) - 2 freq style (2) - 158 freq erle (2) - 4 freq settler (2) - 1 freq etse (2) - 1 freq ebble (2) - 1 freq bette (2) - 3 freq |
ettle (0) - 190 freq eittle (1) - 1 freq ettie (2) - 4 freq etttle (2) - 1 freq kettle (2) - 85 freq ettled (2) - 76 freq title (2) - 65 freq ettil (2) - 22 freq ettle' (2) - 1 freq teetle (2) - 10 freq mettle (2) - 12 freq ettlt (2) - 21 freq etle (2) - 1 freq settle (2) - 96 freq ettld (2) - 1 freq ettles (2) - 80 freq fettle (2) - 23 freq ettlet (2) - 8 freq nettle (2) - 8 freq httle (2) - 1 freq rettle (2) - 1 freq ettlit (3) - 3 freq etten (3) - 35 freq dottle (3) - 1 freq ett (3) - 97 freq |
SoundEx code - E340 ettle - 190 freq eedol - 1 freq eithlie - 8 freq ettil - 22 freq eittle - 1 freq eet'll - 9 freq eithly - 2 freq ettle' - 1 freq etttle - 1 freq etle - 1 freq ethlie - 1 freq eedle - 1 freq etl - 1 freq |
MetaPhone code - ETL ettle - 190 freq eedol - 1 freq ettil - 22 freq eittle - 1 freq eet'll - 9 freq ettle' - 1 freq etttle - 1 freq etle - 1 freq eedle - 1 freq etl - 1 freq |
ETTLE |
Time to execute Levenshtein function - 0.194165 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.365481 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.027527 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.040118 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.000994 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. |