| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nattled (0) - 1 freq battled (1) - 2 freq sattled (1) - 29 freq rattled (1) - 32 freq nettled (1) - 1 freq batted (2) - 1 freq unsattled (2) - 1 freq matted (2) - 2 freq dottled (2) - 7 freq cattler (2) - 3 freq castled (2) - 1 freq battle (2) - 125 freq mantled (2) - 1 freq battlen (2) - 2 freq patted (2) - 14 freq rattles (2) - 9 freq nettles (2) - 23 freq nattered (2) - 1 freq cuttled (2) - 1 freq battles (2) - 26 freq fettled (2) - 1 freq pettled (2) - 1 freq rattle (2) - 36 freq nettle (2) - 8 freq cattle (2) - 22 freq |
nattled (0) - 1 freq nettled (1) - 1 freq battled (2) - 2 freq rattled (2) - 32 freq sattled (2) - 29 freq bottled (3) - 1 freq nettle (3) - 8 freq fettled (3) - 1 freq entitled (3) - 26 freq pettled (3) - 1 freq mottled (3) - 2 freq notted (3) - 1 freq settled (3) - 114 freq rettled (3) - 1 freq kittled (3) - 24 freq ettled (3) - 75 freq nestled (3) - 7 freq cuttled (3) - 1 freq untitled (3) - 1 freq nattered (3) - 1 freq intitled (3) - 1 freq dottled (3) - 7 freq unsattled (3) - 1 freq nettles (3) - 23 freq nailed (4) - 16 freq |
SoundEx code - N343 nettled - 1 freq nettletar - 1 freq nattled - 1 freq natalieahood - 57 freq |
MetaPhone code - NTLT nettled - 1 freq nattled - 1 freq |
NATTLED |
| Time to execute Levenshtein function - 0.229157 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.415984 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.031617 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.037329 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.000841 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. |