| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreels (0) - 11 freq drees (1) - 6 freq reels (1) - 20 freq dreel (1) - 26 freq dreeps (1) - 13 freq dreils (1) - 1 freq dreelt (1) - 1 freq creels (1) - 24 freq treeds (2) - 1 freq dreezle (2) - 1 freq dreelit (2) - 1 freq frees (2) - 4 freq rees (2) - 6 freq skeels (2) - 48 freq drools (2) - 1 freq dreeples (2) - 1 freq trevels (2) - 4 freq dreem (2) - 3 freq dreeble (2) - 1 freq deel (2) - 2 freq daels (2) - 9 freq reeks (2) - 7 freq dwells (2) - 2 freq dees (2) - 41 freq creel (2) - 37 freq |
dreels (0) - 11 freq dreils (1) - 1 freq dreelt (2) - 1 freq drools (2) - 1 freq drees (2) - 6 freq creels (2) - 24 freq dreeps (2) - 13 freq reels (2) - 20 freq dreel (2) - 26 freq draems (3) - 5 freq dreams (3) - 152 freq dirls (3) - 7 freq dries (3) - 8 freq dregs (3) - 12 freq deals (3) - 18 freq drems (3) - 1 freq drills (3) - 14 freq dreids (3) - 2 freq dells (3) - 1 freq deils (3) - 35 freq reuls (3) - 2 freq dreelin (3) - 1 freq daels (3) - 9 freq dress (3) - 97 freq dreelit (3) - 1 freq |
SoundEx code - D642 doorlike - 1 freq dour-like - 1 freq dourles - 4 freq dreels - 11 freq dirls - 7 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 - 18 freq trellis - 1 freq dourles - 4 freq dreels - 11 freq trails - 13 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 |
DREELS |
| Time to execute Levenshtein function - 0.180297 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.345633 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.028620 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.037506 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.000861 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. |