| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drills (0) - 14 freq trills (1) - 2 freq frills (1) - 1 freq rills (1) - 1 freq drill (1) - 53 freq dills (1) - 1 freq kills (2) - 19 freq skills (2) - 60 freq chills (2) - 7 freq peills (2) - 1 freq fills (2) - 36 freq spills (2) - 9 freq drifts (2) - 20 freq drives (2) - 27 freq trill (2) - 3 freq deils (2) - 35 freq grill (2) - 5 freq droll (2) - 13 freq gills (2) - 8 freq trials (2) - 19 freq yills (2) - 2 freq hills (2) - 245 freq brill (2) - 12 freq huills (2) - 1 freq trolls (2) - 6 freq |
drills (0) - 14 freq drill (2) - 53 freq rills (2) - 1 freq dills (2) - 1 freq frills (2) - 1 freq trills (2) - 2 freq dwalls (3) - 1 freq dalls (3) - 1 freq dwells (3) - 2 freq trolls (3) - 6 freq drillit (3) - 1 freq drilled (3) - 1 freq arillas (3) - 1 freq drillie (3) - 1 freq droll (3) - 13 freq dulls (3) - 1 freq dolls (3) - 11 freq drillin (3) - 13 freq rolls (3) - 96 freq dreels (3) - 11 freq dirls (3) - 7 freq drools (3) - 1 freq driller (3) - 5 freq ruills (3) - 2 freq dells (3) - 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 - TRLS trial's - 14 freq trials - 19 freq trellis - 1 freq dourles - 4 freq dreels - 11 freq trails - 14 freq dirls - 7 freq tirlis - 1 freq 'troilus - 1 freq tirls - 4 freq drools - 1 freq drills - 14 freq trolleys - 4 freq treeless - 3 freq day-release - 1 freq trawls - 2 freq dreils - 1 freq trills - 2 freq doorless - 1 freq trollies - 1 freq trolls - 6 freq tireless - 1 freq trials- - 1 freq trail's - 1 freq |
DRILLS |
| Time to execute Levenshtein function - 0.194317 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.370656 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.027447 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.037244 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.000894 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. |