| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pelted (0) - 5 freq pelter (1) - 1 freq petted (1) - 2 freq pented (1) - 4 freq melted (1) - 10 freq elted (1) - 1 freq belted (1) - 15 freq pewled (2) - 7 freq panted (2) - 5 freq elied (2) - 1 freq weeted (2) - 1 freq seated (2) - 11 freq pettled (2) - 1 freq bolted (2) - 19 freq pelters (2) - 9 freq gelded (2) - 1 freq piloted (2) - 1 freq peaked (2) - 1 freq melled (2) - 34 freq penter (2) - 5 freq belter (2) - 34 freq piled (2) - 19 freq delved (2) - 2 freq peetied (2) - 3 freq pester (2) - 2 freq |
pelted (0) - 5 freq plated (2) - 3 freq piloted (2) - 1 freq pleated (2) - 5 freq belted (2) - 15 freq elted (2) - 1 freq pelter (2) - 1 freq petted (2) - 2 freq pented (2) - 4 freq melted (2) - 10 freq pilled (3) - 3 freq punted (3) - 5 freq halted (3) - 2 freq pelts (3) - 4 freq peinted (3) - 1 freq elated (3) - 3 freq pawted (3) - 1 freq pled (3) - 3 freq peltit (3) - 5 freq palled (3) - 5 freq related (3) - 31 freq jolted (3) - 5 freq pitted (3) - 1 freq parted (3) - 1 freq kilted (3) - 6 freq |
SoundEx code - P433 pleadit - 7 freq pleaded - 17 freq peltit - 5 freq plaited - 3 freq pleatit - 3 freq pelted - 5 freq pleidit - 3 freq platitudes - 1 freq pullootit - 1 freq plaudits - 2 freq polluted - 7 freq pleated - 5 freq pleadet - 2 freq pollutet - 1 freq plaidit - 5 freq plotted - 2 freq plodded - 2 freq pollutit - 1 freq plotit - 3 freq plated - 3 freq piloted - 1 freq plöted - 1 freq pauldetarragona - 1 freq |
MetaPhone code - PLTT pleadit - 7 freq pleaded - 17 freq peltit - 5 freq plaited - 3 freq pleatit - 3 freq pelted - 5 freq pleidit - 3 freq pullootit - 1 freq polluted - 7 freq pleated - 5 freq pleadet - 2 freq pollutet - 1 freq plaidit - 5 freq plotted - 2 freq plodded - 2 freq pollutit - 1 freq plotit - 3 freq plated - 3 freq piloted - 1 freq plöted - 1 freq |
PELTED |
| Time to execute Levenshtein function - 0.225849 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.356905 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.028401 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.038365 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.000943 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. |