| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daft-lookin (0) - 1 freq daft-luikin (2) - 1 freq waxy-lookin (3) - 1 freq bad-lookin (3) - 3 freq ratty-lookin (3) - 1 freq doon-lookin (3) - 1 freq nazi-lookin (3) - 1 freq nasty-lookin (3) - 1 freq waxylookin (4) - 1 freq frail-lookin (4) - 1 freq odd-lookin (4) - 1 freq guid-lookin (4) - 4 freq fine-lookin (4) - 2 freq decent-lookin (4) - 1 freq daft-like (4) - 9 freq rum-lookin (4) - 1 freq comfy-lookin (4) - 1 freq ill-lookin (4) - 3 freq nasty-looking (4) - 1 freq bad-lookin' (4) - 1 freq radge-lookin (4) - 2 freq braw-lookin (4) - 4 freq unco-lookin (4) - 1 freq daft-lik (4) - 2 freq sarky-lookin (4) - 1 freq |
daft-lookin (0) - 1 freq daft-luikin (2) - 1 freq daft-like (5) - 9 freq nasty-lookin (5) - 1 freq doon-lookin (5) - 1 freq ratty-lookin (5) - 1 freq daft-lik (5) - 2 freq decent-lookin (6) - 1 freq fine-lookin (6) - 2 freq odd-lookin (6) - 1 freq bad-lookin (6) - 3 freq waxy-lookin (6) - 1 freq nazi-lookin (6) - 1 freq saft-lik (7) - 1 freq sarky-lookin (7) - 1 freq hert-likin (7) - 4 freq doun-luikin (7) - 1 freq daftlike (7) - 1 freq hairt-likin (7) - 1 freq saft-like (7) - 1 freq unco-lookin (7) - 1 freq doon-leukin (7) - 1 freq nasty-looking (7) - 1 freq comfy-lookin (7) - 1 freq braw-lookin (7) - 4 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 - TFTLKN daft-luikin - 1 freq daft-lookin - 1 freq |
DAFT-LOOKIN |
| Time to execute Levenshtein function - 0.221566 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.375381 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.027608 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.039833 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. |