| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fdaeufz (0) - 1 freq frae'z (3) - 1 freq daef (3) - 1 freq daev (4) - 10 freq daen (4) - 223 freq deaf (4) - 27 freq deud (4) - 1 freq kdaz (4) - 1 freq faut' (4) - 1 freq bauf (4) - 1 freq featurt (4) - 1 freq fae' (4) - 1 freq adjecf (4) - 1 freq frae (4) - 4547 freq fleud (4) - 2 freq faz (4) - 1 freq daft (4) - 436 freq feuch (4) - 2 freq feuls (4) - 1 freq sauft (4) - 1 freq fae's (4) - 17 freq faemy (4) - 2 freq caufs (4) - 3 freq feafv (4) - 2 freq flaes (4) - 1 freq |
fdaeufz (0) - 1 freq frae'z (5) - 1 freq daef (5) - 1 freq faeder (6) - 4 freq franz (6) - 1 freq faerful (6) - 2 freq vefz (6) - 1 freq defo (6) - 208 freq 'deif' (6) - 1 freq deffo (6) - 3 freq feud (6) - 2 freq foefu (6) - 1 freq deif (6) - 28 freq fqusuz (6) - 1 freq fluff (6) - 5 freq faaed (6) - 1 freq fuff (6) - 6 freq fatefu (6) - 5 freq flaff (6) - 5 freq fief (6) - 1 freq 'daft (6) - 2 freq faaf (6) - 1 freq vrafz (6) - 1 freq fuzz (6) - 1 freq dufv (6) - 1 freq |
SoundEx code - F312 feedback - 20 freq fitefaced - 1 freq fitbaws - 6 freq feedbeck - 1 freq fittabeseen - 1 freq fitba's - 2 freq fuitfaas - 1 freq fite-fuskert - 1 freq fite-faced - 1 freq fitbas - 1 freq fdfcr - 1 freq fitbageek - 1 freq futovznlcn - 1 freq fdaeufz - 1 freq fedwuybjwj - 1 freq fatbaws - 1 freq |
MetaPhone code - FTFS fuitfaas - 1 freq fdaeufz - 1 freq |
FDAEUFZ |
| Time to execute Levenshtein function - 0.268921 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.469017 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.076594 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.073801 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.000806 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. |