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 hert-likin in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
hert-likin (0) - 4 freq
hert-liftin (2) - 1 freq
hairt-likin (2) - 1 freq
hert-heisin (3) - 1 freq
hert-line (3) - 1 freq
hertruggin (4) - 1 freq
herriein (4) - 1 freq
hert-brekkin (4) - 2 freq
heraldin (4) - 1 freq
hert-sten (4) - 1 freq
hertbraken (4) - 1 freq
erse-lickin (4) - 1 freq
weel-likit (4) - 1 freq
helt-gien (4) - 1 freq
hert-seik (4) - 2 freq
oerthinkin (4) - 1 freq
hert-lazy (4) - 3 freq
herkin (4) - 3 freq
hert-rendin (4) - 2 freq
hauf-likit (4) - 1 freq
feart-like (4) - 1 freq
hert-ill (4) - 1 freq
hertnin (4) - 6 freq
hertlan (4) - 1 freq
weel-luikin (4) - 1 freq
hert-likin (0) - 4 freq
hairt-likin (2) - 1 freq
hert-line (4) - 1 freq
hert-liftin (4) - 1 freq
hert-heisin (5) - 1 freq
hairt-liftin (6) - 1 freq
hert-lazy (6) - 3 freq
hertfeelin (6) - 1 freq
daft-luikin (6) - 1 freq
hurtlin (6) - 9 freq
hertlan (6) - 1 freq
hert-seik (6) - 2 freq
hert-ill (6) - 1 freq
feart-like (6) - 1 freq
hert-heezin (6) - 1 freq
ower-luikin (6) - 1 freq
hert-sten (6) - 1 freq
hertbraken (6) - 1 freq
weird-luikin (6) - 1 freq
hert-warmin (7) - 1 freq
tent-like (7) - 1 freq
hard-wirkin (7) - 5 freq
hert-ruggin (7) - 1 freq
hertenin (7) - 8 freq
hert-seek (7) - 1 freq
SoundEx code - H634
haurdly - 62 freq
hardly - 215 freq
hairdly - 55 freq
herdly - 18 freq
hurdle - 3 freq
hert-likin - 4 freq
hurtlin - 9 freq
hurriedly - 5 freq
hertless - 11 freq
haurdlie - 9 freq
herd-laddie-an - 1 freq
hertilie - 1 freq
hardhill - 2 freq
hairtll - 1 freq
heartless - 6 freq
hordly - 1 freq
hurtle - 3 freq
hurdlin - 1 freq
hairt-liftin - 1 freq
hurdles - 1 freq
hurdlit - 1 freq
hart'll - 2 freq
hurtled - 3 freq
hairt'il - 1 freq
hardliners - 1 freq
hert-lazy - 3 freq
hert-laziness - 1 freq
hertlands - 2 freq
hairdlie - 2 freq
haird-lukkin - 1 freq
hertlans - 1 freq
hertlan - 1 freq
hairdly-human - 1 freq
'hardly - 1 freq
hert-line - 1 freq
hairtlan - 5 freq
hairtlans - 3 freq
hert-ill - 1 freq
hertholl - 2 freq
hert-holl - 5 freq
hairt'll - 1 freq
hairt-likin - 1 freq
hertily - 2 freq
hertland - 3 freq
heartland - 1 freq
hairtless - 2 freq
hert-liftin - 1 freq
hairtlands - 1 freq
hertlaunds - 1 freq
heartlands - 2 freq
haardly - 1 freq
herd-laddie - 1 freq
heir-at-law - 2 freq
hairtland - 1 freq
haurdlies - 1 freq
hertlauns - 2 freq
heardle - 5 freq
MetaPhone code - HRTLKN
hert-likin - 4 freq
haird-lukkin - 1 freq
hairt-likin - 1 freq
HERT-LIKIN
Time to execute Levenshtein function - 0.475767 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.871873 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.036531 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.079424 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.000921 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.