Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eppy (0) - 1 freq ppy (1) - 1 freq empy (1) - 6 freq appy (1) - 1 freq keppy (1) - 1 freq epty (1) - 1 freq espy (1) - 2 freq tappy (2) - 1 freq eisy (2) - 1 freq suppy (2) - 1 freq ply (2) - 3 freq ecy (2) - 1 freq cleppy (2) - 1 freq expo (2) - 1 freq repey (2) - 1 freq repay (2) - 1 freq depp (2) - 1 freq hppyu (2) - 1 freq easy (2) - 444 freq eqvy (2) - 1 freq ppe (2) - 3 freq ebay (2) - 6 freq ep's (2) - 2 freq epely (2) - 1 freq py (2) - 3 freq |
eppy (0) - 1 freq appy (1) - 1 freq ppy (1) - 1 freq yappy (2) - 1 freq pp (2) - 50 freq opp (2) - 2 freq ppe (2) - 3 freq app (2) - 46 freq keppy (2) - 1 freq epty (2) - 1 freq espy (2) - 2 freq empy (2) - 6 freq peppa (3) - 1 freq ppyc (3) - 1 freq epuf (3) - 1 freq pey (3) - 249 freq ppv (3) - 4 freq puy (3) - 3 freq mpy (3) - 1 freq poppy (3) - 22 freq hippy (3) - 4 freq upby (3) - 9 freq ep (3) - 10 freq wappy (3) - 1 freq epic (3) - 20 freq |
SoundEx code - E100 eb - 6 freq ee've - 16 freq ev - 3 freq e've - 1 freq eve - 80 freq efi - 1 freq eva - 7 freq ebb - 27 freq ef - 14 freq eff - 13 freq eif - 46 freq eiff - 1 freq eye-up - 1 freq eyebaw - 4 freq 'ee've - 1 freq eh've - 66 freq eppy - 1 freq ebay - 6 freq effi - 1 freq evie - 8 freq effie - 11 freq eep - 1 freq eye-view - 1 freq eeva - 1 freq eup - 2 freq epi - 1 freq ey've - 1 freq eyup - 1 freq evi - 1 freq evi - 1 freq ep - 10 freq ebv - 1 freq efia - 1 freq eiav - 1 freq eev - 5 freq efh - 1 freq ebbe - 5 freq eyfi - 1 freq eapbee - 1 freq epbbow - 1 freq efouy - 1 freq efp - 1 freq evy - 1 freq ebb - 1 freq ee'v - 1 freq eeav - 3 freq evb - 1 freq eeve - 8 freq efo - 1 freq |
MetaPhone code - EP eppy - 1 freq eep - 1 freq eup - 2 freq epi - 1 freq ep - 10 freq |
EPPY |
Time to execute Levenshtein function - 0.184051 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.328868 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.027521 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.038734 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.000885 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. |