Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
doorless (0) - 1 freq dootless (1) - 7 freq moonless (2) - 1 freq doorweys (2) - 2 freq oonless (2) - 4 freq dourles (2) - 4 freq dowpless (2) - 2 freq doutless (2) - 4 freq soonless (2) - 2 freq dourness (2) - 4 freq pooerless (2) - 2 freq dowless (2) - 2 freq soorness (2) - 3 freq boonless (2) - 1 freq oorgless (2) - 1 freq doobles (2) - 2 freq shoeless (3) - 1 freq formless (3) - 2 freq spotless (3) - 7 freq doorkey (3) - 1 freq sounless (3) - 2 freq dowiness (3) - 1 freq dooters (3) - 2 freq soulless (3) - 3 freq dress (3) - 98 freq |
doorless (0) - 1 freq dootless (2) - 7 freq dourness (3) - 4 freq doutless (3) - 4 freq pooerless (3) - 2 freq dowless (3) - 2 freq dourles (3) - 4 freq hairless (4) - 2 freq douglass (4) - 4 freq deerness (4) - 3 freq sairless (4) - 1 freq daeless (4) - 4 freq airless (4) - 1 freq lairless (4) - 1 freq weerless (4) - 2 freq deedless (4) - 1 freq deualess (4) - 1 freq fearless (4) - 10 freq duress (4) - 4 freq peerless (4) - 1 freq pouerless (4) - 2 freq yearless (4) - 1 freq dinless (4) - 1 freq marless (4) - 8 freq kerless (4) - 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 |
DOORLESS |
Time to execute Levenshtein function - 0.216984 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.379900 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.029018 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.037531 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.000928 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. |