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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
onshakkilt (0) - 1 freq
shakkilt (2) - 1 freq
onsnekkit (3) - 1 freq
shakkit (3) - 1 freq
onhankit (3) - 2 freq
shakkie (4) - 1 freq
onlokkit (4) - 1 freq
knukkilt (4) - 1 freq
shokkict (4) - 1 freq
shakkin (4) - 83 freq
nyakkit (4) - 2 freq
unfankilt (4) - 1 freq
shakit (4) - 4 freq
shakkeld (4) - 1 freq
shokkit (4) - 2 freq
shakkent (4) - 1 freq
beswakkit (4) - 1 freq
shaakit (4) - 1 freq
umbrakkilt (4) - 1 freq
onlukkit (4) - 1 freq
onfankelt (4) - 1 freq
chakkin (5) - 1 freq
unmankit (5) - 1 freq
shackle (5) - 1 freq
snaikit (5) - 2 freq
onshakkilt (0) - 1 freq
shakkilt (3) - 1 freq
shakkit (5) - 1 freq
onsnekkit (5) - 1 freq
shakkeld (6) - 1 freq
shokkit (6) - 2 freq
shokkict (6) - 1 freq
shakkent (6) - 1 freq
onhankit (6) - 2 freq
umbrakkilt (7) - 1 freq
shaakit (7) - 1 freq
knukkilt (7) - 1 freq
unshillit (7) - 1 freq
unshackled (7) - 3 freq
beswakkit (7) - 1 freq
onfankelt (7) - 1 freq
onlukkit (7) - 1 freq
nyakkit (7) - 2 freq
shakkin (7) - 83 freq
shakit (7) - 4 freq
unfankilt (7) - 1 freq
shakkie (7) - 1 freq
onlokkit (7) - 1 freq
sikkit (8) - 1 freq
shammelt (8) - 1 freq
SoundEx code - O522
ounces - 1 freq
oncost - 1 freq
oonjeest - 1 freq
oonjust - 1 freq
oonces - 3 freq
onshakkilt - 1 freq
oonsocial - 1 freq
oenghus - 2 freq
onysake - 1 freq
onsiccar - 1 freq
oanshach - 1 freq
onesies - 1 freq
onicekqar - 1 freq
onyexcuse - 1 freq
oomgksok - 1 freq
MetaPhone code - ONXKLT
onshakkilt - 1 freq
ONSHAKKILT
Time to execute Levenshtein function - 0.240430 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.397395 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.028242 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.038769 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.000858 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.