Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pummelled (0) - 1 freq rummelled (1) - 3 freq kummelled (1) - 1 freq tummelled (1) - 2 freq cummelled (1) - 2 freq bummeled (2) - 1 freq pummellin (2) - 1 freq rummeled (2) - 2 freq summerled (2) - 1 freq pummel's (3) - 1 freq fummled (3) - 3 freq smelled (3) - 11 freq jummled (3) - 1 freq pummelt (3) - 1 freq pannelled (3) - 1 freq fuelled (3) - 7 freq rummellin (3) - 1 freq hummered (3) - 1 freq cummled (3) - 2 freq wummled (3) - 3 freq tummled (3) - 4 freq impelled (3) - 2 freq melled (3) - 34 freq pummel (3) - 4 freq rummiled (3) - 1 freq |
pummelled (0) - 1 freq rummelled (2) - 3 freq cummelled (2) - 2 freq tummelled (2) - 2 freq kummelled (2) - 1 freq pummellin (3) - 1 freq summerled (4) - 1 freq rummeled (4) - 2 freq bummeled (4) - 1 freq panelled (5) - 2 freq rummiled (5) - 1 freq melled (5) - 34 freq hummled (5) - 1 freq pummel (5) - 4 freq impelled (5) - 2 freq pulled (5) - 174 freq rummled (5) - 3 freq compelled (5) - 3 freq mummled (5) - 11 freq tummled (5) - 4 freq jummled (5) - 1 freq smelled (5) - 11 freq fummled (5) - 3 freq pummel's (5) - 1 freq pannelled (5) - 1 freq |
SoundEx code - P543 pummelt - 1 freq penality - 1 freq penalty - 28 freq pummelled - 1 freq penalties - 11 freq penalité - 1 freq penultimate - 5 freq pannelled - 1 freq panelled - 2 freq |
MetaPhone code - PMLT pummelt - 1 freq pummelled - 1 freq |
PUMMELLED |
Time to execute Levenshtein function - 0.564976 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.010196 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.097110 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.098247 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.001252 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. |