| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| depute (0) - 21 freq deputes (1) - 1 freq repute (1) - 12 freq deputy (1) - 6 freq dept (2) - 7 freq debate (2) - 81 freq delite (2) - 4 freq depot (2) - 1 freq depe (2) - 1 freq despyte (2) - 1 freq despite (2) - 101 freq pute (2) - 4 freq depth (2) - 23 freq repete (2) - 1 freq delete (2) - 9 freq defuse (2) - 2 freq debut (2) - 7 freq reute (2) - 1 freq depts (2) - 3 freq delyte (2) - 4 freq deluge (2) - 2 freq doute (2) - 2 freq deuce (2) - 3 freq dispute (2) - 6 freq delude (2) - 1 freq |
depute (0) - 21 freq deputy (1) - 6 freq depot (2) - 1 freq dept (2) - 7 freq deputes (2) - 1 freq repute (2) - 12 freq doute (3) - 2 freq delyte (3) - 4 freq depts (3) - 3 freq dopyt (3) - 1 freq adept (3) - 2 freq debut (3) - 7 freq depone (3) - 3 freq depose (3) - 1 freq dispute (3) - 6 freq despite (3) - 101 freq despyte (3) - 1 freq depe (3) - 1 freq delite (3) - 4 freq debate (3) - 81 freq pute (3) - 4 freq delete (3) - 9 freq depth (3) - 23 freq repete (3) - 1 freq dope (4) - 11 freq |
SoundEx code - D130 dippit - 12 freq daft - 444 freq doubt - 94 freq daftie - 23 freq dauvit - 95 freq dipped - 23 freq devoid - 7 freq dabbed - 9 freq debt - 45 freq deaved - 13 freq divvied - 2 freq dafty - 29 freq debate - 81 freq 'daft - 2 freq david - 234 freq doft - 1 freq defeat - 30 freq divide - 24 freq divot - 13 freq daavit - 25 freq 'daavit - 1 freq defait - 7 freq doobt - 26 freq defaut - 20 freq dubbed - 3 freq dived - 21 freq duvet - 20 freq daffed - 3 freq daupit - 3 freq dabbit - 6 freq dowpit - 26 freq defied - 5 freq 'dauvit - 2 freq divid - 10 freq dvd - 11 freq dafft - 2 freq dayvideee - 2 freq depth - 23 freq deeved - 6 freq devout - 4 freq dabaittie - 2 freq deputy - 6 freq daivit - 4 freq dappit - 1 freq devide - 1 freq dobbid - 1 freq doped - 2 freq debut - 7 freq daubed - 3 freq davit - 23 freq divïd - 8 freq 'dippit - 1 freq doffed - 3 freq debait - 1 freq 'david - 2 freq debit - 2 freq deft - 4 freq depute - 21 freq deived - 1 freq dept - 7 freq divvy-oot - 1 freq depot - 1 freq davyth - 1 freq doupit - 1 freq €œdauvit - 3 freq €œdavid - 1 freq dowped - 1 freq €˜devout - 1 freq deavit - 1 freq daavid - 12 freq daavd - 1 freq dawpit - 1 freq €œdaft - 1 freq dpd - 1 freq dbooth - 1 freq dvd' - 1 freq deepth - 1 freq “daft - 1 freq 'dived' - 3 freq dopyt - 1 freq |
MetaPhone code - TPT dippit - 12 freq tippit - 10 freq dipped - 23 freq teapot - 10 freq tiptoe - 6 freq tipped - 14 freq tiptae - 6 freq daupit - 3 freq tapped - 17 freq dowpit - 26 freq taypot - 5 freq typit - 3 freq toppet - 2 freq taupit - 1 freq deputy - 6 freq toppit - 1 freq tappit - 6 freq dappit - 1 freq typed - 10 freq doped - 2 freq taped - 4 freq 'dippit - 1 freq topped - 1 freq taepot - 1 freq taptoo - 1 freq tapp't - 1 freq toppd - 1 freq depute - 21 freq tippt - 1 freq tippytae - 1 freq tap-aat - 1 freq dept - 7 freq depot - 1 freq teapit - 1 freq doupit - 1 freq dowped - 1 freq tipt - 1 freq dawpit - 1 freq tea-pat - 1 freq tepid - 1 freq ytpyt - 1 freq dpd - 1 freq tpwd - 1 freq twhpt - 1 freq dopyt - 1 freq tapadh - 1 freq |
DEPUTE |
| Time to execute Levenshtein function - 0.302113 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.421119 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.029111 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.037951 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.000948 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. |