| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| priorie (0) - 7 freq pirrie (2) - 1 freq primsie (2) - 1 freq priory (2) - 3 freq pirie (2) - 5 freq priouris (2) - 1 freq princie (2) - 4 freq poorie (2) - 3 freq peirie (2) - 5 freq priority (2) - 25 freq primarie (2) - 3 freq prior's (2) - 4 freq prior (2) - 18 freq rorie (2) - 3 freq pierie (2) - 8 freq prairie (2) - 1 freq provie (2) - 2 freq rior (3) - 1 freq shorie (3) - 2 freq ironie (3) - 1 freq prile (3) - 3 freq prickle (3) - 1 freq oratrie (3) - 1 freq 'rurie (3) - 2 freq prinkle (3) - 1 freq |
priorie (0) - 7 freq prairie (2) - 1 freq prior (2) - 18 freq priory (2) - 3 freq pirrie (2) - 1 freq pierie (3) - 8 freq provie (3) - 2 freq parrie (3) - 4 freq pierre (3) - 3 freq perrie (3) - 1 freq rorie (3) - 3 freq priouris (3) - 1 freq pirie (3) - 5 freq peirie (3) - 5 freq poorie (3) - 3 freq priority (3) - 25 freq primarie (3) - 3 freq peerier (4) - 17 freq prie (4) - 4 freq prize (4) - 83 freq porin (4) - 1 freq prone (4) - 11 freq pairris (4) - 2 freq feirrie (4) - 1 freq mirrie (4) - 7 freq |
SoundEx code - P660 prayer - 96 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 |
PRIORIE |
| Time to execute Levenshtein function - 0.202794 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.370764 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.028282 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.037662 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.000946 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. |