| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| prompted (0) - 1 freq promoted (1) - 2 freq romped (2) - 1 freq promptin (2) - 3 freq prompt (2) - 3 freq promote (2) - 54 freq promptit (2) - 3 freq primped (2) - 3 freq propter (2) - 1 freq promotes (2) - 6 freq promptly (2) - 12 freq propped (2) - 3 freq promised (2) - 76 freq provoked (3) - 4 freq cropped (3) - 2 freq crumpled (3) - 5 freq drooped (3) - 1 freq roosted (3) - 2 freq hrumphed (3) - 1 freq promises (3) - 24 freq grouped (3) - 1 freq erupted (3) - 8 freq protested (3) - 9 freq proved (3) - 31 freq sprouted (3) - 1 freq |
prompted (0) - 1 freq promoted (2) - 2 freq primped (3) - 3 freq promptit (3) - 3 freq promptly (3) - 12 freq prompt (3) - 3 freq promptin (3) - 3 freq promotes (4) - 6 freq propped (4) - 3 freq promised (4) - 76 freq romped (4) - 1 freq promote (4) - 54 freq propter (4) - 1 freq protected (5) - 13 freq tempted (5) - 23 freq prospered (5) - 1 freq preented (5) - 1 freq trumped (5) - 2 freq crimped (5) - 1 freq grumphed (5) - 8 freq prented (5) - 3 freq primed (5) - 3 freq cremated (5) - 1 freq pimpled (5) - 1 freq peremptor (5) - 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 - PRMPTT promptit - 3 freq prompted - 1 freq pre-emptit - 1 freq |
PROMPTED |
| Time to execute Levenshtein function - 0.228999 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.414625 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.028059 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.047461 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.000879 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. |