| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daupit (0) - 3 freq doupit (1) - 1 freq yaupit (1) - 1 freq laupit (1) - 1 freq jaupit (1) - 1 freq dautit (1) - 1 freq dauvit (1) - 95 freq dampit (1) - 1 freq taupit (1) - 1 freq daudit (1) - 2 freq dappit (1) - 1 freq dawpit (1) - 1 freq causit (2) - 3 freq gaupin (2) - 8 freq saufit (2) - 1 freq cappit (2) - 3 freq rampit (2) - 2 freq hautit (2) - 2 freq rappit (2) - 1 freq pupit (2) - 1 freq doukit (2) - 3 freq pauvit (2) - 1 freq campit (2) - 2 freq drappit (2) - 93 freq naukit (2) - 6 freq |
daupit (0) - 3 freq doupit (1) - 1 freq taupit (2) - 1 freq daudit (2) - 2 freq dappit (2) - 1 freq dampit (2) - 1 freq dawpit (2) - 1 freq yaupit (2) - 1 freq dauvit (2) - 95 freq laupit (2) - 1 freq jaupit (2) - 1 freq dautit (2) - 1 freq dautie (3) - 5 freq daurt (3) - 6 freq audit (3) - 12 freq haipit (3) - 1 freq dopyt (3) - 1 freq dumpit (3) - 6 freq dippit (3) - 12 freq dukit (3) - 1 freq daunt (3) - 3 freq davit (3) - 23 freq roupit (3) - 1 freq coupit (3) - 16 freq dampt (3) - 3 freq |
SoundEx code - D130 dippit - 12 freq daft - 436 freq doubt - 86 freq daftie - 23 freq dauvit - 95 freq dipped - 23 freq devoid - 7 freq dabbed - 9 freq debt - 44 freq deaved - 13 freq divvied - 2 freq dafty - 29 freq debate - 81 freq 'daft - 2 freq david - 230 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 - 2 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 - 22 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 - 14 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 |
DAUPIT |
| Time to execute Levenshtein function - 0.258834 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.401983 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.036593 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.049221 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.001127 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. |