| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roddenberrie (0) - 12 freq convenerie (5) - 4 freq gooseberries (5) - 3 freq glenbervie (5) - 2 freq hedder-berries (5) - 1 freq edinburrie (5) - 3 freq zurnbarrie (6) - 1 freq leibertie (6) - 1 freq roddens (6) - 4 freq raspberries (6) - 7 freq deerie (6) - 1 freq cowdenbeith (6) - 1 freq regenerate (6) - 1 freq suddentie (6) - 13 freq dodderin (6) - 1 freq reddened (6) - 1 freq hiddenaberdeen (6) - 12 freq bleckberrie (6) - 1 freq roddie (6) - 18 freq naerrie (6) - 1 freq dunderie (6) - 1 freq suddentlie (6) - 7 freq conveneries (6) - 6 freq renderin (6) - 5 freq goldeneye (6) - 2 freq |
roddenberrie (0) - 12 freq edinburrie (7) - 3 freq edinburrae (8) - 2 freq hodden-grey (9) - 1 freq londonderry (9) - 8 freq rodderz (9) - 3 freq hiddenaberdeen (9) - 12 freq elderberry (9) - 10 freq edinburry (9) - 1 freq reddened (9) - 1 freq rodden's (9) - 1 freq ordinarie (9) - 3 freq hoddengrey (9) - 2 freq rodden (9) - 15 freq rudderin (9) - 1 freq edinburra (9) - 5 freq zurnbarrie (9) - 1 freq roddens (9) - 4 freq hedder-berries (9) - 1 freq glenbervie (9) - 2 freq residenter (10) - 3 freq gadderie (10) - 9 freq roddin' (10) - 1 freq redden (10) - 1 freq dundeerie (10) - 1 freq |
SoundEx code - R351 redemption - 4 freq reddin-up - 1 freq roddenberrie - 12 freq roadmap - 2 freq rtnf - 1 freq |
MetaPhone code - RTNBR roddenberrie - 12 freq |
RODDENBERRIE |
| Time to execute Levenshtein function - 0.221121 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.376024 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.033961 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.045430 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.000786 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. |