Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nochtless (0) - 1 freq dochtless (1) - 1 freq machtless (2) - 1 freq thochtless (2) - 5 freq sichtless (2) - 4 freq douchtless (2) - 2 freq richtness (3) - 3 freq crachtless (3) - 1 freq doubtless (3) - 3 freq noiseless (3) - 1 freq nochts (3) - 1 freq mochles (3) - 7 freq coatless (3) - 1 freq rochness (3) - 2 freq tichtness (3) - 2 freq maachtless (3) - 2 freq mauchtless (3) - 3 freq nochtie (3) - 3 freq ochtlins (3) - 1 freq dootless (3) - 7 freq lichtness (3) - 1 freq rochles (3) - 1 freq knotless (3) - 3 freq doutless (3) - 4 freq natheless (3) - 2 freq |
nochtless (0) - 1 freq dochtless (2) - 1 freq sichtless (3) - 4 freq machtless (3) - 1 freq douchtless (3) - 2 freq mauchtless (4) - 3 freq maachtless (4) - 2 freq weichtless (4) - 1 freq thochtless (4) - 5 freq ochtlins (5) - 1 freq lichtness (5) - 1 freq richtmess (5) - 1 freq natheless (5) - 2 freq nochttheless (5) - 1 freq coontless (5) - 23 freq tichtness (5) - 2 freq countless (5) - 11 freq crachtless (5) - 1 freq richtness (5) - 3 freq coatless (5) - 1 freq nochts (5) - 1 freq nicholas (6) - 4 freq shitless (6) - 1 freq lichtlins (6) - 1 freq nichtÂ’s (6) - 1 freq |
SoundEx code - N234 nichtly - 4 freq nostalgic - 8 freq nestled - 7 freq nestlin - 2 freq nostalgia - 9 freq nicht-walkers - 1 freq nestlé - 1 freq nestlt - 1 freq nestle - 2 freq nightly - 3 freq nicht-late - 1 freq nescotland - 1 freq new-stellt - 1 freq nochttheless - 1 freq nychtlie - 1 freq no-catholics - 1 freq nestily - 1 freq noctilucent - 2 freq €œnostalgia - 1 freq nasty-looking - 1 freq nochtless - 1 freq nasty-lookin - 1 freq nscotland - 3 freq nxdohwlde - 1 freq nqqjdlditj - 1 freq nostalgia's - 1 freq |
MetaPhone code - NXTLS nochttheless - 1 freq nochtless - 1 freq |
NOCHTLESS |
Time to execute Levenshtein function - 0.565997 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.921934 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.084240 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.038222 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.000891 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. |