| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dirlins (0) - 1 freq dirling (3) - 1 freq dirlin (3) - 45 freq darlins (3) - 4 freq darlings (3) - 1 freq yirlins (3) - 1 freq firin (3) - 1 freq birlins (3) - 1 freq dirs (3) - 2 freq derlins (3) - 1 freq linins (3) - 2 freq airlines (3) - 1 freq willies (3) - 1 freq darling's (3) - 23 freq durin (3) - 1 freq freins (3) - 2 freq declines (4) - 2 freq linin (4) - 1 freq diggings (4) - 1 freq singin (4) - 1 freq diine's (4) - 1 freq airlan's (4) - 10 freq fishin (4) - 1 freq pittin (4) - 1 freq ahins (4) - 1 freq |
dirlins (0) - 1 freq darling's (5) - 23 freq dirs (5) - 2 freq freins (5) - 2 freq darlings (5) - 1 freq durin (5) - 1 freq darlins (5) - 4 freq derlins (5) - 1 freq britains (6) - 1 freq bairns (6) - 2 freq damiens (6) - 1 freq carls (6) - 1 freq jarls (6) - 1 freq karlas (6) - 1 freq birlins (6) - 1 freq dirlin (6) - 45 freq yirlins (6) - 1 freq firin (6) - 1 freq willies (6) - 1 freq dirling (6) - 1 freq linins (6) - 2 freq airlines (6) - 1 freq dealins (7) - 5 freq tellin (7) - 1 freq darling (7) - 111 freq |
SoundEx code - D645 darlins - 4 freq drawlin - 7 freq darlin - 55 freq darling - 111 freq dirlin - 45 freq droolin' - 1 freq drawlin-the - 1 freq drawlin-maister - 2 freq dreelin - 1 freq darlin's' - 1 freq droolin - 3 freq 'darlin - 1 freq derlins - 1 freq derlin - 1 freq drawlin-th - 1 freq drawlin-mester - 1 freq drillin - 13 freq darleeng - 2 freq 'darlin' - 1 freq draalin-da - 1 freq draalin - 2 freq dirlan - 3 freq darling's - 23 freq darlings - 1 freq drawlan-e - 1 freq drawlan-master - 1 freq drawlan - 1 freq dreillin - 1 freq dirling - 1 freq drooling - 2 freq derailment - 2 freq darrylnaismithx - 1 freq dirlins - 1 freq darlington - 1 freq |
MetaPhone code - TRLNS darlins - 4 freq truelins - 4 freq darlin's' - 1 freq derlins - 1 freq trewlins - 3 freq trillions - 1 freq dirlins - 1 freq |
DIRLINS |
| Time to execute Levenshtein function - 0.490782 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.992248 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.095373 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.109894 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.000895 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. |