| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roidheids (0) - 1 freq reidheids (1) - 1 freq godheid (3) - 5 freq coneheids (3) - 1 freq rig-heids (3) - 1 freq foreheids (3) - 1 freq roondheads (3) - 1 freq skinheids (3) - 1 freq pitheids (3) - 1 freq orchids (4) - 2 freq braeheids (4) - 1 freq reishils (4) - 1 freq owreheids (4) - 1 freq ridgers (4) - 3 freq ridges (4) - 6 freq ro'hes (4) - 1 freq riders (4) - 8 freq rosebeds (4) - 1 freq dreids (4) - 2 freq wa-heids (4) - 1 freq bardheid (4) - 1 freq skinheid (4) - 1 freq reid-heidit (4) - 5 freq roddecks (4) - 5 freq roddie's (4) - 2 freq |
roidheids (0) - 1 freq reidheids (1) - 1 freq roondheads (4) - 1 freq riddies (5) - 1 freq rodds (5) - 5 freq ordhers (5) - 1 freq orchids (5) - 2 freq roadsides (5) - 3 freq pitheids (5) - 1 freq coneheids (5) - 1 freq godheid (5) - 5 freq foreheids (5) - 1 freq rig-heids (5) - 1 freq heids (6) - 465 freq roadies (6) - 4 freq ridness (6) - 1 freq roadside (6) - 14 freq rodents (6) - 2 freq oerheid (6) - 1 freq roughed (6) - 1 freq roddside (6) - 2 freq rid-heidit (6) - 2 freq bairnheids (6) - 1 freq foreheads (6) - 1 freq rodgers (6) - 2 freq |
SoundEx code - R332 radiates - 3 freq reidheids - 1 freq rotates - 2 freq roidheids - 1 freq retweets - 3 freq readoutsignpost - 1 freq redditships - 1 freq |
MetaPhone code - RTHTS reidheids - 1 freq roidheids - 1 freq |
ROIDHEIDS |
| Time to execute Levenshtein function - 0.371676 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.670986 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.029381 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.072547 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.000872 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. |