Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
day-release (0) - 1 freq release (4) - 20 freq daybreak (5) - 1 freq careless (5) - 10 freq displease (5) - 1 freq released (5) - 31 freq day-set's (5) - 1 freq barreless (5) - 3 freq daydream (5) - 4 freq darenae (5) - 4 freq dry-cleaned (5) - 1 freq ye-please (5) - 1 freq dairylea (5) - 1 freq dry-flees (5) - 1 freq wyreless (5) - 4 freq daeless (5) - 4 freq day-lang (5) - 1 freq releases (5) - 3 freq arenae (6) - 88 freq darkens (6) - 1 freq daylie (6) - 1 freq ivy-leaf (6) - 1 freq sakeless (6) - 5 freq carcase (6) - 1 freq degrees (6) - 29 freq |
day-release (0) - 1 freq release (6) - 20 freq dry-flees (7) - 1 freq dairylea (7) - 1 freq dourles (7) - 4 freq dreels (7) - 11 freq ye-please (7) - 1 freq displease (7) - 1 freq dryholes (8) - 1 freq dug-rose (8) - 1 freq dae-weel (8) - 1 freq dallas (8) - 1 freq aid-relief (8) - 1 freq dawdles (8) - 1 freq dresse (8) - 1 freq d-ream (8) - 1 freq darkies (8) - 2 freq dileas (8) - 1 freq barrels (8) - 18 freq dairies (8) - 3 freq barleys (8) - 1 freq darlins (8) - 4 freq dailers (8) - 2 freq dahlias (8) - 2 freq day-auld (8) - 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 |
DAY-RELEASE |
Time to execute Levenshtein function - 0.209630 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.356725 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.032762 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.037871 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.000922 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. |