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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
boddam (0) - 23 freq
boddim (1) - 31 freq
boddom (1) - 39 freq
boddem (1) - 1 freq
boddum (1) - 1 freq
bedlam (2) - 6 freq
botham (2) - 1 freq
boddie (2) - 2 freq
boddy (2) - 7 freq
noddan (2) - 1 freq
loddan (2) - 1 freq
buddan (2) - 1 freq
beddal (2) - 4 freq
buddum (2) - 3 freq
saddam (2) - 1 freq
bottam (2) - 3 freq
buddom (2) - 5 freq
soddan (2) - 1 freq
condom (3) - 1 freq
baddy (3) - 1 freq
buddh (3) - 1 freq
modal (3) - 7 freq
bord (3) - 2 freq
body's (3) - 26 freq
badd (3) - 1 freq
boddam (0) - 23 freq
boddem (1) - 1 freq
boddum (1) - 1 freq
boddom (1) - 39 freq
boddim (1) - 31 freq
buddum (2) - 3 freq
buddom (2) - 5 freq
buddan (3) - 1 freq
saddam (3) - 1 freq
beddal (3) - 4 freq
bedlam (3) - 6 freq
boddie (3) - 2 freq
boddy (3) - 7 freq
boddimer (4) - 1 freq
beddis (4) - 1 freq
faddom (4) - 8 freq
buddoo (4) - 1 freq
fuddim (4) - 1 freq
buddir (4) - 3 freq
buddy (4) - 56 freq
bidden (4) - 36 freq
bdfm (4) - 17 freq
buddoms (4) - 1 freq
bedded (4) - 8 freq
buddin (4) - 11 freq
SoundEx code - B350
beaten - 20 freq
bottom - 161 freq
but-in - 1 freq
bidin - 201 freq
biddin - 30 freq
batein - 2 freq
bydie-in - 1 freq
button - 92 freq
bedtime - 17 freq
beatin - 34 freq
bitin - 27 freq
boattom - 10 freq
beheidin - 3 freq
between - 192 freq
boddom - 39 freq
bettin - 12 freq
bedien - 1 freq
bidden - 36 freq
bydin - 21 freq
behauden - 6 freq
buttin - 6 freq
boddam - 23 freq
bidie-in - 7 freq
boddum - 1 freq
beddin - 16 freq
bathin - 11 freq
bidein - 6 freq
bedouin - 1 freq
buddin - 11 freq
bottam - 3 freq
boddim - 31 freq
bottem - 1 freq
beiyden - 1 freq
beyden - 1 freq
bidin' - 3 freq
boattum - 4 freq
bitween - 2 freq
bitne - 1 freq
battin - 1 freq
botton - 1 freq
botany - 3 freq
'bottom - 1 freq
bite-in - 1 freq
bitten - 7 freq
baetin - 4 freq
baetween - 4 freq
beaton - 35 freq
bïddin - 1 freq
bethanie - 2 freq
batin - 4 freq
bodine - 1 freq
bataan' - 1 freq
bot'ny - 2 freq
bethany - 3 freq
buddom - 5 freq
bidan - 9 freq
baeteen - 1 freq
buddan - 1 freq
beeteen - 1 freq
bedume-' - 1 freq
buddum - 3 freq
bitan - 1 freq
baetan - 1 freq
batten - 1 freq
beatan - 3 freq
beheidan - 1 freq
behudden - 1 freq
bydan - 1 freq
bedeen - 1 freq
bodin - 1 freq
by-time - 2 freq
bedene - 2 freq
bytwene - 1 freq
€˜byttyne - 1 freq
bedein - 2 freq
behaudin - 3 freq
bowtin - 1 freq
boddem - 1 freq
baton - 3 freq
bootin - 2 freq
boatin - 1 freq
bed-time - 1 freq
bethan - 1 freq
byde-in - 1 freq
biden - 9 freq
bhutan - 1 freq
baidan - 1 freq
buidin - 1 freq
bowdin - 1 freq
botham - 1 freq
baitin - 1 freq
beatinÂ’ - 1 freq
MetaPhone code - BTM
bottom - 161 freq
boattom - 10 freq
boddom - 39 freq
boddam - 23 freq
boddum - 1 freq
bottam - 3 freq
boddim - 31 freq
bottem - 1 freq
boattum - 4 freq
'bottom - 1 freq
buddom - 5 freq
bedume-' - 1 freq
buddum - 3 freq
by-time - 2 freq
boddem - 1 freq
BODDAM
Time to execute Levenshtein function - 0.199151 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.339841 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.027650 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.036791 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.000957 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.