| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dewtie-fu (0) - 1 freq peitie-fu (2) - 1 freq dewties (3) - 1 freq dewtie (3) - 8 freq bewtie (4) - 4 freq dewie (4) - 1 freq peitifu (4) - 1 freq mense-fu (4) - 1 freq debrief (4) - 1 freq seil-fu (4) - 1 freq denties (4) - 2 freq ferliefu (4) - 3 freq neive-fu (4) - 1 freq mettlefu (4) - 1 freq hert-fu (4) - 1 freq deities (4) - 2 freq peetifu (4) - 3 freq bewties (4) - 1 freq dewlie (4) - 1 freq merciefu (4) - 4 freq beauti-fu (4) - 1 freq dentie (4) - 6 freq dawtie (4) - 6 freq derthfu (4) - 1 freq dentie-lik (4) - 1 freq |
dewtie-fu (0) - 1 freq peitie-fu (4) - 1 freq dewtie (5) - 8 freq dewties (5) - 1 freq beauti-fu (6) - 1 freq dawtie (6) - 6 freq hert-fu (6) - 1 freq derthfu (6) - 1 freq dootfu (7) - 6 freq debrief (7) - 1 freq dyowties (7) - 1 freq dentie-lik (7) - 1 freq dowter (7) - 8 freq drum-fu (7) - 2 freq identify (7) - 22 freq bewty- (7) - 1 freq dowfie (7) - 1 freq dowters (7) - 1 freq bewtie (7) - 4 freq dentie (7) - 6 freq dewie (7) - 1 freq mettlefu (7) - 1 freq peitifu (7) - 1 freq neive-fu (7) - 1 freq denties (7) - 2 freq |
SoundEx code - D310 dootfu - 6 freq dootfae - 1 freq deidwife - 1 freq dewtie-fu - 1 freq dutv - 2 freq |
MetaPhone code - TTF dootfu - 6 freq totve - 1 freq dootfae - 1 freq dewtie-fu - 1 freq dutv - 2 freq |
DEWTIE-FU |
| Time to execute Levenshtein function - 0.212635 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.353433 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.029304 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.037487 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.000908 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. |