| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pompay (0) - 1 freq bombay (2) - 5 freq papay (2) - 8 freq poppy (2) - 22 freq pomp (2) - 2 freq comply (2) - 4 freq company (2) - 207 freq oompa (2) - 1 freq compy (2) - 1 freq pampas (2) - 1 freq pompei (2) - 1 freq ootlay (3) - 1 freq pimps (3) - 1 freq tommy (3) - 100 freq coman (3) - 41 freq rousay (3) - 4 freq jumpy (3) - 3 freq pump (3) - 31 freq flompy (3) - 1 freq pomfrey (3) - 1 freq combat (3) - 5 freq pupae (3) - 1 freq poatry (3) - 1 freq compo (3) - 2 freq powlar (3) - 1 freq |
pompay (0) - 1 freq pomp (2) - 2 freq pompei (2) - 1 freq compy (3) - 1 freq pampas (3) - 1 freq pump (3) - 31 freq oompa (3) - 1 freq pompeii (3) - 1 freq poppy (3) - 22 freq papay (3) - 8 freq pumpie (3) - 2 freq bumpy (4) - 1 freq pomes (4) - 1 freq popeye (4) - 8 freq kempy (4) - 2 freq peppa (4) - 1 freq papae (4) - 1 freq puppy (4) - 31 freq pamby (4) - 1 freq pamper (4) - 2 freq pumps (4) - 13 freq pop (4) - 82 freq pupa (4) - 1 freq pima (4) - 1 freq poms (4) - 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 |
POMPAY |
| Time to execute Levenshtein function - 0.199641 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.354833 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.027984 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.043616 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.000936 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. |