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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
fv (0) - 3 freq
fg (1) - 6 freq
xv (1) - 6 freq
ft (1) - 19 freq
fvy (1) - 1 freq
fs (1) - 3 freq
v (1) - 266 freq
hv (1) - 4 freq
fz (1) - 12 freq
fhv (1) - 1 freq
jv (1) - 2 freq
fvp (1) - 1 freq
fp (1) - 4 freq
fm (1) - 90 freq
pv (1) - 3 freq
fa (1) - 751 freq
fb (1) - 27 freq
fu (1) - 379 freq
kv (1) - 10 freq
f' (1) - 1 freq
rfv (1) - 1 freq
dv (1) - 5 freq
fl (1) - 3 freq
fj (1) - 2 freq
fav (1) - 7 freq
fv (0) - 3 freq
fvy (1) - 1 freq
fev (1) - 1 freq
fuv (1) - 1 freq
fav (1) - 7 freq
ff (2) - 7 freq
fd (2) - 3 freq
fe (2) - 10 freq
gv (2) - 11 freq
lv (2) - 6 freq
jfv (2) - 1 freq
wv (2) - 3 freq
fcv (2) - 1 freq
fvn (2) - 1 freq
fo (2) - 16 freq
rv (2) - 2 freq
fh (2) - 4 freq
iv (2) - 149 freq
yv (2) - 1 freq
vv (2) - 1 freq
fq (2) - 3 freq
qv (2) - 3 freq
fyve (2) - 8 freq
five (2) - 743 freq
fave (2) - 14 freq
SoundEx code - F000
fae - 9131 freq
fey - 14 freq
fou - 318 freq
faw - 148 freq
few - 844 freq
fu - 379 freq
foo - 753 freq
faa - 281 freq
fa - 751 freq
ff - 7 freq
f'ae - 1 freq
f'ah - 1 freq
fue - 1 freq
'foo - 11 freq
'fa - 7 freq
fyow - 50 freq
fyowe - 28 freq
fuyi - 2 freq
fo - 16 freq
fu' - 47 freq
fa' - 17 freq
fe - 10 freq
fi - 29 freq
'fae - 4 freq
f - 187 freq
fee - 41 freq
feow - 2 freq
fiew - 1 freq
fie - 3 freq
foo' - 3 freq
fay - 11 freq
fi' - 1 freq
fffffffffff - 1 freq
fffffffffffffff-fh - 1 freq
fiu - 2 freq
'fee - 3 freq
ffi - 1 freq
'f' - 4 freq
fea - 4 freq
fow - 2 freq
faee - 1 freq
fah - 9 freq
foy - 35 freq
fy - 7 freq
ïf - 93 freq
'faa - 3 freq
'fu - 1 freq
fiy - 1 freq
foe - 9 freq
faa' - 1 freq
fae' - 1 freq
fvow - 1 freq
fbi - 1 freq
fæ - 13 freq
faye - 7 freq
fiow - 1 freq
”f - 4 freq
'fou - 1 freq
f'ou - 1 freq
fu-aye - 1 freq
€˜foo - 1 freq
°f - 1 freq
€˜fa - 2 freq
fyew - 8 freq
€œfa - 2 freq
€œfoo - 13 freq
€˜f - 2 freq
€˜fae - 1 freq
'fae' - 1 freq
fyou - 1 freq
€™fy - 1 freq
fau - 1 freq
€œfaa - 1 freq
fb - 27 freq
fvp - 1 freq
fhe - 1 freq
fai - 2 freq
fpu - 1 freq
fvy - 1 freq
fii - 1 freq
foie - 4 freq
fw - 3 freq
fpf - 1 freq
fp - 4 freq
fbpe - 2 freq
fh - 4 freq
fv - 3 freq
feuy - 1 freq
fwe - 1 freq
fao - 20 freq
ffa - 2 freq
fyi - 1 freq
f' - 1 freq
MetaPhone code - FF
five - 743 freq
vieve - 14 freq
fou---fou - 1 freq
fife - 125 freq
veive - 6 freq
'five - 7 freq
fuff - 6 freq
feugh - 1 freq
fyve - 8 freq
fifa - 5 freq
fief - 1 freq
ve've - 1 freq
fffffffffffffff-fh - 1 freq
'viva - 1 freq
'fife - 1 freq
faff - 3 freq
fyvie - 5 freq
fvow - 1 freq
five-o - 1 freq
fuv - 1 freq
fave - 14 freq
veeve - 5 freq
fehv - 1 freq
viv - 1 freq
ghff - 1 freq
fiff - 1 freq
veev - 1 freq
vievie - 1 freq
fuffie - 1 freq
fyfe - 14 freq
€œfive - 2 freq
foefu - 1 freq
faif - 1 freq
€˜fuv - 1 freq
viva - 6 freq
faiv - 1 freq
“five - 1 freq
fvy - 1 freq
faaf - 1 freq
fhv - 1 freq
fav - 7 freq
fev - 1 freq
fv - 3 freq
vivi - 2 freq
vf - 1 freq
FV
Time to execute Levenshtein function - 0.181447 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.312335 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.027516 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.038014 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.004017 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.