| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moppit (0) - 2 freq poppit (1) - 1 freq moppin (1) - 2 freq loppit (1) - 1 freq hoppit (1) - 2 freq toppit (1) - 1 freq coppit (1) - 3 freq moutit (2) - 1 freq moappin (2) - 1 freq happit (2) - 104 freq ootpit (2) - 28 freq coopit (2) - 3 freq soupit (2) - 4 freq oppint (2) - 2 freq poupit (2) - 6 freq adoppit (2) - 1 freq cowpit (2) - 35 freq wyppit (2) - 1 freq poppt (2) - 3 freq mumpit (2) - 2 freq mopped (2) - 3 freq wuppit (2) - 3 freq poapit (2) - 1 freq forpit (2) - 1 freq pappit (2) - 1 freq |
moppit (0) - 2 freq coppit (2) - 3 freq muppet (2) - 11 freq hoppit (2) - 2 freq toppit (2) - 1 freq poppit (2) - 1 freq moppin (2) - 2 freq loppit (2) - 1 freq keppit (3) - 17 freq hippit (3) - 7 freq dappit (3) - 1 freq lappit (3) - 7 freq poopit (3) - 4 freq poppet (3) - 8 freq dippit (3) - 12 freq tappit (3) - 6 freq suppit (3) - 10 freq mappie (3) - 20 freq tippit (3) - 10 freq rappit (3) - 1 freq bappit (3) - 1 freq zippit (3) - 1 freq wippit (3) - 12 freq cappit (3) - 3 freq toppet (3) - 2 freq |
SoundEx code - M130 moved - 192 freq muivit - 7 freq mobbed - 6 freq muived - 22 freq meeved - 22 freq mopped - 3 freq mapped - 4 freq mpd - 1 freq moffat - 27 freq muvit - 5 freq muppet - 11 freq miffed - 4 freq movit - 6 freq muvved - 2 freq muffet - 5 freq moppit - 2 freq movd - 1 freq mufft - 3 freq maved - 1 freq moabite - 1 freq muved - 29 freq meevt - 1 freq moped - 1 freq muffed - 1 freq mbtw - 1 freq mvd - 1 freq |
MetaPhone code - MPT mopped - 3 freq mapped - 4 freq mpd - 1 freq muppet - 11 freq moppit - 2 freq moped - 1 freq |
MOPPIT |
| Time to execute Levenshtein function - 0.596469 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 - 1.411492 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.167259 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.118067 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.001293 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. |