A Corpus of 21st Century Scots Texts

Intro a b c d e f g h i j k l m n o p q r s t u v w x y z Texts Writers Statistics Top200 Search Compare

Levenshtein Distance

Enter a word to find nearest neighbouring words, for example ahint

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to drookle in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
drookle (0) - 2 freq
rookle (1) - 3 freq
drookled (1) - 3 freq
rookie (2) - 2 freq
droosie (2) - 2 freq
dooble (2) - 26 freq
groozle (2) - 2 freq
trootle (2) - 1 freq
brookie (2) - 2 freq
drochle (2) - 5 freq
croodle (2) - 1 freq
drook (2) - 1 freq
doodle (2) - 10 freq
drookid (2) - 1 freq
jookle (2) - 2 freq
trooble (2) - 1 freq
drookit (2) - 89 freq
drooklin (2) - 1 freq
drookleen (2) - 1 freq
brooke (2) - 11 freq
droozie (2) - 3 freq
drookin (2) - 3 freq
drool (2) - 6 freq
drools (2) - 1 freq
trickle (3) - 6 freq
drookle (0) - 2 freq
drookled (2) - 3 freq
rookle (2) - 3 freq
drooklin (3) - 1 freq
drookit (3) - 89 freq
drookleen (3) - 1 freq
darkle (3) - 1 freq
drook (3) - 1 freq
drool (3) - 6 freq
drookin (3) - 3 freq
drookid (3) - 1 freq
dreeble (4) - 1 freq
drouks (4) - 1 freq
dreezle (4) - 1 freq
derklie (4) - 1 freq
droukit (4) - 21 freq
darkley (4) - 7 freq
derkly (4) - 1 freq
drouken (4) - 1 freq
drouk (4) - 1 freq
droukelt (4) - 2 freq
drouked (4) - 1 freq
dunkle (4) - 1 freq
drake (4) - 6 freq
daurkly (4) - 1 freq
SoundEx code - D624
draiglins - 1 freq
droukelt - 2 freq
daurklins - 3 freq
derklins - 2 freq
dreglins - 1 freq
dreezle - 1 freq
draiglt - 1 freq
drizzle - 13 freq
daurklin - 2 freq
darklins - 1 freq
darkly - 3 freq
dracula - 4 freq
darkle - 1 freq
drochle - 5 freq
darjeeling - 2 freq
dark-sweelin - 1 freq
dreechle's - 1 freq
dairkly - 1 freq
darkley - 7 freq
direckly - 9 freq
dreichly - 3 freq
dreggled - 2 freq
draggelt - 2 freq
dreezlin - 1 freq
drochles - 1 freq
drookled - 3 freq
dry-cleaned - 1 freq
dorsal - 1 freq
direk-lik - 1 freq
dreich-lookin - 1 freq
dreichly-dressed - 1 freq
drug-lairds - 1 freq
derkly - 1 freq
draigelt - 2 freq
draigless - 1 freq
drizzil - 1 freq
draigglin - 1 freq
draiggled - 2 freq
draiglety - 2 freq
draggled - 1 freq
drookle - 2 freq
drookleen - 1 freq
drooklin - 1 freq
drochlin - 2 freq
draigled - 1 freq
drochlinest - 1 freq
draiglty - 1 freq
derklie - 1 freq
derklin - 1 freq
daurkly - 1 freq
direcklie - 1 freq
dreezil - 2 freq
draigle - 1 freq
darklin - 2 freq
dursley - 48 freq
dursleys - 5 freq
drizzled - 2 freq
draiglin - 1 freq
drowsily - 1 freq
MetaPhone code - TRKL
trigly - 6 freq
treacle - 24 freq
traicle - 11 freq
trickle - 6 freq
darkly - 3 freq
dracula - 4 freq
darkle - 1 freq
dairkly - 1 freq
darkley - 7 freq
direckly - 9 freq
treecle - 1 freq
triglie - 1 freq
treckle - 1 freq
derkly - 1 freq
drookle - 2 freq
derklie - 1 freq
triakil - 1 freq
daurkly - 1 freq
direcklie - 1 freq
draigle - 1 freq
torcuil - 4 freq
DROOKLE
Time to execute Levenshtein function - 0.181449 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.370498 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.027646 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.037320 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.000844 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.