| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| davidbu (0) - 1 freq davidm (2) - 2 freq david's (2) - 17 freq david (2) - 234 freq davidfe (2) - 6 freq davidmc (2) - 7 freq davina (3) - 9 freq dividit (3) - 7 freq divider (3) - 1 freq davit (3) - 23 freq daid (3) - 5 freq davit's (3) - 1 freq divided (3) - 12 freq divides (3) - 4 freq davie's (3) - 36 freq davidhunt (3) - 3 freq 'david (3) - 2 freq davis (3) - 7 freq devide (3) - 1 freq daavid's (3) - 1 freq davies (3) - 13 freq davidson (3) - 26 freq davids (3) - 1 freq davie (3) - 229 freq dividan (3) - 1 freq |
davidbu (0) - 1 freq david (3) - 234 freq davidfe (3) - 6 freq davidm (3) - 2 freq divides (4) - 4 freq divided (4) - 12 freq dividen (4) - 1 freq daavid (4) - 12 freq dividan (4) - 1 freq devide (4) - 1 freq divid (4) - 10 freq davidmc (4) - 7 freq david's (4) - 17 freq dividin (4) - 4 freq dividit (4) - 7 freq divide (4) - 24 freq divider (4) - 1 freq dvds (5) - 3 freq devoid (5) - 7 freq devydin (5) - 1 freq dived (5) - 21 freq daavd (5) - 1 freq dayvideee (5) - 2 freq duvxb (5) - 1 freq deaved (5) - 13 freq |
SoundEx code - D131 dib-dabs - 1 freq debt-free - 1 freq doubtfu - 3 freq doubtful - 4 freq doubtfully - 2 freq debatable - 1 freq debaitabil - 1 freq davidpsnp - 1 freq debdev - 1 freq davidbowie - 1 freq davidpreece - 1 freq devtober - 1 freq davidboatymcboa - 2 freq davidbu - 1 freq davidpaisley - 4 freq davidpwebb - 1 freq daviddavismp - 1 freq davidofficer - 1 freq davidfe - 6 freq davidpolson - 1 freq |
MetaPhone code - TFTB davidbu - 1 freq |
DAVIDBU |
| Time to execute Levenshtein function - 0.244502 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.402199 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.028041 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.037791 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.000912 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. |