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 ahint

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

Similar words to gleg-like in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
gleg-like (0) - 1 freq
gleyt-like (2) - 1 freq
gleglie (2) - 3 freq
gleghke (3) - 1 freq
gledlie (3) - 5 freq
meek-like (3) - 1 freq
taen-like (3) - 3 freq
gleg-ee (3) - 1 freq
gyte-like (3) - 1 freq
slaw-like (3) - 1 freq
cosy-like (4) - 2 freq
geeglin (4) - 7 freq
gleg-witted (4) - 1 freq
fluentlike (4) - 1 freq
pey-line (4) - 1 freq
roit-like (4) - 1 freq
blatelike (4) - 1 freq
wise-like (4) - 3 freq
warm-like (4) - 1 freq
bien-lyke (4) - 1 freq
-like (4) - 1 freq
gaelige (4) - 2 freq
ivy-like (4) - 1 freq
cult-like (4) - 1 freq
geggie (4) - 17 freq
gleg-like (0) - 1 freq
gleyt-like (3) - 1 freq
gleglie (4) - 3 freq
gleg-ee (5) - 1 freq
slaw-like (5) - 1 freq
gyte-like (5) - 1 freq
gleghke (5) - 1 freq
hulk-like (6) - 1 freq
cadgy-like (6) - 1 freq
blate-like (6) - 16 freq
cult-like (6) - 1 freq
radge-like (6) - 1 freq
gay-lik (6) - 1 freq
leaf-lik (6) - 1 freq
slaw-lik (6) - 1 freq
gah-lik (6) - 1 freq
ill-lik (6) - 1 freq
glegly (6) - 18 freq
ideal-like (6) - 1 freq
meek-like (6) - 1 freq
taen-like (6) - 3 freq
gledlie (6) - 5 freq
elegantlike (7) - 1 freq
lee-lane (7) - 6 freq
waa-like (7) - 1 freq
SoundEx code - G424
glegly - 18 freq
glegly-gabbit - 2 freq
glassily - 1 freq
gleglie - 3 freq
glessless - 1 freq
glacial - 2 freq
gallusly - 3 freq
gleg-like - 1 freq
galashiels - 7 freq
gallogly-swan - 2 freq
gallus-lik - 1 freq
gallowayglens - 3 freq
glasgowlangs - 9 freq
galgael - 1 freq
glasgowlib - 8 freq
glasgowlee - 1 freq
MetaPhone code - KLKLK
gleg-like - 1 freq
GLEG-LIKE
Time to execute Levenshtein function - 0.358278 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.507531 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.032598 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.044666 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.001007 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.