| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peremptor (0) - 2 freq peremptory (1) - 1 freq predator (3) - 7 freq perimeter (3) - 10 freq pittempton (4) - 3 freq heritor (4) - 1 freq premier (4) - 7 freq prompt (4) - 3 freq promptly (4) - 12 freq serepta (4) - 1 freq perception (4) - 11 freq veesitor (4) - 21 freq premature (4) - 7 freq exempt (4) - 12 freq pedester (4) - 1 freq promptit (4) - 3 freq creator (4) - 5 freq permit (4) - 7 freq precentor (4) - 11 freq preston (4) - 8 freq trector (4) - 2 freq hereafter (4) - 1 freq hereefter (4) - 3 freq territor (4) - 5 freq exemplar (4) - 15 freq |
peremptor (0) - 2 freq peremptory (1) - 1 freq perimeter (4) - 10 freq premature (5) - 7 freq promptit (5) - 3 freq promptin (5) - 3 freq propter (5) - 1 freq promptly (5) - 12 freq prompted (5) - 1 freq prompt (5) - 3 freq predator (5) - 7 freq primpit (6) - 1 freq operator (6) - 5 freq prenter (6) - 7 freq promontory (6) - 2 freq pre-emptit (6) - 1 freq permitirt (6) - 1 freq raptor (6) - 1 freq tempter (6) - 1 freq primpett (6) - 1 freq premier (6) - 7 freq predatory (6) - 1 freq permit (6) - 7 freq prepaar (6) - 1 freq perception (6) - 11 freq |
SoundEx code - P651 promptit - 3 freq promptly - 12 freq pre-nuptial - 1 freq primpett - 1 freq prompted - 1 freq promptin - 3 freq prompt - 3 freq primp - 5 freq primped - 3 freq prenuptial - 1 freq prenup - 2 freq pirnfu - 1 freq promptlike - 1 freq preen-prick - 2 freq peremptor - 2 freq pre-emptive - 1 freq €˜pre-emptive - 1 freq pre-emptit - 1 freq prein-pricks - 1 freq primpit - 1 freq promuivin - 3 freq promuives - 3 freq promeuvin - 1 freq promuive - 3 freq peremptory - 1 freq promoval - 2 freq permeable - 1 freq primpin - 1 freq pornhub - 2 freq primevideo - 1 freq pro-unification - 1 freq proamfootball - 19 freq pharmabhoy - 1 freq |
MetaPhone code - PRMPTR peremptor - 2 freq peremptory - 1 freq |
PEREMPTOR |
| Time to execute Levenshtein function - 0.240215 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.415359 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.027278 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.037206 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.000821 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. |