| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nettle (0) - 8 freq settle (1) - 96 freq kettle (1) - 85 freq nestle (1) - 2 freq ettle (1) - 190 freq nettles (1) - 23 freq rettle (1) - 1 freq mettle (1) - 12 freq nettled (1) - 1 freq fettle (1) - 23 freq natale (2) - 1 freq jentle (2) - 2 freq settl (2) - 1 freq netter (2) - 6 freq etttle (2) - 1 freq eittle (2) - 1 freq pattle (2) - 1 freq bittle (2) - 1 freq nyeetle (2) - 1 freq mittle (2) - 1 freq settlt (2) - 13 freq etle (2) - 1 freq neale (2) - 1 freq nestie (2) - 7 freq ettle' (2) - 1 freq |
nettle (0) - 8 freq rettle (2) - 1 freq mettle (2) - 12 freq nettled (2) - 1 freq nettles (2) - 23 freq fettle (2) - 23 freq settle (2) - 96 freq ettle (2) - 190 freq kettle (2) - 85 freq nestle (2) - 2 freq lyttle (3) - 2 freq bottle (3) - 381 freq netta (3) - 6 freq newtyle (3) - 2 freq nattled (3) - 1 freq little (3) - 421 freq nettlin (3) - 1 freq rattle (3) - 35 freq nettin (3) - 6 freq unsettle (3) - 1 freq dottle (3) - 1 freq teetle (3) - 10 freq kettlie (3) - 3 freq tottle (3) - 1 freq nettils (3) - 1 freq |
SoundEx code - N340 neatly - 26 freq needle - 39 freq nately - 2 freq nettle - 8 freq noddle - 2 freq noodle - 7 freq natalia - 2 freq natal - 2 freq newtyle - 2 freq ïntil - 2 freq nae-tail - 1 freq needly - 4 freq nyeetle - 1 freq natalie - 7 freq neidil - 1 freq naitlie - 1 freq nae-deal - 1 freq natale - 1 freq nuttella - 1 freq nuttall - 1 freq |
MetaPhone code - NTL neatly - 26 freq needle - 39 freq nately - 2 freq nettle - 8 freq noddle - 2 freq noodle - 7 freq natalia - 2 freq natal - 2 freq newtyle - 2 freq ïntil - 2 freq know-it-all - 1 freq nae-tail - 1 freq needly - 4 freq natalie - 7 freq neidil - 1 freq naitlie - 1 freq nae-deal - 1 freq natale - 1 freq nuttella - 1 freq nuttall - 1 freq |
NETTLE |
| Time to execute Levenshtein function - 0.204722 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.353073 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.028579 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.048848 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.004277 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. |