| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gmpe (0) - 1 freq gape (1) - 4 freq gmde (1) - 1 freq gype (1) - 47 freq gmse (1) - 1 freq gipe (1) - 1 freq gme (1) - 45 freq eme (2) - 1 freq lope (2) - 1 freq rape (2) - 19 freq hmp (2) - 1 freq mse (2) - 1 freq dope (2) - 11 freq impel (2) - 1 freq mve (2) - 1 freq ample (2) - 9 freq gye (2) - 194 freq gaze (2) - 44 freq gome (2) - 1 freq gypes (2) - 17 freq gps (2) - 4 freq glue (2) - 20 freq gaps (2) - 11 freq mph (2) - 2 freq mp (2) - 39 freq |
gmpe (0) - 1 freq gimp (2) - 3 freq gape (2) - 4 freq gump (2) - 1 freq gipe (2) - 1 freq gme (2) - 45 freq gmde (2) - 1 freq gype (2) - 47 freq gmse (2) - 1 freq gm (3) - 10 freq game (3) - 648 freq gyp (3) - 3 freq gpo (3) - 4 freq gamie (3) - 12 freq jumpe (3) - 1 freq grape (3) - 8 freq gcp (3) - 1 freq glype (3) - 3 freq gip (3) - 3 freq agape (3) - 2 freq gripe (3) - 5 freq kempe (3) - 3 freq gumph (3) - 1 freq gp (3) - 9 freq gup (3) - 2 freq |
SoundEx code - G510 gimp - 3 freq geneva - 16 freq gnef - 1 freq gumph - 1 freq geneva' - 2 freq gnap - 1 freq gameboy - 1 freq gmb - 4 freq gmpe - 1 freq gambo - 1 freq gnev - 1 freq gump - 1 freq |
MetaPhone code - KMP camp - 53 freq compo - 2 freq comp - 3 freq kemp - 46 freq cump - 1 freq kempie - 1 freq kempe - 3 freq kempy - 2 freq 'camp - 1 freq campie - 16 freq gmpe - 1 freq compy - 1 freq gump - 1 freq |
GMPE |
| Time to execute Levenshtein function - 0.299271 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.519727 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.029158 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.073761 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.001071 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. |