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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
driv (0) - 12 freq
drive (1) - 170 freq
zriv (1) - 1 freq
riv (1) - 5 freq
dhriv (1) - 5 freq
criv (1) - 2 freq
div (1) - 506 freq
druv (1) - 1 freq
drip (1) - 12 freq
diz (2) - 55 freq
dim (2) - 51 freq
dib (2) - 1 freq
dyi (2) - 1 freq
eric (2) - 63 freq
dhrive (2) - 4 freq
iv (2) - 149 freq
dail (2) - 7 freq
derive (2) - 2 freq
rig (2) - 45 freq
dry (2) - 472 freq
darin (2) - 5 freq
dmin (2) - 1 freq
brig (2) - 266 freq
drew (2) - 194 freq
dic (2) - 1 freq
driv (0) - 12 freq
druv (1) - 1 freq
drive (1) - 170 freq
drove (2) - 68 freq
dreive (2) - 4 freq
derive (2) - 2 freq
drip (2) - 12 freq
drave (2) - 61 freq
dryve (2) - 2 freq
dhriv (2) - 5 freq
div (2) - 506 freq
zriv (2) - 1 freq
criv (2) - 2 freq
riv (2) - 5 freq
grv (3) - 1 freq
dorik (3) - 5 freq
diva (3) - 1 freq
drug (3) - 25 freq
drum (3) - 72 freq
drien (3) - 1 freq
rive (3) - 18 freq
drat (3) - 2 freq
drmo (3) - 3 freq
dreip (3) - 2 freq
dram (3) - 115 freq
SoundEx code - D610
drove - 68 freq
drap - 265 freq
drave - 61 freq
droap - 11 freq
drive - 170 freq
dryope - 1 freq
drappie - 17 freq
dreep - 26 freq
drop - 39 freq
'drap - 1 freq
droopy - 2 freq
drivewye - 1 freq
drab - 7 freq
driv - 12 freq
dryve - 2 freq
dry'v - 1 freq
droop - 2 freq
drip - 12 freq
dwarf - 3 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 - 170 freq
tirravee - 3 freq
trev - 73 freq
tirrivee - 10 freq
turravee - 4 freq
turf - 13 freq
trophie - 1 freq
driv - 12 freq
dryve - 2 freq
dry'v - 1 freq
turriff - 3 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
trhyf - 2 freq
hwdrioaf - 1 freq
drfw - 1 freq
'dreef' - 1 freq
DRIV
Time to execute Levenshtein function - 0.232843 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.355848 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.027382 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.038098 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.000871 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.