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 ablow

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

Similar words to drappit in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
drappit (0) - 93 freq
drappie (1) - 17 freq
dappit (1) - 1 freq
vrappit (1) - 1 freq
droppit (1) - 1 freq
drapit (1) - 1 freq
drappin (1) - 67 freq
drappitd (1) - 1 freq
wrappit (1) - 10 freq
drapp't (1) - 1 freq
crappit (1) - 4 freq
drappet (1) - 5 freq
trappit (1) - 7 freq
drappt (1) - 25 freq
rappit (1) - 1 freq
drapping (2) - 3 freq
wappit (2) - 13 freq
clappit (2) - 45 freq
cappit (2) - 3 freq
droappt (2) - 1 freq
wrappt (2) - 2 freq
droappin (2) - 8 freq
gruppit (2) - 23 freq
cruppit (2) - 1 freq
crappin (2) - 11 freq
drappit (0) - 93 freq
drappet (1) - 5 freq
drappt (1) - 25 freq
droppit (1) - 1 freq
drippt (2) - 1 freq
droappt (2) - 1 freq
droppt (2) - 1 freq
rappit (2) - 1 freq
crappit (2) - 4 freq
trappit (2) - 7 freq
drappie (2) - 17 freq
dappit (2) - 1 freq
drapp't (2) - 1 freq
drapit (2) - 1 freq
drappin (2) - 67 freq
wrappit (2) - 10 freq
drappitd (2) - 1 freq
vrappit (2) - 1 freq
rippit (3) - 15 freq
drapoot (3) - 1 freq
dreipit (3) - 2 freq
dreepit (3) - 6 freq
drapt (3) - 35 freq
drappr (3) - 1 freq
grippit (3) - 58 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 - TRPT
drapped - 109 freq
droapped - 5 freq
droappt - 1 freq
drapt - 35 freq
draped - 16 freq
drappit - 93 freq
trapped - 24 freq
drappd - 2 freq
drappt - 25 freq
trooped - 4 freq
tripped - 15 freq
trippt - 1 freq
dreeped - 6 freq
trippit - 4 freq
dropped - 35 freq
drappet - 5 freq
draapet - 1 freq
trappet - 2 freq
trap't - 1 freq
drippt - 1 freq
droppit - 1 freq
torpedo - 2 freq
traepit - 2 freq
tripp't - 1 freq
dreipit - 2 freq
trippet - 1 freq
drapp't - 1 freq
trappit - 7 freq
dreepit - 6 freq
drap-oot - 1 freq
tripod - 1 freq
drapd - 1 freq
troupit - 2 freq
troopit - 1 freq
droppt - 1 freq
drooped - 1 freq
droaped - 1 freq
drapoot - 1 freq
dreipt - 1 freq
drapit - 1 freq
tripawd - 6 freq
DRAPPIT
Time to execute Levenshtein function - 0.235797 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.372622 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.027581 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.037032 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.000780 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.