| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jordy (0) - 4 freq wordy (1) - 11 freq foray (2) - 1 freq moudy (2) - 1 freq rody (2) - 1 freq jonny (2) - 5 freq fjords (2) - 2 freq howdy (2) - 1 freq porty (2) - 1 freq wirdy (2) - 1 freq corey (2) - 1 freq jury (2) - 109 freq moray (2) - 80 freq coordy (2) - 1 freq moody (2) - 4 freq jobby (2) - 10 freq joey (2) - 21 freq kord (2) - 2 freq rory (2) - 15 freq roddy (2) - 11 freq judy (2) - 19 freq sorry (2) - 483 freq jolly (2) - 19 freq lory (2) - 42 freq cord (2) - 18 freq |
jordy (0) - 4 freq wordy (2) - 11 freq jorim (3) - 3 freq jorum (3) - 1 freq yirdy (3) - 6 freq joryg (3) - 1 freq corda (3) - 1 freq lord (3) - 396 freq bord (3) - 2 freq cardy (3) - 1 freq fjord (3) - 2 freq gord (3) - 1 freq horde (3) - 1 freq aujord (3) - 1 freq jordan (3) - 52 freq word (3) - 697 freq tardy (3) - 2 freq forde (3) - 3 freq jared (3) - 3 freq gurdy (3) - 2 freq jorg (3) - 1 freq jerry (3) - 15 freq morde (3) - 1 freq joda (3) - 3 freq hurdy (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 |
JORDY |
| Time to execute Levenshtein function - 0.228227 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.870606 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.089295 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.096442 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.000792 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. |