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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
enogh (0) - 20 freq
enosh (1) - 3 freq
enoch (1) - 17 freq
enugh (1) - 2 freq
enough (1) - 911 freq
enjogh (1) - 1 freq
eneugh (2) - 49 freq
nigh (2) - 18 freq
enh (2) - 1 freq
enuch (2) - 89 freq
enorm (2) - 11 freq
enow (2) - 5 freq
'enough (2) - 1 freq
engy (2) - 2 freq
eng (2) - 10 freq
eneoch (2) - 2 freq
enof (2) - 5 freq
enou (2) - 1 freq
noch (2) - 2 freq
emosh (2) - 1 freq
logh (2) - 1 freq
anagh (2) - 1 freq
noght (2) - 1 freq
keogh (2) - 1 freq
enow' (2) - 2 freq
enogh (0) - 20 freq
enough (1) - 911 freq
enugh (1) - 2 freq
anagh (2) - 1 freq
eneugh (2) - 49 freq
nigh (2) - 18 freq
enjogh (2) - 1 freq
enoch (2) - 17 freq
enosh (2) - 3 freq
yogh (3) - 3 freq
gnough (3) - 1 freq
enouch (3) - 4 freq
nog (3) - 3 freq
nosh (3) - 1 freq
noth (3) - 5 freq
neigh (3) - 4 freq
ngho (3) - 1 freq
aneugh (3) - 15 freq
enoug (3) - 1 freq
oonagh (3) - 3 freq
noah (3) - 22 freq
gogh (3) - 1 freq
enyoch (3) - 36 freq
sogh (3) - 1 freq
'enough (3) - 1 freq
SoundEx code - E520
enough - 911 freq
ens - 16 freq
enns - 11 freq
eneuch - 751 freq
eence - 319 freq
eens - 131 freq
enjoay - 1 freq
enjoy - 336 freq
eneugh - 49 freq
ense - 15 freq
eemage - 18 freq
emmma's - 1 freq
enuch - 89 freq
eemis - 12 freq
een's - 13 freq
eyn's - 1 freq
eyns - 7 freq
enjey - 11 freq
eense - 16 freq
eneaise - 1 freq
enn's - 1 freq
enough-he - 1 freq
enouch - 4 freq
ewing - 7 freq
eimage - 18 freq
enugh - 2 freq
enc - 1 freq
enic's - 1 freq
'enjoy - 2 freq
eunice - 1 freq
enoch - 17 freq
enosh - 3 freq
emmaus - 6 freq
eemock - 8 freq
einas - 1 freq
eins - 2 freq
enyoch - 36 freq
eens-shö - 1 freq
eans - 10 freq
emus - 1 freq
enogh - 20 freq
enjye - 1 freq
enough-a - 1 freq
'enough - 1 freq
eng - 10 freq
eneuch- - 1 freq
eyeing - 1 freq
eines - 3 freq
enack - 1 freq
eince - 1 freq
eneoch - 2 freq
€˜eence - 1 freq
eenies - 15 freq
€“eneuch - 1 freq
ems - 4 freq
enschew - 1 freq
enjy - 2 freq
emma's - 1 freq
€œenough - 1 freq
enes - 2 freq
€œenoch - 1 freq
enyoch' - 1 freq
eneÂ’s - 1 freq
emms - 1 freq
emosh - 1 freq
engy - 2 freq
emaaq - 1 freq
emz - 4 freq
emoji - 3 freq
euang - 1 freq
e'en's - 1 freq
eyemask - 1 freq
eimsj - 1 freq
enoug - 1 freq
enj - 1 freq
euankay - 1 freq
MetaPhone code - ENF
enough - 911 freq
eneugh - 49 freq
envy - 25 freq
envie - 2 freq
enuf - 13 freq
enu'f - 1 freq
enugh - 2 freq
eneuf - 1 freq
enogh - 20 freq
enough-a - 1 freq
'enough - 1 freq
enuff - 12 freq
€œenough - 1 freq
enof - 5 freq
env - 1 freq
enoff - 1 freq
ENOGH
Time to execute Levenshtein function - 0.189756 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.336591 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.031821 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.036911 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.000884 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.