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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
goanabootbiddy (0) - 7 freq
naebiddy (7) - 32 freq
oanyboady (7) - 1 freq
gan-aboot (7) - 1 freq
oanybuddy (7) - 1 freq
onybiddy (7) - 8 freq
anabody (7) - 1 freq
aabiddy (7) - 1 freq
gadaboot (7) - 1 freq
roonaboots (7) - 3 freq
rounaboot (7) - 8 freq
rounaboots (7) - 1 freq
oanybody (7) - 1 freq
ootnaboot (7) - 1 freq
gaan-aboot (7) - 1 freq
roonaboot (7) - 17 freq
grabbid (8) - 3 freq
naebidy (8) - 14 freq
somebiddy (8) - 5 freq
janforindy (8) - 3 freq
meandbobbie (8) - 5 freq
roondaboots (8) - 4 freq
anybidy (8) - 1 freq
aroonaboot (8) - 1 freq
abiddy (8) - 28 freq
goanabootbiddy (0) - 7 freq
oanybuddy (10) - 1 freq
onybiddy (10) - 8 freq
naebiddy (10) - 32 freq
grabbid (11) - 3 freq
roonaboot (11) - 17 freq
gaan-aboot (11) - 1 freq
goonbob (11) - 1 freq
nobuddy (11) - 1 freq
ootnaboot (11) - 1 freq
naebuddy (11) - 3 freq
onybuddy (11) - 8 freq
anybuddy (11) - 1 freq
gadaboot (11) - 1 freq
gan-aboot (11) - 1 freq
anabody (11) - 1 freq
oanybody (11) - 1 freq
aabiddy (11) - 1 freq
oanyboady (11) - 1 freq
rounaboots (11) - 1 freq
rounaboot (11) - 8 freq
roonaboots (11) - 3 freq
anti-onybuddy (12) - 1 freq
gainstuid (12) - 1 freq
onyboady (12) - 1 freq
SoundEx code - G513
gaan-aboot - 1 freq
gaun-aboot - 2 freq
gumption - 12 freq
gan-aboot - 1 freq
gunpouder - 1 freq
gun-butts - 1 freq
gumptious - 1 freq
gunpooder - 3 freq
gunpowder - 1 freq
gambitman - 1 freq
goanabootbiddy - 7 freq
gameofthrones - 1 freq
gamebtw - 1 freq
gkmmabt - 1 freq
MetaPhone code - KNBTBT
goanabootbiddy - 7 freq
GOANABOOTBIDDY
Time to execute Levenshtein function - 0.358663 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.566016 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.040552 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.049775 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.001156 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.