| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pompeii (0) - 1 freq pompei (1) - 1 freq pompeii's (2) - 1 freq compeir (2) - 1 freq popped (3) - 36 freq rompin (3) - 2 freq romped (3) - 1 freq poppet (3) - 8 freq pome (3) - 6 freq compelt (3) - 1 freq poaped (3) - 1 freq poppin (3) - 22 freq poupit (3) - 6 freq pokeit (3) - 1 freq compels (3) - 1 freq poppets (3) - 1 freq popeye (3) - 8 freq pope (3) - 26 freq pomes (3) - 1 freq pomp (3) - 2 freq pamper (3) - 2 freq pommel (3) - 1 freq compere (3) - 6 freq compear (3) - 4 freq popes (3) - 1 freq |
pompeii (0) - 1 freq pompei (1) - 1 freq pompay (3) - 1 freq pumpie (3) - 2 freq pomp (3) - 2 freq pumpin (4) - 19 freq pamper (4) - 2 freq popeye (4) - 8 freq pope (4) - 26 freq pomes (4) - 1 freq pumped (4) - 15 freq pumpit (4) - 3 freq pompous (4) - 4 freq pome (4) - 6 freq compeir (4) - 1 freq pump (4) - 31 freq pompeii's (4) - 1 freq pmsuei (5) - 1 freq poiems (5) - 2 freq pumps (5) - 13 freq romp (5) - 2 freq pype (5) - 9 freq campie (5) - 16 freq poemin (5) - 1 freq poms (5) - 1 freq |
SoundEx code - P510 pawnwife - 1 freq pump - 31 freq pamby - 1 freq pompay - 1 freq painfu - 5 freq pomp - 2 freq pumpie - 2 freq pompeii - 1 freq pompei - 1 freq pmfw - 1 freq pnfw - 1 freq |
MetaPhone code - PMP pump - 31 freq pompay - 1 freq pomp - 2 freq pumpie - 2 freq pompeii - 1 freq pompei - 1 freq |
POMPEII |
| Time to execute Levenshtein function - 0.250633 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.420672 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.029108 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.039640 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.000947 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. |