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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
dzf (0) - 1 freq
dzd (1) - 1 freq
def (1) - 4 freq
drf (1) - 1 freq
dz (1) - 3 freq
df (1) - 2 freq
dof (1) - 1 freq
szf (1) - 1 freq
dze (1) - 1 freq
zf (1) - 2 freq
dif (1) - 2 freq
dac (2) - 1 freq
doy (2) - 1 freq
daz (2) - 1 freq
dsi (2) - 1 freq
dcc (2) - 1 freq
alf (2) - 7 freq
dl (2) - 2 freq
lef (2) - 7 freq
aif (2) - 6 freq
d' (2) - 3 freq
dug (2) - 576 freq
sze (2) - 1 freq
dr (2) - 199 freq
jzq (2) - 1 freq
dzf (0) - 1 freq
szf (2) - 1 freq
dze (2) - 1 freq
zf (2) - 2 freq
dof (2) - 1 freq
dif (2) - 2 freq
dzd (2) - 1 freq
df (2) - 2 freq
def (2) - 4 freq
dz (2) - 3 freq
drf (2) - 1 freq
dozy (3) - 10 freq
deif (3) - 28 freq
daef (3) - 1 freq
doof (3) - 1 freq
diff (3) - 2 freq
adjf (3) - 1 freq
zif (3) - 13 freq
derf (3) - 2 freq
zfe (3) - 1 freq
deef (3) - 43 freq
duff (3) - 24 freq
doze (3) - 10 freq
daff (3) - 5 freq
daze (3) - 7 freq
SoundEx code - D210
disobey - 5 freq
dickiebow - 1 freq
day-joab - 1 freq
deceive - 7 freq
dough-baw - 1 freq
doughbaw - 1 freq
dug-up - 1 freq
digby - 3 freq
disavou - 1 freq
dookie-up - 1 freq
dug-shape - 2 freq
dqgeyv - 1 freq
dzf - 1 freq
doxievee - 1 freq
deejaypb - 3 freq
dqb - 1 freq
djgfyh - 1 freq
dtaqzbu - 1 freq
dyjvb - 1 freq
dsp - 1 freq
dickybeau - 1 freq
dogpoo - 1 freq
dyqpo - 1 freq
dczhhb - 2 freq
dcibw - 1 freq
decaf - 1 freq
dxpa - 1 freq
MetaPhone code - TSF
tasefu' - 1 freq
deceive - 7 freq
tassiefu - 3 freq
disavou - 1 freq
dzf - 1 freq
DZF
Time to execute Levenshtein function - 0.212816 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.364040 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.039353 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.040059 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.000928 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.