| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| prior (0) - 18 freq rior (1) - 1 freq priory (1) - 3 freq pior (1) - 1 freq primar (2) - 1 freq parlor (2) - 1 freq pair (2) - 492 freq pride (2) - 167 freq peir (2) - 3 freq orion (2) - 4 freq proos (2) - 1 freq print (2) - 24 freq priti (2) - 2 freq prog (2) - 14 freq pro (2) - 11 freq period (2) - 118 freq prise (2) - 3 freq prink (2) - 3 freq pyoor (2) - 1 freq prop (2) - 14 freq proo (2) - 3 freq rio (2) - 5 freq primer (2) - 10 freq prile (2) - 3 freq pir (2) - 31 freq |
prior (0) - 18 freq priory (1) - 3 freq priorie (2) - 7 freq pirr (2) - 2 freq pior (2) - 1 freq rior (2) - 1 freq pier (3) - 38 freq pried (3) - 2 freq prity (3) - 2 freq peoor (3) - 1 freq prow (3) - 5 freq prof (3) - 29 freq prod (3) - 3 freq drier (3) - 9 freq price (3) - 177 freq pros (3) - 4 freq prix (3) - 3 freq frier (3) - 1 freq pron (3) - 1 freq puir (3) - 544 freq prso (3) - 1 freq poor (3) - 407 freq uprora (3) - 1 freq puirer (3) - 6 freq prayer (3) - 95 freq |
SoundEx code - P660 prayer - 95 freq purer - 2 freq priorie - 7 freq prior - 18 freq poorer - 5 freq puirer - 6 freq peerier - 17 freq priory - 3 freq peerie-weerie - 1 freq pre-war - 2 freq 'prayer - 1 freq prairie - 1 freq paerer - 1 freq prayer' - 3 freq |
MetaPhone code - PRR purer - 2 freq priorie - 7 freq prior - 18 freq poorer - 5 freq puirer - 6 freq peerier - 17 freq priory - 3 freq prairie - 1 freq paerer - 1 freq |
PRIOR |
| Time to execute Levenshtein function - 0.185179 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.334133 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.027675 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.036864 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.000817 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. |