| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oompa (0) - 1 freq oomph (1) - 4 freq loompa (1) - 1 freq oota (2) - 54 freq pompay (2) - 1 freq compt (2) - 1 freq oocha (2) - 3 freq oora (2) - 1 freq compy (2) - 1 freq romp (2) - 2 freq ooa (2) - 1 freq hoomp (2) - 1 freq pomp (2) - 2 freq oop (2) - 2 freq oupa (2) - 1 freq comma (2) - 1 freq oohya (2) - 1 freq ootta (2) - 2 freq roma (2) - 1 freq oops (2) - 18 freq joppa (2) - 3 freq loma (2) - 2 freq o'ma (2) - 2 freq compo (2) - 2 freq iomaa (2) - 1 freq |
oompa (0) - 1 freq oomph (2) - 4 freq loompa (2) - 1 freq oma (3) - 81 freq oupa (3) - 1 freq comp (3) - 3 freq mop (3) - 16 freq amp (3) - 10 freq compo (3) - 2 freq mp (3) - 39 freq oop (3) - 2 freq mpy (3) - 1 freq pomp (3) - 2 freq ymp (3) - 2 freq pompay (3) - 1 freq empy (3) - 6 freq iomaa (3) - 1 freq imp (3) - 3 freq hoomp (3) - 1 freq compy (3) - 1 freq romp (3) - 2 freq moip (3) - 2 freq lope (4) - 1 freq pop (4) - 82 freq sump (4) - 3 freq |
SoundEx code - O510 onfaw - 4 freq oonhappy - 1 freq oomph - 4 freq oompa - 1 freq onhappie - 1 freq one-aff - 1 freq omb - 3 freq onby - 1 freq onieb - 1 freq onyb - 1 freq onafi - 1 freq ohhomaob - 1 freq |
MetaPhone code - OMP oompa - 1 freq |
OOMPA |
| Time to execute Levenshtein function - 0.239621 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.348161 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.032123 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.037014 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.000918 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. |