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 sonsie

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

Similar words to driv in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
driv (0) - 12 freq
druv (1) - 1 freq
criv (1) - 2 freq
drive (1) - 167 freq
riv (1) - 5 freq
drip (1) - 11 freq
zriv (1) - 1 freq
div (1) - 506 freq
dhriv (1) - 5 freq
dv (2) - 5 freq
dring (2) - 1 freq
trim (2) - 15 freq
crit (2) - 1 freq
dsi (2) - 1 freq
brij (2) - 3 freq
trig (2) - 41 freq
dreip (2) - 2 freq
drain (2) - 30 freq
drf (2) - 1 freq
deir (2) - 7 freq
draig (2) - 2 freq
yiv (2) - 59 freq
thiv (2) - 19 freq
draim (2) - 5 freq
driver (2) - 89 freq
driv (0) - 12 freq
druv (1) - 1 freq
drive (1) - 167 freq
derive (2) - 2 freq
drove (2) - 68 freq
dreive (2) - 4 freq
drave (2) - 61 freq
dryve (2) - 2 freq
dhriv (2) - 5 freq
drip (2) - 11 freq
riv (2) - 5 freq
criv (2) - 2 freq
zriv (2) - 1 freq
div (2) - 506 freq
droo (3) - 1 freq
durie (3) - 1 freq
droit (3) - 1 freq
drl (3) - 12 freq
brev (3) - 31 freq
daev (3) - 10 freq
druid (3) - 2 freq
dutv (3) - 2 freq
driet (3) - 2 freq
drug (3) - 23 freq
dhrive (3) - 4 freq
SoundEx code - D610
drove - 68 freq
drap - 262 freq
drave - 61 freq
droap - 11 freq
drive - 167 freq
dryope - 1 freq
drappie - 17 freq
dreep - 25 freq
drop - 37 freq
'drap - 1 freq
droopy - 2 freq
drivewye - 1 freq
drab - 7 freq
driv - 12 freq
dryve - 2 freq
dry'v - 1 freq
droop - 1 freq
dwarf - 3 freq
drip - 11 freq
derby - 13 freq
drehve - 1 freq
derf - 2 freq
dreef - 4 freq
driveway - 8 freq
dræv - 2 freq
dhrive - 4 freq
dhriv - 5 freq
drehv - 1 freq
derbie - 2 freq
'derby - 1 freq
droppy - 1 freq
derive - 2 freq
dryhope - 2 freq
drape - 1 freq
€˜drappie - 1 freq
€œdrive - 1 freq
dreip - 2 freq
dreive - 4 freq
€œdrop - 1 freq
€˜driveway - 1 freq
druv - 1 freq
drf - 1 freq
drippy - 1 freq
drfw - 1 freq
dearbh - 1 freq
'dreef' - 1 freq
MetaPhone code - TRF
drove - 68 freq
trivia - 2 freq
drave - 61 freq
drive - 167 freq
tirravee - 2 freq
trev - 73 freq
tirrivee - 10 freq
turravee - 4 freq
turf - 12 freq
trophie - 1 freq
driv - 12 freq
dryve - 2 freq
dry'v - 1 freq
trough - 6 freq
trophy - 15 freq
drehve - 1 freq
tirivee - 3 freq
tyrefu - 1 freq
tirrivie - 4 freq
derf - 2 freq
tarf - 1 freq
dreef - 4 freq
dræv - 2 freq
trawphy - 1 freq
dhrive - 4 freq
dhriv - 5 freq
drehv - 1 freq
derive - 2 freq
trive - 1 freq
tryve - 1 freq
€œtrev - 1 freq
terrify - 1 freq
€œdrive - 1 freq
dreive - 4 freq
trove - 3 freq
druv - 1 freq
drf - 1 freq
turriff - 1 freq
trhyf - 2 freq
hwdrioaf - 1 freq
drfw - 1 freq
'dreef' - 1 freq
DRIV
Time to execute Levenshtein function - 0.811697 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.830306 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.071831 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.088688 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.001024 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.