| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dhftljfwyu (0) - 1 freq daftlimmy (5) - 1 freq deftly (5) - 1 freq halfwye (5) - 1 freq hwylmwnu (6) - 1 freq halfway (6) - 7 freq dently (6) - 1 freq helpfu (6) - 21 freq duffy (6) - 52 freq dafty (6) - 29 freq halfweys (6) - 1 freq daffy (6) - 1 freq dtjkiyd (6) - 1 freq saftly (6) - 64 freq whut-wye (6) - 1 freq hotly (6) - 1 freq hatefu (6) - 5 freq dootfu (6) - 6 freq aaftly (6) - 1 freq defily (6) - 1 freq uhjmldfdyd (6) - 1 freq mettlefu (6) - 1 freq bottlefu (6) - 2 freq dulefu (6) - 3 freq dorty-wye (6) - 1 freq |
dhftljfwyu (0) - 1 freq deftly (9) - 1 freq halfwye (9) - 1 freq daftlimmy (9) - 1 freq daftlike (10) - 1 freq halfway (10) - 7 freq softly (11) - 12 freq halpfu (11) - 1 freq fluffy (11) - 20 freq dorty-wye (11) - 1 freq dulefu (11) - 3 freq daffys (11) - 1 freq bhfmfyn (11) - 1 freq derthfu (11) - 1 freq kflnfuya (11) - 1 freq shiftless (11) - 2 freq whitelaw (11) - 1 freq shiftily (11) - 1 freq dofjafcw (11) - 1 freq whitley (11) - 1 freq bottlefu (11) - 2 freq half-wye (11) - 1 freq leftley (11) - 3 freq halfweys (11) - 1 freq daffy (11) - 1 freq |
SoundEx code - D134 daft-like - 9 freq daft-luikin - 1 freq daftlike - 1 freq debaetless - 3 freq daffodils - 9 freq diveidwal - 2 freq daft-lookin - 1 freq deftly - 1 freq dovetail - 1 freq doubtless - 3 freq daffoddils - 1 freq dovetailin - 1 freq daft-lik - 2 freq dhftljfwyu - 1 freq davidleemedia - 1 freq davidalexander - 1 freq daftlimmy - 1 freq davidtaylor - 1 freq davidlinden - 2 freq |
MetaPhone code - TFTLJFY dhftljfwyu - 1 freq |
DHFTLJFWYU |
| Time to execute Levenshtein function - 0.559343 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.814079 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.039294 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.078505 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.001221 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. |