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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
bhp (0) - 1 freq
bdp (1) - 1 freq
bhe (1) - 1 freq
bnp (1) - 1 freq
yhp (1) - 1 freq
bcp (1) - 1 freq
hp (1) - 3 freq
ohp (1) - 1 freq
btp (1) - 1 freq
bh (1) - 13 freq
bxp (1) - 1 freq
php (1) - 1 freq
bap (1) - 16 freq
bp (1) - 8 freq
shp (1) - 1 freq
kp (2) - 6 freq
shu (2) - 10 freq
thn (2) - 1 freq
phb (2) - 1 freq
bae (2) - 855 freq
blip (2) - 4 freq
klp (2) - 1 freq
nhx (2) - 1 freq
bay (2) - 80 freq
qhpm (2) - 1 freq
bhp (0) - 1 freq
bxp (2) - 1 freq
bh (2) - 13 freq
php (2) - 1 freq
bp (2) - 8 freq
shp (2) - 1 freq
btp (2) - 1 freq
bap (2) - 16 freq
bhe (2) - 1 freq
ohp (2) - 1 freq
bdp (2) - 1 freq
bnp (2) - 1 freq
hp (2) - 3 freq
bcp (2) - 1 freq
yhp (2) - 1 freq
bapu (3) - 14 freq
buh (3) - 3 freq
ship (3) - 186 freq
hip (3) - 32 freq
bump (3) - 23 freq
whap (3) - 2 freq
chop (3) - 25 freq
obh (3) - 2 freq
burp (3) - 9 freq
bah (3) - 4 freq
SoundEx code - B100
bob - 213 freq
bowff - 1 freq
bobby - 45 freq
boab - 53 freq
baby - 117 freq
babe - 11 freq
babbie - 34 freq
bevie - 2 freq
boof - 3 freq
boeuf - 1 freq
beef - 79 freq
bobbie - 15 freq
bib - 8 freq
babby - 25 freq
bawbee - 23 freq
babie - 1 freq
bowf - 9 freq
boabby - 23 freq
befaw - 3 freq
beefie - 1 freq
bevvy - 18 freq
befa - 2 freq
baba - 2 freq
baffy - 3 freq
bye-bye - 1 freq
behave - 37 freq
befaa - 6 freq
bappie - 1 freq
bap - 16 freq
baff - 3 freq
bihaive - 1 freq
byfe - 1 freq
bab - 13 freq
baffie - 62 freq
beehive - 1 freq
buff - 15 freq
beef' - 1 freq
behauf - 17 freq
beeb' - 1 freq
bewvy - 2 freq
baabie - 21 freq
bubba - 1 freq
boaby - 5 freq
bafhe - 2 freq
baffe - 2 freq
bafhie - 2 freq
boob - 5 freq
bibby - 3 freq
bevy - 5 freq
bauf - 1 freq
baby' - 1 freq
booby - 9 freq
bobo - 9 freq
behaiv - 1 freq
baby-e - 1 freq
bebe - 3 freq
bevvie - 2 freq
bouff - 1 freq
behouf - 1 freq
'bib - 1 freq
beif - 2 freq
bappy - 27 freq
behufe - 1 freq
beep - 9 freq
'babe' - 1 freq
beve - 1 freq
beb - 1 freq
bawbee- - 2 freq
bapu - 14 freq
€œbapu - 1 freq
baw-bee - 1 freq
baef - 6 freq
boabie - 2 freq
boba - 2 freq
biffy - 1 freq
bev - 1 freq
baf - 1 freq
bebo - 1 freq
bhheypya - 1 freq
bhp - 1 freq
biffo - 2 freq
beeb - 1 freq
baif - 4 freq
bpub - 1 freq
bwv - 1 freq
befio - 1 freq
byf - 1 freq
bufw - 1 freq
bov - 1 freq
bovvy - 2 freq
MetaPhone code - BP
bappie - 1 freq
bap - 16 freq
bp - 8 freq
bappy - 27 freq
beep - 9 freq
bapu - 14 freq
€œbapu - 1 freq
bhp - 1 freq
BHP
Time to execute Levenshtein function - 0.258959 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.382382 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.028898 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.048092 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.001151 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.