| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| priorities (0) - 19 freq prioritise (2) - 1 freq pairities (2) - 1 freq prioritised (2) - 2 freq curiosities (3) - 1 freq priorie (3) - 7 freq majorities (3) - 4 freq minorities (3) - 17 freq priority (3) - 25 freq prioritisin (3) - 1 freq autorities (3) - 2 freq pairties (3) - 94 freq asperities (4) - 1 freq porkies (4) - 2 freq impurities (4) - 2 freq sionifies (4) - 1 freq profitin (4) - 2 freq profitise (4) - 1 freq promises (4) - 24 freq deformities (4) - 1 freq curiositie (4) - 1 freq arthritis (4) - 4 freq pairtins (4) - 1 freq thirties (4) - 15 freq proxies (4) - 1 freq |
priorities (0) - 19 freq prioritise (2) - 1 freq prioritised (3) - 2 freq pairities (3) - 1 freq prioritisin (4) - 1 freq pairties (4) - 94 freq priority (4) - 25 freq praties (5) - 2 freq rareities (5) - 1 freq profits (5) - 17 freq perties (5) - 7 freq properties (5) - 5 freq pirates (5) - 7 freq priouris (5) - 1 freq profitise (5) - 1 freq priestis (5) - 1 freq parties (5) - 20 freq autorities (5) - 2 freq promotes (5) - 6 freq minorities (5) - 17 freq majorities (5) - 4 freq curiosities (5) - 1 freq priorie (5) - 7 freq privates (5) - 1 freq prior's (5) - 4 freq |
SoundEx code - P663 priority - 25 freq pre-ordained - 1 freq priorities - 19 freq prardigm - 1 freq prioritised - 2 freq prioritisin - 1 freq preeöritaisd - 1 freq prioritise - 1 freq pre-order - 2 freq pre-orders - 1 freq pierartscentre - 1 freq |
MetaPhone code - PRRTS priorities - 19 freq prioritise - 1 freq |
PRIORITIES |
| Time to execute Levenshtein function - 0.212989 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.384189 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.028400 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.041478 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.001057 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. |