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 haw-buss in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
haw-buss (0) - 1 freq
gawjuss (3) - 3 freq
han-less (3) - 1 freq
haleness (4) - 1 freq
hairbrush (4) - 3 freq
jaw-box (4) - 3 freq
baw-bee's (4) - 1 freq
bawbags (4) - 2 freq
halpless (4) - 1 freq
het-houss (4) - 1 freq
hauds (4) - 123 freq
buss (4) - 34 freq
hawes (4) - 2 freq
awpliss (4) - 1 freq
harkness (4) - 2 freq
albus (4) - 4 freq
harbours (4) - 2 freq
hameless (4) - 17 freq
handbags (4) - 2 freq
bauss (4) - 1 freq
harrouis (4) - 1 freq
rambust (4) - 1 freq
awbudy (4) - 6 freq
faw-back (4) - 2 freq
hawkins (4) - 3 freq
haw-buss (0) - 1 freq
han-less (5) - 1 freq
het-houss (6) - 1 freq
ex-boss (6) - 1 freq
baw-bee's (6) - 1 freq
howpless (6) - 5 freq
gawjuss (6) - 3 freq
hawkes (7) - 2 freq
wee-ness (7) - 1 freq
haimless (7) - 1 freq
at-best (7) - 1 freq
saw-dist (7) - 1 freq
whin-bush (7) - 1 freq
aw-weys (7) - 1 freq
harass (7) - 2 freq
jaw-bane (7) - 1 freq
bawbees (7) - 23 freq
handless (7) - 3 freq
habits (7) - 23 freq
bawbaws (7) - 1 freq
lawbors (7) - 1 freq
tay-bags (7) - 2 freq
habitus (7) - 1 freq
harness (7) - 14 freq
abyss (7) - 11 freq
SoundEx code - H120
hippos - 1 freq
huifs - 7 freq
haps - 33 freq
hopes - 39 freq
hoops - 19 freq
howps - 30 freq
hips - 32 freq
howfs - 6 freq
heavies - 5 freq
heaves - 2 freq
heaps - 13 freq
hobbies - 8 freq
howffs - 5 freq
hooves - 21 freq
hubs - 3 freq
huffs - 2 freq
heips - 2 freq
huives - 1 freq
heep's - 1 freq
haufs - 5 freq
habbie's - 2 freq
happs - 2 freq
hibees - 11 freq
hibs - 45 freq
happeq - 1 freq
hops - 2 freq
hapes - 1 freq
hoofs - 8 freq
haufwyes - 2 freq
haufwyeg - 1 freq
hypsaea - 1 freq
happy's - 2 freq
haw-buss - 1 freq
hubby's - 1 freq
hopps - 1 freq
hauf-wyes - 1 freq
haeps - 4 freq
havoc - 6 freq
howpes - 1 freq
houps - 1 freq
houffs - 1 freq
haips - 1 freq
hbk - 1 freq
'habeas - 1 freq
hub's - 1 freq
haufweys - 1 freq
haaf's - 1 freq
hippies - 6 freq
heeps - 1 freq
€œhoops - 1 freq
haafwyes - 1 freq
hfq - 1 freq
hibsÂ’ - 1 freq
heivies - 1 freq
hbxj - 1 freq
hoffice - 1 freq
hives” - 2 freq
hives - 2 freq
heubeck - 1 freq
hfz - 1 freq
hebcu - 1 freq
huvvsz - 1 freq
hbpwhx - 1 freq
hps - 1 freq
hovesj - 1 freq
hubbys - 1 freq
hobk - 1 freq
hbbs - 1 freq
MetaPhone code - HBS
hobbies - 8 freq
hubs - 3 freq
habbie's - 2 freq
hibees - 11 freq
hibs - 45 freq
haw-buss - 1 freq
hubby's - 1 freq
'habeas - 1 freq
hub's - 1 freq
hibsÂ’ - 1 freq
hubbys - 1 freq
HAW-BUSS
Time to execute Levenshtein function - 0.195887 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.401292 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.029560 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.042136 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.000977 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.