| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jreid (0) - 1 freq breid (1) - 230 freq dreid (1) - 51 freq reid (1) - 406 freq greid (1) - 1 freq treid (1) - 3 freq fraid (2) - 3 freq trei (2) - 4 freq reid- (2) - 1 freq vreit (2) - 1 freq reqd (2) - 1 freq aheid (2) - 194 freq reed (2) - 184 freq screid (2) - 8 freq beid (2) - 3 freq reif (2) - 2 freq fjrefd (2) - 1 freq dreic (2) - 1 freq krehd (2) - 1 freq dreed (2) - 13 freq tread (2) - 13 freq threid (2) - 60 freq treis (2) - 9 freq frei (2) - 5 freq druid (2) - 2 freq |
jreid (0) - 1 freq jared (2) - 3 freq breid (2) - 230 freq greid (2) - 1 freq treid (2) - 3 freq dreid (2) - 51 freq reid (2) - 406 freq fred (3) - 26 freq freed (3) - 13 freq red (3) - 297 freq droid (3) - 1 freq jeered (3) - 1 freq freud (3) - 1 freq 'red (3) - 3 freq breed (3) - 58 freq preed (3) - 4 freq traid (3) - 3 freq read (3) - 958 freq jed (3) - 53 freq dread (3) - 34 freq roid (3) - 1 freq bread (3) - 40 freq freida (3) - 1 freq gred (3) - 2 freq jieir (3) - 1 freq |
SoundEx code - J630 jowered - 1 freq jared - 3 freq jeert - 2 freq jeered - 1 freq jreid - 1 freq jordy - 4 freq |
MetaPhone code - JRT gird - 48 freq geordie - 373 freq geordie' - 4 freq gert - 4 freq gerda - 4 freq geared - 2 freq 'geordie - 8 freq jared - 3 freq jeert - 2 freq gertie - 39 freq geordo - 4 freq jeered - 1 freq gerroot - 1 freq gyrate - 1 freq geraaht - 1 freq jreid - 1 freq jordy - 4 freq geordie - 1 freq geordie - 2 freq |
JREID |
| Time to execute Levenshtein function - 0.326023 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.798819 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.087025 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.091297 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.000909 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. |