| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| prayers (0) - 54 freq payers (1) - 4 freq players (1) - 151 freq prayer (1) - 95 freq prauers (1) - 1 freq prayer' (1) - 3 freq pryers (1) - 1 freq drawers (2) - 48 freq 'prayer (2) - 1 freq laayers (2) - 30 freq papers (2) - 137 freq phasers (2) - 1 freq racers (2) - 1 freq dramers (2) - 1 freq craters (2) - 24 freq slayers (2) - 2 freq sayers (2) - 17 freq player's (2) - 1 freq frasers (2) - 2 freq fryers (2) - 1 freq draaers (2) - 3 freq sprayer's (2) - 1 freq prays (2) - 4 freq prefers (2) - 3 freq prayed (2) - 42 freq |
prayers (0) - 54 freq prauers (1) - 1 freq pryers (1) - 1 freq payers (2) - 4 freq prayer' (2) - 3 freq players (2) - 151 freq prayer (2) - 95 freq draaers (3) - 3 freq prefers (3) - 3 freq papers (3) - 137 freq pleyers (3) - 7 freq fryers (3) - 1 freq prays (3) - 4 freq prunes (4) - 3 freq priys (4) - 1 freq pers (4) - 1 freq paerls (4) - 1 freq peelers (4) - 7 freq pursuers (4) - 1 freq paepers (4) - 2 freq paiters (4) - 1 freq pliers (4) - 2 freq praises (4) - 17 freq press (4) - 218 freq paipers (4) - 5 freq |
SoundEx code - P662 prayers - 54 freq prior's - 4 freq prayer-saft - 1 freq prauers - 1 freq priouris - 1 freq prerequisite - 2 freq pryers - 1 freq |
MetaPhone code - PRYRS prayers - 54 freq pryers - 1 freq |
PRAYERS |
| Time to execute Levenshtein function - 0.276199 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.615067 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.062853 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.038174 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.000761 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. |