| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| psalms (0) - 17 freq psalm (1) - 39 freq psaums (1) - 2 freq psalm's (1) - 1 freq palms (1) - 11 freq balms (2) - 1 freq prams (2) - 8 freq sales (2) - 32 freq calms (2) - 2 freq palma (2) - 2 freq qualms (2) - 4 freq pal's (2) - 15 freq poalis (2) - 1 freq palus (2) - 1 freq pals (2) - 365 freq peals (2) - 2 freq salus (2) - 1 freq sals (2) - 1 freq pselbs (2) - 10 freq paal's (2) - 1 freq saems (2) - 1 freq realms (2) - 6 freq palm (2) - 33 freq psalmist (2) - 2 freq pales (2) - 2 freq |
psalms (0) - 17 freq psalm's (2) - 1 freq palms (2) - 11 freq psalm (2) - 39 freq psaums (2) - 2 freq psalmist (3) - 2 freq pselbs (3) - 10 freq pales (4) - 2 freq salma (4) - 2 freq realms (4) - 6 freq salts (4) - 1 freq palm (4) - 33 freq plooms (4) - 15 freq plums (4) - 7 freq ploums (4) - 2 freq slams (4) - 12 freq saems (4) - 1 freq prelims (4) - 2 freq slums (4) - 8 freq palls (4) - 5 freq alms (4) - 2 freq paal's (4) - 1 freq pal's (4) - 15 freq qualms (4) - 4 freq palma (4) - 2 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 - PSLMS psalms - 17 freq psalm's - 1 freq |
PSALMS |
| Time to execute Levenshtein function - 0.220321 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.336327 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.027199 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.037326 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.000928 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. |