| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| palmerston (0) - 2 freq gilmerton (3) - 1 freq paterson (3) - 14 freq walterson (3) - 1 freq patterson (3) - 10 freq anderston (3) - 1 freq paiterson (3) - 1 freq almeron (3) - 1 freq palmerio (3) - 1 freq palmers (4) - 1 freq peston (4) - 2 freq palestine (4) - 4 freq alberto (4) - 2 freq merton (4) - 4 freq pairson (4) - 2 freq aversion (4) - 4 freq permeision (4) - 1 freq parton (4) - 4 freq roberston (4) - 1 freq pumpherston (4) - 1 freq palmer (4) - 3 freq patmason (4) - 1 freq galston (4) - 2 freq manderson (4) - 1 freq hunterston (4) - 2 freq |
palmerston (0) - 2 freq gilmerton (5) - 1 freq palestine (6) - 4 freq palmerio (6) - 1 freq palestyne (6) - 1 freq almeron (6) - 1 freq preston (6) - 8 freq paiterson (6) - 1 freq walterson (6) - 1 freq patterson (6) - 10 freq paterson (6) - 14 freq anderston (6) - 1 freq paulnewton (7) - 4 freq pinkerton (7) - 4 freq immersion (7) - 5 freq peterson (7) - 2 freq perversion (7) - 1 freq person (7) - 249 freq ollerton (7) - 1 freq lampstan (7) - 1 freq pulverisin (7) - 1 freq kilmartin (7) - 1 freq plartin (7) - 1 freq balmerino (7) - 1 freq emmerson (7) - 1 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 - PLMRSTN palmerston - 2 freq |
PALMERSTON |
| Time to execute Levenshtein function - 0.217709 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.405516 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.029675 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.040219 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.001011 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. |