| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| psalm (0) - 39 freq palm (1) - 33 freq psalms (1) - 17 freq pal (2) - 497 freq caalm (2) - 1 freq saim (2) - 21 freq pale (2) - 86 freq pam (2) - 5 freq saam (2) - 2 freq pskl (2) - 1 freq peal (2) - 3 freq palf (2) - 1 freq sals (2) - 1 freq 'calm (2) - 10 freq psaums (2) - 2 freq sal (2) - 55 freq 'palm (2) - 1 freq parlm (2) - 2 freq palt (2) - 1 freq saem (2) - 4 freq sale (2) - 62 freq salma (2) - 2 freq sall (2) - 97 freq pram (2) - 18 freq pals (2) - 357 freq |
psalm (0) - 39 freq palm (2) - 33 freq psalms (2) - 17 freq parlm (3) - 2 freq paulm (3) - 2 freq palma (3) - 2 freq salma (3) - 2 freq pal' (4) - 1 freq sam (4) - 364 freq qualm (4) - 2 freq calm (4) - 128 freq palms (4) - 10 freq psa (4) - 3 freq realm (4) - 20 freq paum (4) - 2 freq paal (4) - 2 freq psml (4) - 23 freq salome (4) - 1 freq ploom (4) - 11 freq palmie (4) - 1 freq slam (4) - 13 freq plum (4) - 15 freq paloma (4) - 1 freq 'slam (4) - 1 freq slim (4) - 16 freq |
SoundEx code - P245 pauchlin - 17 freq puzzlin - 6 freq psalm-singin - 1 freq psalm-singers - 1 freq picklin - 2 freq psalms - 17 freq psalmist - 2 freq psalm - 39 freq pochlin - 1 freq pow-clawin - 1 freq psalm's - 1 freq puzzlan - 3 freq psalm-beuk - 1 freq physlink - 1 freq pusillanimous - 1 freq pzqlenthsl - 1 freq |
MetaPhone code - PSLM psalm - 39 freq |
PSALM |
| Time to execute Levenshtein function - 0.183195 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.313479 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.032635 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.037782 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.000830 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. |