| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nivvertheless (0) - 4 freq nivertheless (1) - 1 freq nevertheless (2) - 4 freq ne'ertheless (3) - 1 freq nivver-the-les (3) - 2 freq nanetheless (4) - 31 freq nonetheless (4) - 6 freq naetheless (4) - 3 freq nane-the-less (5) - 1 freq wirthless (5) - 2 freq mirthless (5) - 1 freq nochttheless (5) - 1 freq nanethaless (5) - 3 freq ivver-helpfu (5) - 1 freq natheless (5) - 2 freq invertophiles (6) - 1 freq warthless (6) - 2 freq nivvers (6) - 1 freq worthless (6) - 1 freq breathless (6) - 3 freq fierceness (6) - 2 freq hertless (6) - 11 freq wireless (6) - 55 freq nivver-endin (6) - 2 freq nivver-ivver (6) - 1 freq |
nivvertheless (0) - 4 freq nivertheless (2) - 1 freq nevertheless (3) - 4 freq ne'ertheless (5) - 1 freq nivver-the-les (6) - 2 freq nonetheless (7) - 6 freq naetheless (7) - 3 freq nanetheless (7) - 31 freq natheless (8) - 2 freq nanethaless (8) - 3 freq nochttheless (8) - 1 freq wirthless (8) - 2 freq mirthless (8) - 1 freq €˜breathless (9) - 1 freq breithless (9) - 2 freq worthless (9) - 1 freq breathless (9) - 3 freq ivver-helpfu (9) - 1 freq nane-the-less (9) - 1 freq invertophiles (9) - 1 freq warthless (9) - 2 freq nummerless (10) - 2 freq ruthless (10) - 7 freq nivver's (10) - 1 freq iverthin's (10) - 1 freq |
SoundEx code - N163 neibourheid - 1 freq newport - 3 freq nivver-do-weels - 1 freq neibourhuid - 2 freq neeborhood - 2 freq nivver-the-les - 2 freq nevertheless - 4 freq nivvirdoomynd - 1 freq neibourhood - 1 freq niffered - 2 freq neeborheid - 2 freq neebored - 1 freq niffert - 1 freq nivvertheless - 4 freq nivertheless - 1 freq neebourhood - 1 freq neeborheids - 1 freq neeburhood - 1 freq newportbakery - 1 freq neebourheid - 1 freq nfrtz - 1 freq |
MetaPhone code - NFR0LS nivver-the-les - 2 freq nevertheless - 4 freq nivvertheless - 4 freq nivertheless - 1 freq |
NIVVERTHELESS |
| Time to execute Levenshtein function - 0.204891 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.374976 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.026862 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.037469 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.000852 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. |