| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moppan (0) - 1 freq moppin (1) - 2 freq morgan (2) - 37 freq toppin (2) - 5 freq poppin (2) - 22 freq shoppan (2) - 1 freq houpan (2) - 1 freq hopan (2) - 6 freq loupan (2) - 2 freq coupan (2) - 1 freq boppin (2) - 1 freq ploppan (2) - 1 freq moupin (2) - 1 freq mopin (2) - 1 freq soppin (2) - 1 freq moppit (2) - 2 freq tappan (2) - 3 freq rippan (2) - 1 freq moanan (2) - 1 freq toppen (2) - 1 freq lowpan (2) - 2 freq droppan (2) - 3 freq stoppan (2) - 2 freq oppin (2) - 4 freq moappin (2) - 1 freq |
moppan (0) - 1 freq moppin (1) - 2 freq moappin (2) - 1 freq suppan (3) - 1 freq mappa (3) - 1 freq nippan (3) - 1 freq oppin (3) - 4 freq toppen (3) - 1 freq oppen (3) - 31 freq gappan (3) - 1 freq lippan (3) - 1 freq yappan (3) - 1 freq mopped (3) - 3 freq happan (3) - 2 freq rippan (3) - 1 freq hoppin (3) - 11 freq lappan (3) - 1 freq moupin (3) - 1 freq mopin (3) - 1 freq boppin (3) - 1 freq tappan (3) - 3 freq toppin (3) - 5 freq soppin (3) - 1 freq poppin (3) - 22 freq moppit (3) - 2 freq |
SoundEx code - M150 muvin - 12 freq movin - 130 freq mopin - 1 freq muivin - 17 freq meevin - 17 freq moppin - 2 freq movan - 10 freq movin' - 2 freq mobbin - 1 freq muvvin - 2 freq moppan - 1 freq movvan - 1 freq mappin' - 1 freq moupin - 1 freq mavin - 1 freq mappiemou - 1 freq mappie-mou - 2 freq €œmappin - 1 freq mivin - 1 freq moappin - 1 freq muffin - 16 freq mpm - 1 freq 'movin - 1 freq movinÂ’ - 1 freq |
MetaPhone code - MPN mopin - 1 freq moppin - 2 freq moppan - 1 freq mappin' - 1 freq moupin - 1 freq €œmappin - 1 freq moappin - 1 freq |
MOPPAN |
| Time to execute Levenshtein function - 0.396935 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.547061 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.072864 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.051175 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.001307 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. |