| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| regenerate (0) - 1 freq degenerate (1) - 6 freq generate (2) - 4 freq regeneration (3) - 3 freq generated (3) - 2 freq leeterate (3) - 9 freq regrate (3) - 1 freq general (4) - 200 freq deleiberate (4) - 3 freq genert (4) - 1 freq feenertie (4) - 1 freq saeperate (4) - 2 freq generals (4) - 2 freq leeterati (4) - 1 freq inveterate (4) - 1 freq leiterate (4) - 1 freq generator (4) - 3 freq generatien (4) - 2 freq ingenerit (4) - 1 freq segregate (4) - 1 freq generall (4) - 1 freq temperate (4) - 3 freq renovate (4) - 1 freq greeneree (4) - 1 freq reverberated (4) - 2 freq |
regenerate (0) - 1 freq degenerate (2) - 6 freq generate (3) - 4 freq regrate (4) - 1 freq regeneration (4) - 3 freq ingenerit (5) - 1 freq genert (5) - 1 freq generated (5) - 2 freq regent (5) - 6 freq regrait (6) - 1 freq regalate (6) - 1 freq recreate (6) - 1 freq regonalitie (6) - 1 freq incinerate (6) - 2 freq regulate (6) - 3 freq resonate (6) - 1 freq generatit (6) - 2 freq renovate (6) - 1 freq regret (6) - 50 freq feenertie (6) - 1 freq general (6) - 200 freq generator (6) - 3 freq leeterate (6) - 9 freq reignite (6) - 1 freq generatien (6) - 2 freq |
SoundEx code - R256 ragnar - 18 freq ragnar's - 3 freq ragnarok - 3 freq raisonneur - 1 freq russamyre - 1 freq rigmarole - 3 freq reckoners - 1 freq rash-ma-reishilt - 1 freq rockin-horse - 1 freq regeneration - 3 freq regenerate - 1 freq rosemarkie - 3 freq rushmore - 2 freq rigmarie - 2 freq rosiemoore - 1 freq rsmorrow - 1 freq rcsneartshub - 1 freq rocknroll - 1 freq |
MetaPhone code - RJNRT regenerate - 1 freq |
REGENERATE |
| Time to execute Levenshtein function - 0.229061 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.386404 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.028859 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.038475 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.000848 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. |