| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rhododendron (0) - 3 freq rhododenron (1) - 1 freq rhododendrons (1) - 3 freq lepidodendron (4) - 1 freq hendron (5) - 2 freq hoddengrey (5) - 2 freq shooderin (5) - 4 freq howderin (6) - 3 freq rhinoceros (6) - 1 freq rosidandrum (6) - 2 freq shudderin (6) - 1 freq hooverin (6) - 5 freq hoondin (6) - 1 freq rodden's (6) - 1 freq rodderz (6) - 3 freq roodery (6) - 1 freq gododdin (6) - 2 freq shooder's (6) - 1 freq hauden-doon (6) - 1 freq hodden (6) - 8 freq foondrin (6) - 1 freq hodden-grey (6) - 1 freq hooveran (6) - 1 freq whidderin (6) - 5 freq rudderin (6) - 1 freq |
rhododendron (0) - 3 freq rhododendrons (2) - 3 freq rhododenron (2) - 1 freq lepidodendron (6) - 1 freq hoddengrey (8) - 2 freq hendron (8) - 2 freq dodderin (9) - 1 freq whudderin (9) - 1 freq haddington (9) - 7 freq whidderin (9) - 5 freq rudderin (9) - 1 freq rosidandrum (9) - 2 freq shudderin (9) - 1 freq shooderin (9) - 4 freq raeddened (10) - 1 freq rhinoceros (10) - 1 freq roddenberrie (10) - 12 freq thunderin (10) - 2 freq roondan (10) - 4 freq heddintuin (10) - 1 freq reddened (10) - 1 freq roondin (10) - 1 freq howderin (10) - 3 freq roddens (10) - 4 freq rodden (10) - 15 freq |
SoundEx code - R335 rotation - 1 freq rhododendron - 3 freq radiatin - 3 freq road-widenin - 1 freq rhododendrons - 3 freq re-editin - 1 freq rhododenron - 1 freq radiation - 3 freq rotations - 1 freq radiating - 1 freq retweetin - 2 freq retwattin - 1 freq rideouttim - 1 freq retweeting - 1 freq |
MetaPhone code - RHTTNTRN rhododendron - 3 freq |
RHODODENDRON |
| Time to execute Levenshtein function - 0.198494 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.363050 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.041716 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.044843 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.000843 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. |