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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
butter (0) - 134 freq
buttir (1) - 2 freq
buttery (1) - 24 freq
batter (1) - 74 freq
bunter (1) - 8 freq
cutter (1) - 5 freq
butler (1) - 8 freq
buster (1) - 2 freq
gutter (1) - 33 freq
better (1) - 1704 freq
nutter (1) - 6 freq
butted (1) - 5 freq
mutter (1) - 10 freq
putter (1) - 1 freq
bitter (1) - 112 freq
buttert (1) - 7 freq
buttet (1) - 6 freq
buther (1) - 11 freq
utter (1) - 63 freq
batten (2) - 1 freq
duster (2) - 12 freq
buttered (2) - 19 freq
wetter (2) - 4 freq
button (2) - 92 freq
bummer (2) - 21 freq
butter (0) - 134 freq
better (1) - 1704 freq
batter (1) - 74 freq
bitter (1) - 112 freq
buttir (1) - 2 freq
buttery (1) - 24 freq
buttet (2) - 6 freq
utter (2) - 63 freq
buther (2) - 11 freq
battur (2) - 1 freq
bettur (2) - 3 freq
battery (2) - 25 freq
butterie (2) - 7 freq
buttert (2) - 7 freq
baitter (2) - 1 freq
bettir (2) - 12 freq
butler (2) - 8 freq
nutter (2) - 6 freq
cutter (2) - 5 freq
gutter (2) - 33 freq
bunter (2) - 8 freq
buster (2) - 2 freq
butted (2) - 5 freq
mutter (2) - 10 freq
putter (2) - 1 freq
SoundEx code - B360
bother - 329 freq
better - 1704 freq
bitter - 112 freq
batter - 74 freq
butter - 134 freq
'better - 9 freq
bather - 59 freq
baitur - 4 freq
baiturr - 1 freq
baither - 2 freq
badder - 5 freq
battery - 25 freq
betray - 10 freq
bator - 1 freq
buther - 11 freq
baitter - 1 freq
biter - 1 freq
batthrie - 1 freq
bettér - 4 freq
bittér - 1 freq
butterie - 7 freq
bathir - 2 freq
biether - 1 freq
'butterie' - 1 freq
bettèr - 32 freq
bethray - 2 freq
boather - 5 freq
boathir - 3 freq
better' - 3 freq
budder - 47 freq
bither - 12 freq
bettir - 12 freq
betther - 18 freq
bowder - 1 freq
battur - 1 freq
bettur - 3 freq
be-etter - 2 freq
be-e-e-etter - 1 freq
betaware - 1 freq
€˜betaware - 1 freq
buttery - 24 freq
buttir - 2 freq
bidder - 1 freq
beter - 1 freq
byde-ower - 1 freq
behauder - 2 freq
boathur - 1 freq
buddir - 3 freq
beater - 11 freq
buttrie - 4 freq
b-u-tt-r-ie - 1 freq
betterÂ’ - 1 freq
betterawa - 3 freq
“better - 1 freq
MetaPhone code - BTR
better - 1704 freq
bitter - 112 freq
batter - 74 freq
butter - 134 freq
'better - 9 freq
baitur - 4 freq
baiturr - 1 freq
badder - 5 freq
battery - 25 freq
betray - 10 freq
bator - 1 freq
baitter - 1 freq
biter - 1 freq
batthrie - 1 freq
bettér - 4 freq
bittér - 1 freq
butterie - 7 freq
'butterie' - 1 freq
bettèr - 32 freq
better' - 3 freq
budder - 47 freq
bettir - 12 freq
betther - 18 freq
bowder - 1 freq
battur - 1 freq
bettur - 3 freq
be-etter - 2 freq
be-e-e-etter - 1 freq
buttery - 24 freq
buttir - 2 freq
bidder - 1 freq
beter - 1 freq
buddir - 3 freq
beater - 11 freq
buttrie - 4 freq
b-u-tt-r-ie - 1 freq
betterÂ’ - 1 freq
“better - 1 freq
BUTTER
Time to execute Levenshtein function - 0.221348 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.408732 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.028341 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.040985 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.000860 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.