| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| prauers (0) - 1 freq prayers (1) - 59 freq pursuers (2) - 1 freq dra'ers (2) - 2 freq racers (2) - 1 freq pryers (2) - 1 freq prayer (2) - 96 freq players (2) - 152 freq praver (2) - 1 freq papers (2) - 137 freq traders (2) - 5 freq prayer' (2) - 3 freq payers (2) - 4 freq dramers (2) - 1 freq drawers (2) - 52 freq draaers (2) - 3 freq rakers (2) - 1 freq drapers (2) - 1 freq pouers (2) - 34 freq phasers (2) - 1 freq paupers (2) - 3 freq travers (2) - 4 freq craters (2) - 24 freq prefers (2) - 3 freq praper (2) - 1 freq |
prauers (0) - 1 freq prayers (1) - 59 freq pryers (2) - 1 freq draaers (3) - 3 freq payers (3) - 4 freq pouers (3) - 34 freq prayer' (3) - 3 freq purrs (3) - 3 freq prefers (3) - 3 freq paupers (3) - 3 freq pursuers (3) - 1 freq players (3) - 152 freq prayer (3) - 96 freq papers (3) - 137 freq paerts (4) - 1 freq peters (4) - 4 freq paepers (4) - 2 freq pleyers (4) - 7 freq proteus (4) - 1 freq pliers (4) - 2 freq prizes (4) - 52 freq probes (4) - 1 freq pers (4) - 1 freq prices (4) - 34 freq piers (4) - 7 freq |
SoundEx code - P662 prayers - 59 freq prior's - 4 freq prayer-saft - 1 freq prauers - 1 freq priouris - 1 freq prerequisite - 2 freq pryers - 1 freq |
MetaPhone code - PRRS prior's - 4 freq prauers - 1 freq priouris - 1 freq |
PRAUERS |
| Time to execute Levenshtein function - 0.222541 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.404720 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.033843 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.042273 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.000927 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. |