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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
cometh (0) - 6 freq
comete (1) - 1 freq
comets (1) - 12 freq
comethe (1) - 1 freq
'cometh (1) - 1 freq
comet (1) - 12 freq
comet's (2) - 1 freq
come' (2) - 2 freq
comed (2) - 12 freq
comes (2) - 926 freq
couth (2) - 1 freq
comena (2) - 2 freq
come (2) - 3111 freq
chmets (2) - 1 freq
caeth (2) - 1 freq
moneth (2) - 9 freq
comeen (2) - 1 freq
covet (2) - 3 freq
compt (2) - 1 freq
somethm (2) - 1 freq
comers (2) - 1 freq
come's (2) - 1 freq
comely (2) - 4 freq
aimeth (2) - 1 freq
compete (2) - 11 freq
cometh (0) - 6 freq
comethe (1) - 1 freq
comet (2) - 12 freq
'cometh (2) - 1 freq
comete (2) - 1 freq
comets (2) - 12 freq
caeth (3) - 1 freq
aimeth (3) - 1 freq
comeat (3) - 1 freq
comte (3) - 1 freq
couth (3) - 1 freq
meith (4) - 3 freq
comatie (4) - 2 freq
wamth (4) - 1 freq
clooth (4) - 1 freq
math (4) - 6 freq
myth (4) - 18 freq
meyth (4) - 1 freq
mth (4) - 1 freq
cbeath (4) - 1 freq
caputh (4) - 1 freq
clyth (4) - 1 freq
cloth (4) - 16 freq
jmth (4) - 1 freq
claethe (4) - 1 freq
SoundEx code - C530
can't - 67 freq
comet - 12 freq
canty - 28 freq
coonty - 11 freq
cantie - 77 freq
comatie - 2 freq
count - 44 freq
cunt - 438 freq
comedy - 33 freq
committee - 25 freq
chant - 25 freq
canada - 38 freq
coont - 347 freq
cent - 20 freq
cannot - 19 freq
cant - 40 freq
comed - 12 freq
caumed - 3 freq
chenyit - 1 freq
commute - 4 freq
candy - 23 freq
commit - 17 freq
cometh - 6 freq
chimed - 8 freq
chaunt - 5 freq
cyanide - 1 freq
caamed - 1 freq
caam't - 1 freq
cindy - 6 freq
cind - 2 freq
comte - 1 freq
cain't - 1 freq
county - 38 freq
coontie - 8 freq
commuity - 1 freq
'cometh - 1 freq
caaaandy - 1 freq
canned - 2 freq
comatee - 104 freq
conned - 1 freq
commït - 2 freq
cundie - 10 freq
chuntie - 4 freq
chanty - 10 freq
chain'd - 1 freq
commita - 1 freq
cned - 1 freq
canto - 27 freq
chante - 1 freq
'coont - 1 freq
chummed - 1 freq
commïttee - 1 freq
canadaw - 1 freq
cheined - 1 freq
'count - 1 freq
chained - 3 freq
cumd - 1 freq
cummed - 1 freq
canute - 2 freq
cnd - 8 freq
chinned - 1 freq
chianti - 4 freq
chyint - 1 freq
chainéd - 1 freq
cowned - 9 freq
cainnt - 1 freq
chantie' - 1 freq
comedie - 3 freq
canadae - 6 freq
coohaund - 1 freq
chunty - 6 freq
comethe - 1 freq
€œcantie - 1 freq
comeat - 1 freq
chantie - 1 freq
cunned - 1 freq
comete - 1 freq
€˜cyanide - 1 freq
coined - 3 freq
coomed - 1 freq
cunto - 1 freq
cammatee - 1 freq
€˜can-do - 1 freq
canÂ’t - 11 freq
cnut - 1 freq
cnuty - 1 freq
coooooooooooont - 1 freq
cannit - 1 freq
countÂ’ - 1 freq
caint - 3 freq
chuntey - 1 freq
cmtyea - 1 freq
cont - 2 freq
candy' - 1 freq
cahunt - 1 freq
chunt - 4 freq
MetaPhone code - KM0
cometh - 6 freq
'cometh - 1 freq
comethe - 1 freq
COMETH
Time to execute Levenshtein function - 0.223230 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.400327 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.027692 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.037150 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.000912 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.