| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| purer (0) - 2 freq puirer (1) - 6 freq puer (1) - 1 freq purr (1) - 3 freq durer (1) - 1 freq pure (1) - 676 freq murr (2) - 1 freq putter (2) - 1 freq jure (2) - 1 freq herer (2) - 1 freq furr (2) - 12 freq burger (2) - 13 freq burker (2) - 2 freq cure (2) - 54 freq puce (2) - 1 freq bure (2) - 3 freq pirr (2) - 2 freq uber (2) - 2 freq pure's (2) - 1 freq po'er (2) - 2 freq purl (2) - 3 freq bucer (2) - 1 freq pu'ed (2) - 11 freq urrr (2) - 1 freq pursed (2) - 6 freq |
purer (0) - 2 freq purr (1) - 3 freq puirer (1) - 6 freq perr (2) - 23 freq pirr (2) - 2 freq poorer (2) - 5 freq paerer (2) - 1 freq porr (2) - 1 freq durer (2) - 1 freq pure (2) - 676 freq puer (2) - 1 freq wurr (3) - 27 freq prey (3) - 27 freq brer (3) - 2 freq duror (3) - 1 freq pleurer (3) - 1 freq purpre (3) - 1 freq neurer (3) - 1 freq pere (3) - 1 freq porter (3) - 14 freq faurer (3) - 36 freq parker (3) - 19 freq pared (3) - 2 freq pores (3) - 5 freq power (3) - 172 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 |
PURER |
| Time to execute Levenshtein function - 0.197671 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.406821 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.033982 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.037769 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.000994 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. |