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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
happiness (0) - 56 freq
happinesses (2) - 1 freq
happienes (2) - 3 freq
happiest (2) - 10 freq
hardiness (2) - 2 freq
haliness (2) - 2 freq
happinen (2) - 1 freq
happins (2) - 3 freq
happin (3) - 16 freq
apenness (3) - 2 freq
hippies (3) - 6 freq
oagliness (3) - 1 freq
yappins (3) - 1 freq
happenins (3) - 10 freq
nappies (3) - 9 freq
haines (3) - 1 freq
happier (3) - 18 freq
laziness (3) - 1 freq
cappies (3) - 1 freq
randiness (3) - 1 freq
hapless (3) - 11 freq
happened (3) - 445 freq
sappiest (3) - 2 freq
cantiness (3) - 2 freq
nastiness (3) - 1 freq
happiness (0) - 56 freq
happins (3) - 3 freq
happienes (3) - 3 freq
happinesses (3) - 1 freq
happenins (4) - 10 freq
happeneens (4) - 2 freq
happneens (4) - 1 freq
happens (4) - 204 freq
hoppless (4) - 1 freq
haliness (4) - 2 freq
happiest (4) - 10 freq
happinen (4) - 1 freq
hardiness (4) - 2 freq
hippins (4) - 3 freq
grippiness (5) - 1 freq
happenen (5) - 2 freq
halpless (5) - 1 freq
harness (5) - 14 freq
holiness (5) - 1 freq
hameliness (5) - 1 freq
wappins (5) - 5 freq
sharpness (5) - 3 freq
happint (5) - 15 freq
hippens (5) - 5 freq
heppens (5) - 4 freq
SoundEx code - H152
happens - 204 freq
heivens - 19 freq
heiven's - 5 freq
happiness - 56 freq
hivvens - 14 freq
having - 59 freq
hauf-angert - 1 freq
hauf-fancied - 1 freq
'hivvens - 1 freq
heaven's - 6 freq
heaven-sent - 3 freq
heivins - 2 freq
haevins - 1 freq
havins - 1 freq
hauf-masked - 1 freq
heavens - 18 freq
hoping - 31 freq
hivvans - 2 freq
hypnosis - 3 freq
hauf-hingit - 1 freq
hvammsford - 2 freq
havns - 1 freq
heivens'll - 1 freq
hauf-misglimmit - 1 freq
hippens - 5 freq
huving - 1 freq
heaviness - 2 freq
hauf-nyaakit - 1 freq
hauf-mast - 3 freq
heppens - 4 freq
heivenis - 1 freq
haiven's - 1 freq
haivens - 2 freq
happence - 1 freq
hauf-naukit - 2 freq
hauf-inched - 2 freq
heevens - 16 freq
happinesses - 1 freq
ha''pnies - 1 freq
'having - 1 freq
hipbones - 1 freq
happienes - 3 freq
heevins - 4 freq
havens - 1 freq
hippins - 3 freq
hievins - 1 freq
haippens - 2 freq
hevins - 1 freq
happenchance - 2 freq
hiving - 1 freq
ha'pennies - 1 freq
happing - 1 freq
houping - 1 freq
hauf-uncle - 1 freq
hievens - 4 freq
happins - 3 freq
houbinsaeter - 1 freq
hauf-meisur - 1 freq
hapens - 1 freq
hoofing - 8 freq
heving - 1 freq
hoofnest - 1 freq
huffingtonpost - 1 freq
hboywmznje - 1 freq
heefins - 1 freq
heaving - 1 freq
MetaPhone code - HPNS
happens - 204 freq
happiness - 56 freq
hippens - 5 freq
heppens - 4 freq
happence - 1 freq
ha''pnies - 1 freq
happienes - 3 freq
hippins - 3 freq
haippens - 2 freq
ha'pennies - 1 freq
happins - 3 freq
hapens - 1 freq
HAPPINESS
happy - 755 freq
happiness - 56 freq
happier - 18 freq
Time to execute Levenshtein function - 0.238250 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.464520 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.030420 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.040837 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.000920 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.