| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| diraaxvzyp (0) - 1 freq draas (6) - 13 freq dismay (6) - 15 freq dinaye (6) - 1 freq draains (6) - 5 freq drauchty (6) - 1 freq draapet (6) - 1 freq thraavin (6) - 1 freq draa-an (6) - 1 freq drearily (6) - 1 freq draa (6) - 51 freq drachy (6) - 1 freq braxy (6) - 2 freq daavd (6) - 1 freq draaer (6) - 2 freq draan (6) - 23 freq discovry (6) - 1 freq dreary (6) - 13 freq disavou (6) - 1 freq dinnaye (6) - 2 freq direckly (6) - 9 freq draaeens (6) - 1 freq draatsi (6) - 2 freq draabacks (6) - 1 freq piracy (6) - 1 freq |
diraaxvzyp (0) - 1 freq droap (9) - 11 freq drxuaywz (9) - 1 freq drap (9) - 265 freq drave (9) - 61 freq eraxmeyhp (9) - 1 freq dravin (9) - 4 freq draver (9) - 2 freq drivin (10) - 104 freq drives (10) - 27 freq drovers (10) - 2 freq dreivin (10) - 1 freq droves (10) - 10 freq drivven (10) - 1 freq dreven (10) - 1 freq drizzil (10) - 1 freq drovit (10) - 1 freq derives (10) - 10 freq drivin' (10) - 1 freq droopy (10) - 2 freq dervish (10) - 2 freq driving (10) - 19 freq drehv (10) - 1 freq driver (10) - 92 freq oiomrxgiep (10) - 1 freq |
SoundEx code - D621 door-gap - 1 freq daurk-broon - 2 freq drug-fuelled - 1 freq derisively - 1 freq doricaubergine - 1 freq doricbananaman - 1 freq doricbanter - 1 freq doricphrases - 139 freq doorsopendays - 1 freq derekofhighbury - 1 freq dorisvulva - 7 freq diraaxvzyp - 1 freq derekbateman - 2 freq derickfaeyell - 2 freq drrosebland - 2 freq drakeford - 1 freq driseborough - 1 freq drawzfj - 2 freq drwsv - 1 freq |
MetaPhone code - TRKSFSP diraaxvzyp - 1 freq |
DIRAAXVZYP |
| Time to execute Levenshtein function - 0.229824 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.497531 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.030188 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.043659 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.001274 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. |