Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nymphs (0) - 4 freq nymph (1) - 2 freq humphs (2) - 2 freq sumphs (2) - 8 freq camphe (3) - 1 freq nemos (3) - 1 freq nims (3) - 2 freq nycht (3) - 4 freq neeps (3) - 148 freq dumps (3) - 14 freq wimps (3) - 1 freq mps (3) - 31 freq nyows (3) - 3 freq gumph (3) - 1 freq nops (3) - 1 freq nym (3) - 1 freq humphd (3) - 1 freq jumps (3) - 18 freq hmmph (3) - 8 freq jump's (3) - 1 freq syme's (3) - 1 freq nyfe's (3) - 1 freq kemp's (3) - 1 freq fomuhs (3) - 1 freq jimps (3) - 2 freq |
nymphs (0) - 4 freq nymph (2) - 2 freq sumphs (3) - 8 freq humphs (3) - 2 freq seanymphs (4) - 1 freq jamph (5) - 1 freq naips (5) - 1 freq numpty (5) - 29 freq sumps (5) - 1 freq humphy (5) - 52 freq hmph (5) - 1 freq pumps (5) - 12 freq dumphy (5) - 50 freq oomph (5) - 4 freq lamps (5) - 36 freq nems's (5) - 1 freq name's (5) - 33 freq nimbus (5) - 1 freq nips (5) - 27 freq mph (5) - 2 freq blumphs (5) - 3 freq bump's (5) - 1 freq nhs (5) - 38 freq bumps (5) - 8 freq sumph (5) - 21 freq |
SoundEx code - N512 nimbus - 1 freq nymphs - 4 freq non-fiction - 4 freq nanophase - 1 freq non-pc - 1 freq nimbyism - 2 freq |
MetaPhone code - NMFS nymphs - 4 freq |
NYMPHS |
Time to execute Levenshtein function - 0.196778 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.375514 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.028230 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.038906 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.000849 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. |