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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
ominous (0) - 6 freq
mingus (2) - 1 freq
domino's (2) - 1 freq
odious (2) - 4 freq
dominus (2) - 2 freq
ruinous (2) - 1 freq
luminous (2) - 5 freq
ominously (2) - 2 freq
dominos (2) - 5 freq
minors (2) - 1 freq
minos (2) - 6 freq
minus (2) - 5 freq
dominoes (2) - 2 freq
'ominous' (2) - 1 freq
dominies (3) - 23 freq
opinioun (3) - 3 freq
minnows (3) - 3 freq
onions (3) - 17 freq
lino's (3) - 1 freq
dominions (3) - 1 freq
amigos (3) - 2 freq
minys (3) - 1 freq
minces (3) - 1 freq
ious (3) - 1 freq
miners (3) - 41 freq
ominous (0) - 6 freq
minos (2) - 6 freq
minus (2) - 5 freq
menus (3) - 3 freq
omens (3) - 3 freq
omnies (3) - 1 freq
minis (3) - 1 freq
mins (3) - 30 freq
minys (3) - 1 freq
mines (3) - 63 freq
mingus (3) - 1 freq
dominoes (3) - 2 freq
luminous (3) - 5 freq
ruinous (3) - 1 freq
dominus (3) - 2 freq
ominously (3) - 2 freq
dominos (3) - 5 freq
minors (3) - 1 freq
comins (4) - 4 freq
minks (4) - 3 freq
mintys (4) - 1 freq
moneys (4) - 1 freq
domines (4) - 1 freq
menes (4) - 6 freq
minos' (4) - 2 freq
SoundEx code - O552
ominous - 6 freq
omens - 3 freq
onyane's - 1 freq
onions - 17 freq
onhingin - 1 freq
ownins - 1 freq
onyhing - 11 freq
onnen's - 1 freq
onomasticians - 1 freq
'ominous' - 1 freq
onhankit - 2 freq
oniehing - 1 freq
ominously - 2 freq
owning - 1 freq
onomastics - 2 freq
oanyhing - 1 freq
MetaPhone code - OMNS
ominous - 6 freq
omens - 3 freq
'ominous' - 1 freq
omnies - 1 freq
OMINOUS
Time to execute Levenshtein function - 0.192446 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.371202 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.028666 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.037644 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.003285 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.