| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nervously (0) - 31 freq pervously (1) - 1 freq seriously (2) - 72 freq nervous (2) - 73 freq neebourly (3) - 1 freq mervelously (3) - 1 freq jealously (3) - 3 freq variously (3) - 2 freq curiously (3) - 6 freq furiously (3) - 6 freq deviously (3) - 1 freq generously (3) - 1 freq enviously (3) - 1 freq nefariously (3) - 1 freq 'nervous' (3) - 1 freq perilously (3) - 1 freq piteously (4) - 1 freq imperiously (4) - 2 freq dangerously (4) - 8 freq seriouslie (4) - 2 freq cuiriously (4) - 1 freq kerfuully (4) - 1 freq narrowly (4) - 1 freq famously (4) - 7 freq nevoy (4) - 7 freq |
nervously (0) - 31 freq pervously (2) - 1 freq nervous (3) - 73 freq seriously (4) - 72 freq enviously (4) - 1 freq nefariously (5) - 1 freq 'nervous' (5) - 1 freq nerves (5) - 43 freq nervees (5) - 7 freq nervish (5) - 8 freq grievously (5) - 1 freq previously (5) - 2 freq perilously (5) - 1 freq generously (5) - 1 freq variously (5) - 2 freq curiously (5) - 6 freq mervelously (5) - 1 freq deviously (5) - 1 freq furiously (5) - 6 freq nervishlie (6) - 1 freq onerous (6) - 1 freq anxiously (6) - 38 freq crousely (6) - 8 freq sairiously (6) - 8 freq croasly (6) - 1 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 - NRFSL nervously - 31 freq |
NERVOUSLY |
| Time to execute Levenshtein function - 0.220889 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.386903 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.029814 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.037010 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.000817 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. |