| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nippy-yappy (0) - 1 freq tippy-tappy (2) - 1 freq hippy-hoppy (3) - 1 freq nippy-like (5) - 3 freq tippy-taed (5) - 3 freq geepy-gawpy (5) - 1 freq airy-fairy (6) - 2 freq fifty-yaird (6) - 1 freq tippytaes (6) - 1 freq tippytae (6) - 1 freq rumpy-pumpy (6) - 1 freq nippily (6) - 2 freq tippety-tap (6) - 1 freq nippy (6) - 29 freq tippy-toes (6) - 1 freq lit-app (6) - 4 freq yappy (6) - 1 freq hippycrate (6) - 1 freq nappy (6) - 15 freq hippycrates (6) - 4 freq tip-tap (6) - 3 freq hippy- (6) - 1 freq nippan (6) - 1 freq non-dairy (7) - 1 freq tippertaed (7) - 1 freq |
nippy-yappy (0) - 1 freq tippy-tappy (4) - 1 freq hippy-hoppy (5) - 1 freq nippy-like (7) - 3 freq tippy-taed (8) - 3 freq lit-app (9) - 4 freq tippy-toes (9) - 1 freq nappy (9) - 15 freq pup-pup (9) - 1 freq nippy (9) - 29 freq nippan (9) - 1 freq hippy- (9) - 1 freq tip-tap (9) - 3 freq geepy-gawpy (9) - 1 freq tippety-tap (9) - 1 freq uppie-tappie (9) - 1 freq nippily (9) - 2 freq rumpy-pumpy (9) - 1 freq nippie (10) - 6 freq nipple (10) - 3 freq tippie-taed (10) - 1 freq nipping (10) - 11 freq tipp-exed (10) - 1 freq hap-nap (10) - 1 freq nippt (10) - 5 freq |
SoundEx code - N110 nippy-yappy - 1 freq navefu - 1 freq neive-fu - 1 freq neivefu - 1 freq nabob - 1 freq nefife - 1 freq |
MetaPhone code - NPYP nippy-yappy - 1 freq |
NIPPY-YAPPY |
| Time to execute Levenshtein function - 0.264653 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.406295 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.028587 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.041713 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.001085 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. |