| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ninevites (0) - 2 freq nineties (2) - 7 freq invites (2) - 11 freq fineries (3) - 1 freq uninvited (3) - 3 freq invitet (3) - 4 freq invite (3) - 44 freq inemies (3) - 3 freq evites (3) - 1 freq niceties (3) - 1 freq ninetiet (3) - 1 freq nineveh (3) - 3 freq invited (3) - 38 freq ninetie (3) - 2 freq nieves (3) - 15 freq inuits (4) - 2 freq intries (4) - 1 freq niviews (4) - 1 freq firesides (4) - 2 freq navies (4) - 1 freq inherited (4) - 9 freq sidelines (4) - 2 freq nevis (4) - 5 freq nines (4) - 12 freq nancies (4) - 1 freq |
ninevites (0) - 2 freq invites (3) - 11 freq nineties (3) - 7 freq uninvited (4) - 3 freq nieves (5) - 15 freq invited (5) - 38 freq uninvitin (5) - 1 freq inveits (5) - 1 freq nativities (5) - 1 freq nineveh (5) - 3 freq ninetie (5) - 2 freq invitet (5) - 4 freq ninetiet (5) - 1 freq evites (5) - 1 freq invite (5) - 44 freq niceties (5) - 1 freq invis (6) - 1 freq divits (6) - 1 freq invious (6) - 1 freq nievefus (6) - 1 freq invokes (6) - 1 freq naevius (6) - 1 freq inmates (6) - 1 freq inpits (6) - 5 freq ninians (6) - 3 freq |
SoundEx code - N513 numpties - 28 freq numpties' - 1 freq numpty - 31 freq numbed - 4 freq numptie - 9 freq noo-empty - 1 freq numptics - 1 freq ninevites - 2 freq 'numpties' - 1 freq no-ya-no-butlike - 1 freq numpttes - 1 freq numphties - 1 freq nanobots - 1 freq non-votin - 1 freq non-paid - 1 freq 'numptieness' - 1 freq |
MetaPhone code - NNFTS ninevites - 2 freq |
NINEVITES |
| Time to execute Levenshtein function - 0.217613 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.370155 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.027169 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.040843 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.000951 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. |