| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| palmer (0) - 3 freq balmer (1) - 2 freq calmer (1) - 3 freq aller (2) - 2 freq palled (2) - 5 freq paeper (2) - 3 freq padme (2) - 1 freq baler (2) - 4 freq panzer (2) - 1 freq warmer (2) - 25 freq calmed (2) - 14 freq psalter (2) - 1 freq pales (2) - 2 freq colmer (2) - 1 freq patter (2) - 56 freq alder (2) - 1 freq naemer (2) - 3 freq tamer (2) - 2 freq pander (2) - 1 freq aaler (2) - 17 freq yammer (2) - 5 freq falter (2) - 1 freq halper (2) - 2 freq palmerio (2) - 1 freq payer (2) - 1 freq |
palmer (0) - 3 freq palmerio (2) - 1 freq calmer (2) - 3 freq balmer (2) - 2 freq colmer (3) - 1 freq poller (3) - 1 freq primer (3) - 10 freq palm (3) - 33 freq elmer (3) - 2 freq palaver (3) - 10 freq pelter (3) - 1 freq palms (3) - 11 freq palmie (3) - 1 freq pler (3) - 1 freq pallor (3) - 4 freq puller (3) - 1 freq palma (3) - 2 freq pawper (4) - 6 freq plume (4) - 7 freq elmar (4) - 2 freq aalter (4) - 1 freq primar (4) - 1 freq calder (4) - 12 freq pale' (4) - 1 freq farmer (4) - 9 freq |
SoundEx code - P456 plainer - 3 freq polnar - 1 freq palmerio - 1 freq plunnér - 1 freq palmer - 3 freq plunner - 1 freq planner - 4 freq planer - 1 freq pollner's - 1 freq palm-reinged - 1 freq planners - 2 freq plunnerin - 1 freq plenary - 2 freq plummer - 1 freq palmers - 1 freq palmerston - 2 freq |
MetaPhone code - PLMR plumber - 14 freq palmerio - 1 freq palmer - 3 freq plummer - 1 freq |
PALMER |
| Time to execute Levenshtein function - 0.181074 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.375545 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.027190 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.037202 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.000931 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. |