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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
usan (0) - 4 freq
uscn (1) - 61 freq
susan (1) - 20 freq
busan (1) - 1 freq
usain (1) - 1 freq
yusan (1) - 2 freq
usin (1) - 97 freq
san (1) - 46 freq
ulan (1) - 1 freq
usman (1) - 1 freq
usa (1) - 52 freq
'sae (2) - 49 freq
'sax (2) - 2 freq
sap (2) - 10 freq
sat (2) - 749 freq
foan (2) - 1 freq
€”an (2) - 2 freq
vsn (2) - 1 freq
usage (2) - 10 freq
ewan (2) - 17 freq
ustae (2) - 2 freq
uapn (2) - 1 freq
aman (2) - 2 freq
iran (2) - 2 freq
awan (2) - 1 freq
usan (0) - 4 freq
usin (1) - 97 freq
san (1) - 46 freq
usain (1) - 1 freq
yusan (1) - 2 freq
asian (2) - 13 freq
sen (2) - 155 freq
saen (2) - 71 freq
aisan (2) - 1 freq
sain (2) - 14 freq
saun (2) - 11 freq
syn (2) - 6 freq
uisin (2) - 105 freq
sn (2) - 1 freq
sin (2) - 676 freq
sane (2) - 6 freq
sun (2) - 727 freq
son (2) - 532 freq
yeusan (2) - 1 freq
saan (2) - 1 freq
sayn (2) - 2 freq
sean (2) - 16 freq
ulan (2) - 1 freq
busan (2) - 1 freq
usa (2) - 52 freq
SoundEx code - U250
usin - 97 freq
ugsome - 65 freq
uggin - 3 freq
uisin - 105 freq
uggsome - 7 freq
uckin - 1 freq
uissin - 1 freq
uisein - 9 freq
usin' - 1 freq
usan - 4 freq
uissan - 3 freq
uscn - 61 freq
uisin' - 1 freq
-ukin - 1 freq
uizin - 12 freq
ugsumm - 1 freq
ugsum - 2 freq
usain - 1 freq
uszxn - 1 freq
uwxjm - 1 freq
uzn - 1 freq
MetaPhone code - USN
usin - 97 freq
uisin - 105 freq
uissin - 1 freq
uisein - 9 freq
usin' - 1 freq
usan - 4 freq
uissan - 3 freq
uisin' - 1 freq
uizin - 12 freq
usain - 1 freq
uzn - 1 freq
USAN
Time to execute Levenshtein function - 0.193295 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.349225 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.027527 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.037104 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.000881 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.