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 drift in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
drift (0) - 53 freq
trift (1) - 1 freq
adrift (1) - 9 freq
draft (1) - 24 freq
drifts (1) - 20 freq
rift (1) - 12 freq
driet (1) - 2 freq
draint (2) - 5 freq
daft (2) - 436 freq
driften (2) - 1 freq
laift (2) - 1 freq
grit (2) - 25 freq
drifted (2) - 10 freq
trist (2) - 3 freq
driest (2) - 7 freq
drfw (2) - 1 freq
aift (2) - 14 freq
drink (2) - 548 freq
drill (2) - 51 freq
driv (2) - 12 freq
deft (2) - 4 freq
dreipt (2) - 1 freq
sift (2) - 6 freq
riff (2) - 1 freq
craft (2) - 62 freq
drift (0) - 53 freq
draft (1) - 24 freq
adrift (1) - 9 freq
driet (2) - 2 freq
rift (2) - 12 freq
trift (2) - 1 freq
drifts (2) - 20 freq
drf (3) - 1 freq
droit (3) - 1 freq
croft (3) - 52 freq
doft (3) - 1 freq
drat (3) - 2 freq
raft (3) - 10 freq
drite (3) - 1 freq
dairt (3) - 6 freq
serift (3) - 2 freq
drapt (3) - 35 freq
ruft (3) - 1 freq
dry't (3) - 2 freq
dafft (3) - 2 freq
driftin (3) - 23 freq
kroft (3) - 1 freq
craift (3) - 6 freq
driftit (3) - 9 freq
delft (3) - 2 freq
SoundEx code - D613
drapped - 109 freq
'driftin - 1 freq
droapped - 5 freq
droappt - 1 freq
drapt - 35 freq
driftin - 23 freq
drifted - 10 freq
draped - 16 freq
drift - 53 freq
drappit - 93 freq
drappd - 2 freq
drappt - 25 freq
derived - 12 freq
draft - 24 freq
drafts - 2 freq
drifts - 20 freq
dreeped - 6 freq
driftit - 9 freq
drovit - 1 freq
dropped - 35 freq
driftin' - 2 freq
drappet - 5 freq
draapet - 1 freq
driften - 1 freq
drifters - 3 freq
drifter - 2 freq
drippt - 1 freq
droppit - 1 freq
drip-feed - 1 freq
draftit - 4 freq
drap-doun - 3 freq
driftwid - 4 freq
driftan - 5 freq
drappitd - 1 freq
drifting - 1 freq
dreipit - 2 freq
derivations - 2 freq
derivational - 6 freq
drafted - 1 freq
drapp't - 1 freq
dreepit - 6 freq
drap-oot - 1 freq
derivative - 3 freq
drap-oots - 1 freq
dreep-doun - 1 freq
drapd - 1 freq
drive-thru - 1 freq
derivation - 2 freq
draftin - 1 freq
droppt - 1 freq
drooped - 1 freq
droaped - 1 freq
drapoot - 1 freq
dreipt - 1 freq
dervtn - 1 freq
drapit - 1 freq
drappitday - 1 freq
dervheid - 2 freq
driftwood - 1 freq
MetaPhone code - TRFT
terrifee'd - 3 freq
drift - 53 freq
terrified - 27 freq
derived - 12 freq
draft - 24 freq
turraveed - 2 freq
terrifeet - 2 freq
draught - 6 freq
drought - 4 freq
terrifeed - 10 freq
draughty - 1 freq
drovit - 1 freq
turfed - 7 freq
terrafeet - 1 freq
terrifiet - 1 freq
trivit - 1 freq
trift - 1 freq
trftw - 1 freq
DRIFT
Time to execute Levenshtein function - 0.293377 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.591269 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.073147 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.036646 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.000785 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.