| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| psalter (0) - 1 freq falter (2) - 1 freq aalter (2) - 1 freq halter (2) - 5 freq plater (2) - 1 freq walter (2) - 56 freq shalter (2) - 4 freq saltet (2) - 1 freq planter (2) - 6 freq patter (2) - 53 freq plaster (2) - 14 freq spalter (2) - 2 freq pelter (2) - 1 freq alter (2) - 15 freq safter (2) - 9 freq palmer (2) - 3 freq platter (2) - 11 freq salted (2) - 5 freq quater (3) - 5 freq smatter (3) - 2 freq chanter (3) - 14 freq waater (3) - 34 freq porter (3) - 13 freq potter (3) - 24 freq payer (3) - 1 freq |
psalter (0) - 1 freq pelter (3) - 1 freq plater (3) - 1 freq saltyre (4) - 4 freq slater (4) - 18 freq pastur (4) - 5 freq pleuter (4) - 1 freq plooter (4) - 1 freq peester (4) - 3 freq pester (4) - 2 freq paltry (4) - 1 freq pastor (4) - 1 freq pooster (4) - 5 freq posster (4) - 1 freq pleiter (4) - 1 freq plyter (4) - 3 freq saltire (4) - 43 freq poster (4) - 23 freq planter (4) - 6 freq aalter (4) - 1 freq patter (4) - 53 freq spalter (4) - 2 freq saltet (4) - 1 freq salted (4) - 5 freq walter (4) - 56 freq |
SoundEx code - P243 pousle't - 1 freq pauchled - 12 freq pochled - 3 freq puzzlt - 6 freq puggl't - 1 freq puzzlit - 1 freq puggelt - 2 freq pauchelt - 2 freq puzzled - 35 freq pickled - 10 freq puggled - 21 freq packload - 1 freq piggledy - 1 freq pochlit - 1 freq puzzelt - 11 freq peculators - 1 freq pickult - 4 freq peuchled - 1 freq pochelt - 1 freq pickelt - 3 freq pickl't - 1 freq pauchilt - 1 freq pikkilt - 1 freq pugglit - 1 freq pixelation - 1 freq pixellation - 2 freq puzzl't - 1 freq puzzlet - 3 freq p-celtic - 3 freq piggilty - 1 freq psalter - 1 freq pglet - 5 freq pksltspvqo - 1 freq |
MetaPhone code - PSLTR psalter - 1 freq |
PSALTER |
| Time to execute Levenshtein function - 0.361860 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.634636 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.057852 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.044460 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.000821 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. |