| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dearleukin (0) - 1 freq owerleukin (3) - 4 freq deafenin (4) - 3 freq sair-leukin (4) - 1 freq darlin (4) - 55 freq harlequin (4) - 3 freq dearly-kent (4) - 1 freq reflekkin (4) - 1 freq derlin (4) - 1 freq doon-leukin (4) - 1 freq leukin (4) - 260 freq decreasin (4) - 1 freq deerskin (4) - 1 freq leafletin (4) - 3 freq deflectin (4) - 1 freq droukin (4) - 2 freq cleukin (4) - 2 freq hearkin (4) - 1 freq deludin (4) - 1 freq daarkenin (4) - 1 freq dealin (4) - 30 freq orra-leukin (4) - 1 freq negleckin (4) - 1 freq refleckin (4) - 4 freq queer-leukin (4) - 1 freq |
dearleukin (0) - 1 freq owerleukin (4) - 4 freq droukin (5) - 2 freq derriakin (5) - 74 freq derlin (5) - 1 freq deerskin (5) - 1 freq darlin (5) - 55 freq darkenin (6) - 9 freq reukin (6) - 1 freq derken (6) - 1 freq queer-leukin (6) - 1 freq deekin (6) - 2 freq drinkin (6) - 135 freq dreelin (6) - 1 freq queerluikin (6) - 1 freq darken (6) - 3 freq drouken (6) - 1 freq dirlin (6) - 45 freq orra-leukin (6) - 1 freq owerlookin (6) - 4 freq draalin (6) - 2 freq owerluikin (6) - 6 freq doon-leukin (6) - 1 freq drookin (6) - 3 freq dearly-kent (6) - 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 - TRLKN dearleukin - 1 freq |
DEARLEUKIN |
| Time to execute Levenshtein function - 0.220780 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.387878 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.027512 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.037260 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.000933 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. |