| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| promuives (0) - 3 freq promuive (1) - 3 freq promises (2) - 24 freq promuivin (2) - 3 freq pruives (2) - 2 freq proves (3) - 14 freq promise (3) - 117 freq pruive (3) - 22 freq produces (3) - 17 freq ruives (3) - 2 freq remuived (3) - 5 freq profiles (3) - 8 freq proamises (3) - 1 freq proddies (3) - 1 freq promitts (3) - 1 freq pruiven (3) - 4 freq promised (3) - 76 freq procuire (3) - 1 freq promiese (3) - 1 freq preives (3) - 1 freq cruives (3) - 1 freq pruves (3) - 1 freq proxies (3) - 1 freq muives (3) - 8 freq plosives (3) - 1 freq |
promuives (0) - 3 freq promuive (2) - 3 freq pruives (3) - 2 freq promuivin (3) - 3 freq promises (3) - 24 freq preives (4) - 1 freq promiese (4) - 1 freq pruves (4) - 1 freq premises (4) - 14 freq promis (4) - 7 freq promotes (4) - 6 freq promieses (4) - 1 freq proamises (4) - 1 freq proves (4) - 14 freq promise (4) - 117 freq promoval (5) - 2 freq primus (5) - 6 freq provides (5) - 19 freq remuive (5) - 4 freq perceives (5) - 3 freq primsie (5) - 1 freq proamis (5) - 1 freq removes (5) - 2 freq primaries (5) - 4 freq purves (5) - 21 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 - PRMFS promuives - 3 freq |
PROMUIVES |
| Time to execute Levenshtein function - 0.307077 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.612745 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.078462 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.086822 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.001143 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. |