| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| psalm-beuk (0) - 1 freq psaum-buik (3) - 2 freq palm-up (4) - 1 freq pairtbeuk (4) - 1 freq sangbeuks (5) - 1 freq storybeuk (5) - 2 freq psalmist (5) - 2 freq salbe (5) - 7 freq psalm (5) - 39 freq yearbeuk (5) - 1 freq pairtbeuks (5) - 4 freq spleuk (5) - 1 freq ingle-neuk (5) - 2 freq psalter (5) - 1 freq caimbeul (5) - 1 freq palmer (5) - 3 freq castle-neuk (5) - 1 freq bill-heuk (5) - 1 freq palmie (5) - 1 freq psalm's (5) - 1 freq psalms (5) - 17 freq paet-bank (5) - 1 freq chapbeuk (5) - 1 freq skeulbeuk (5) - 1 freq salabbk (5) - 1 freq |
psalm-beuk (0) - 1 freq psaum-buik (4) - 2 freq palm-up (7) - 1 freq psalm (8) - 39 freq psalm's (8) - 1 freq psalmist (8) - 2 freq pairtbeuk (8) - 1 freq salabbk (8) - 1 freq psalms (8) - 17 freq mesel-but (9) - 1 freq pock-neuk (9) - 1 freq smeuk (9) - 6 freq ploum-kake (9) - 1 freq sate-back (9) - 1 freq plumber (9) - 14 freq pselbs (9) - 10 freq slumber (9) - 8 freq mysel-but (9) - 1 freq poast-box (9) - 1 freq pey-book (9) - 1 freq skeulbeuk (9) - 1 freq slam-dunk (9) - 1 freq polly-bag (9) - 1 freq psalter (9) - 1 freq ingle-neuk (9) - 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 - PSLMBK psalm-beuk - 1 freq |
PSALM-BEUK |
| Time to execute Levenshtein function - 0.251108 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.367776 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.027399 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.037248 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.000921 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. |