| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doorlike (0) - 1 freq soorlike (1) - 1 freq doorie (2) - 3 freq dour-like (2) - 1 freq doolie (2) - 3 freq oonlike (2) - 1 freq dorik (3) - 5 freq soorik (3) - 2 freq dislike (3) - 6 freq snorlie (3) - 1 freq dorine (3) - 2 freq wooglie (3) - 1 freq somelike (3) - 2 freq oorie (3) - 43 freq coortlie (3) - 2 freq doulie (3) - 2 freq dorie (3) - 1 freq joco-like (3) - 1 freq coorie (3) - 29 freq doorless (3) - 1 freq oorlich (3) - 2 freq booglie (3) - 1 freq coolie (3) - 3 freq doozie (3) - 1 freq toolie (3) - 1 freq |
doorlike (0) - 1 freq soorlike (2) - 1 freq dour-like (3) - 1 freq dislike (4) - 6 freq doorkey (4) - 1 freq deidlike (4) - 2 freq mairlike (4) - 2 freq dorik (4) - 5 freq doorie (4) - 3 freq doucelike (4) - 2 freq doolie (4) - 3 freq oonlike (4) - 1 freq doodlin (5) - 2 freq darlin (5) - 55 freq boolik (5) - 1 freq dollie (5) - 1 freq woorke (5) - 1 freq droolin (5) - 3 freq lookalike (5) - 2 freq dooble (5) - 26 freq dortie (5) - 3 freq daftlike (5) - 1 freq dowlie (5) - 3 freq dourly (5) - 16 freq drillie (5) - 1 freq |
SoundEx code - D642 doorlike - 1 freq dour-like - 1 freq dourles - 4 freq dreels - 11 freq dirls - 7 freq dryholes - 1 freq drools - 1 freq drills - 14 freq dearleukin - 1 freq diarie-like - 1 freq derelict - 2 freq day-release - 1 freq dreils - 1 freq doorless - 1 freq dearly-kent - 1 freq dereliction - 1 freq derhawlish - 1 freq drillclarabelle - 1 freq darealakinfenwa - 1 freq |
MetaPhone code - TRLK doorlike - 1 freq dour-like - 1 freq diarie-like - 1 freq hydraulic - 2 freq |
DOORLIKE |
| Time to execute Levenshtein function - 0.270559 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.480844 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.029750 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.038018 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.000924 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. |