| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nervees (0) - 7 freq nerves (1) - 43 freq mervels (2) - 1 freq nervous (2) - 73 freq serves (2) - 26 freq neives (2) - 10 freq eevees (2) - 1 freq nerve (2) - 19 freq servers (2) - 1 freq rees (3) - 6 freq ferlee (3) - 2 freq herries (3) - 4 freq berween (3) - 1 freq fermers (3) - 89 freq hervest (3) - 10 freq pervert (3) - 1 freq leavers (3) - 1 freq nives (3) - 2 freq €˜nerves (3) - 2 freq intervenes (3) - 1 freq services (3) - 66 freq reivers (3) - 17 freq mercedes (3) - 5 freq neems (3) - 7 freq server (3) - 2 freq |
nervees (0) - 7 freq nerves (1) - 43 freq nervous (2) - 73 freq neives (3) - 10 freq nerve (3) - 19 freq serves (3) - 26 freq jervis (4) - 1 freq derives (4) - 10 freq surveys (4) - 10 freq reives (4) - 2 freq nieves (4) - 15 freq eanvees (4) - 1 freq tarves (4) - 8 freq nevis (4) - 4 freq unnerves (4) - 1 freq reeves (4) - 5 freq turves (4) - 1 freq pervs (4) - 1 freq norraes (4) - 1 freq narraes (4) - 1 freq nories (4) - 25 freq energies (4) - 2 freq nervish (4) - 8 freq navies (4) - 1 freq nervy (4) - 5 freq |
SoundEx code - N612 nervous - 73 freq nervously - 31 freq nerves - 43 freq nervish - 8 freq 'nervous' - 1 freq nyirps - 1 freq nervees - 7 freq nervees-wye - 1 freq nearbegyaain - 1 freq nairae-boukit - 2 freq nervous-like - 2 freq €˜nerves - 2 freq nervishlie - 1 freq nerrae-boukit - 1 freq nerve-agent - 1 freq nearbigyaain - 1 freq near-be-gaan - 1 freq nrrvic - 1 freq |
MetaPhone code - NRFS nervous - 73 freq nerves - 43 freq 'nervous' - 1 freq nervees - 7 freq €˜nerves - 2 freq |
NERVEES |
| Time to execute Levenshtein function - 0.200182 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.358376 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.028334 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.040191 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.000872 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. |