| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| promulgate (0) - 1 freq promulgatin (2) - 1 freq propagate (3) - 1 freq populate (3) - 3 freq profligate (3) - 1 freq wroughte (4) - 1 freq promote (4) - 54 freq througate (4) - 1 freq primula (4) - 2 freq soulmate (4) - 1 freq sporulate (4) - 1 freq emulate (4) - 2 freq doungate (4) - 1 freq promenade (4) - 8 freq populace (4) - 6 freq propagates (4) - 1 freq somegate (4) - 1 freq 'propogate (4) - 1 freq populated (4) - 2 freq promuive (4) - 3 freq probulary (4) - 2 freq colgate (4) - 2 freq proximate (4) - 1 freq prostrate (4) - 2 freq stimulate (4) - 3 freq |
promulgate (0) - 1 freq promulgatin (3) - 1 freq profligate (4) - 1 freq propagate (5) - 1 freq formulate (6) - 2 freq homologate (6) - 2 freq primula (6) - 2 freq promote (6) - 54 freq populate (6) - 3 freq promissit (7) - 1 freq propellt (7) - 1 freq stimulate (7) - 3 freq roulette (7) - 3 freq regulate (7) - 3 freq prologue (7) - 4 freq promotit (7) - 10 freq prejudgit (7) - 1 freq proggit (7) - 4 freq prostrate (7) - 2 freq relegate (7) - 2 freq crulgit (7) - 2 freq promptit (7) - 3 freq colgate (7) - 2 freq emulate (7) - 2 freq promisst (7) - 4 freq |
SoundEx code - P654 primal - 3 freq phrenology - 1 freq purnell - 1 freq promulgatin - 1 freq primula - 2 freq primly - 1 freq prummle - 3 freq 'prummle' - 2 freq perennial - 3 freq preammle - 1 freq peronall - 1 freq pre-enlightened - 1 freq pernelle - 3 freq promulgate - 1 freq paramilitary - 1 freq prnielk - 1 freq perennialunder - 1 freq |
MetaPhone code - PRMLKT promulgate - 1 freq |
PROMULGATE |
| Time to execute Levenshtein function - 0.245252 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.409978 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.028669 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.037523 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.000930 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. |