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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
oagit (0) - 5 freq
oaght (1) - 1 freq
oagin (1) - 6 freq
jaggit (2) - 7 freq
bait (2) - 32 freq
gapit (2) - 1 freq
habit (2) - 50 freq
git (2) - 1244 freq
nakit (2) - 30 freq
varit (2) - 1 freq
jakit (2) - 8 freq
ranit (2) - 2 freq
coaxit (2) - 1 freq
soakit (2) - 4 freq
wavit (2) - 2 freq
haggit (2) - 3 freq
moggit (2) - 1 freq
cait (2) - 2 freq
eatit (2) - 1 freq
vaigit (2) - 1 freq
agait (2) - 1 freq
sait (2) - 8 freq
voamit (2) - 2 freq
goargit (2) - 1 freq
rawit (2) - 1 freq
oagit (0) - 5 freq
gait (2) - 137 freq
aget (2) - 1 freq
eegit (2) - 4 freq
git (2) - 1244 freq
agait (2) - 1 freq
oaght (2) - 1 freq
oagin (2) - 6 freq
ait (3) - 138 freq
gut (3) - 27 freq
oolit (3) - 2 freq
oaged (3) - 1 freq
oaft (3) - 6 freq
gite (3) - 2 freq
ought (3) - 12 freq
urgit (3) - 1 freq
goamit (3) - 1 freq
oubit (3) - 2 freq
agaity (3) - 1 freq
agate (3) - 2 freq
uggit (3) - 1 freq
oit (3) - 1 freq
oleit (3) - 1 freq
oat (3) - 12 freq
goatie (3) - 1 freq
SoundEx code - O230
ocht - 317 freq
ought - 12 freq
oaght - 1 freq
'ocht - 2 freq
oozit - 2 freq
oucht - 21 freq
oozed - 1 freq
oagit - 5 freq
owsed - 9 freq
ouecht - 1 freq
oxide - 1 freq
oecd - 1 freq
oakwood - 1 freq
oesed - 3 freq
oct - 4 freq
oosed - 1 freq
ought - 1 freq
oaged - 1 freq
ocd - 1 freq
okda - 1 freq
ocd - 4 freq
ojdhii - 1 freq
oushed - 1 freq
oqsd - 1 freq
okayed - 1 freq
MetaPhone code - OJT
oagit - 5 freq
oaged - 1 freq
OAGIT
Time to execute Levenshtein function - 0.198092 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.350505 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.027175 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.036682 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.000924 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.