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 ablow

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to ghaistly in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ghaistly (0) - 13 freq
ghastly (1) - 3 freq
gaistly (1) - 1 freq
graisly (2) - 1 freq
ghaistie (2) - 1 freq
maistly (2) - 226 freq
ghaist (2) - 60 freq
ghaistit (2) - 1 freq
ghostly (2) - 16 freq
ghaists (2) - 48 freq
laistly (2) - 2 freq
ghaistlie (2) - 1 freq
'maistly (2) - 1 freq
haist (3) - 5 freq
garishly (3) - 1 freq
haistie (3) - 1 freq
chaist (3) - 3 freq
glaidly (3) - 2 freq
hairty (3) - 3 freq
ghousty (3) - 1 freq
gaists (3) - 1 freq
maestly (3) - 5 freq
glaister (3) - 2 freq
hairdly (3) - 55 freq
shairply (3) - 15 freq
ghaistly (0) - 13 freq
ghastly (1) - 3 freq
ghaistlie (2) - 1 freq
ghostly (2) - 16 freq
gaistly (2) - 1 freq
ghaistit (3) - 1 freq
ghaists (3) - 48 freq
ghaistie (3) - 1 freq
ghaist (3) - 60 freq
ghosty (4) - 1 freq
ghostey (4) - 1 freq
thistley (4) - 1 freq
ghaistlike (4) - 1 freq
heistely (4) - 1 freq
hastily (4) - 22 freq
gristle (4) - 3 freq
ghousty (4) - 1 freq
thistle (4) - 48 freq
whistle (4) - 54 freq
ghaisties (4) - 6 freq
'maistly (4) - 1 freq
maistly (4) - 226 freq
laistly (4) - 2 freq
graisly (4) - 1 freq
ghaist-lik (5) - 1 freq
SoundEx code - G234
ghaistlike - 1 freq
ghaistlie - 1 freq
ghaist-lik - 1 freq
ghostly - 16 freq
ghastly - 3 freq
ghaistly - 13 freq
gaistly - 1 freq
guestlandlord - 1 freq
goeastlothian - 1 freq
MetaPhone code - FSTL
ghaistlie - 1 freq
fustle - 3 freq
vastly - 3 freq
ghostly - 16 freq
ghastly - 3 freq
ghaistly - 13 freq
festool - 2 freq
GHAISTLY
Time to execute Levenshtein function - 0.203842 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.367920 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.027407 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.048217 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.001162 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.