| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daffodils (0) - 9 freq datfodils (1) - 1 freq daffoddils (1) - 1 freq daffiks (3) - 1 freq daffins (3) - 1 freq daffies (3) - 4 freq saffties (4) - 1 freq daddies (4) - 3 freq fooils (4) - 1 freq daffs (4) - 3 freq jaffilt (4) - 1 freq dandies (4) - 15 freq dafities (4) - 1 freq daffed (4) - 3 freq doodilt (4) - 3 freq daffin (4) - 18 freq oafferins (4) - 1 freq abodies (4) - 1 freq daffie- (4) - 1 freq awbodies (4) - 1 freq affil (4) - 7 freq dafferie (4) - 4 freq affairs (4) - 41 freq naebodies (4) - 1 freq dafties (4) - 17 freq |
daffodils (0) - 9 freq daffoddils (2) - 1 freq datfodils (2) - 1 freq daffins (5) - 1 freq daffies (5) - 4 freq daffiks (5) - 1 freq daffs (6) - 3 freq daffed (6) - 3 freq daffys (6) - 1 freq duffy's (7) - 4 freq defenders (7) - 8 freq dawdles (7) - 1 freq duffle (7) - 2 freq modils (7) - 1 freq fufidius (7) - 2 freq diffs (7) - 2 freq doffs (7) - 1 freq doddles (7) - 2 freq defends (7) - 1 freq duffel (7) - 2 freq difficult (7) - 71 freq officials (7) - 5 freq waffles (7) - 1 freq differ's (7) - 1 freq duffs (7) - 2 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 - TFTLS daffodils - 9 freq daffoddils - 1 freq |
DAFFODILS |
| Time to execute Levenshtein function - 0.207445 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.352238 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.027154 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.038875 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.000986 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. |