| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| promptly (0) - 12 freq promptin (2) - 3 freq promptit (2) - 3 freq prompted (2) - 1 freq prompt (2) - 3 freq prolly (3) - 8 freq promotin (3) - 18 freq promotes (3) - 6 freq grumpily (3) - 1 freq probably (3) - 254 freq propale (3) - 1 freq prob'ly (3) - 1 freq properly (3) - 51 freq proppt (3) - 1 freq promote (3) - 54 freq proodly (3) - 38 freq primly (3) - 1 freq propel (3) - 2 freq comply (3) - 4 freq promitt (3) - 1 freq propter (3) - 1 freq probly (3) - 40 freq promitts (3) - 1 freq promptlike (3) - 1 freq proudly (3) - 12 freq |
promptly (0) - 12 freq prompted (3) - 1 freq prompt (3) - 3 freq promptit (3) - 3 freq promptin (3) - 3 freq promptlike (4) - 1 freq promitts (5) - 1 freq propter (5) - 1 freq promitt (5) - 1 freq propel (5) - 2 freq promotit (5) - 10 freq peremptor (5) - 2 freq primly (5) - 1 freq primpett (5) - 1 freq promoted (5) - 2 freq peremptory (5) - 1 freq propale (5) - 1 freq grumpily (5) - 1 freq promotes (5) - 6 freq promotin (5) - 18 freq primpit (5) - 1 freq properly (5) - 51 freq promote (5) - 54 freq proppt (5) - 1 freq primarily (6) - 2 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 - PRMPTL promptly - 12 freq |
PROMPTLY |
| Time to execute Levenshtein function - 0.180463 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.364827 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.027472 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.037809 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.000832 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. |