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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
upon (0) - 253 freq
apon (1) - 90 freq
upo (1) - 67 freq
vpon (1) - 1 freq
upun (1) - 5 freq
ipon (1) - 16 freq
opon (1) - 1 freq
spon (1) - 1 freq
uon (1) - 1 freq
upoan (1) - 7 freq
pon (1) - 3 freq
upn (1) - 1 freq
upd (2) - 1 freq
pn (2) - 4 freq
gon (2) - 6 freq
eton (2) - 7 freq
phon (2) - 1 freq
pmn (2) - 1 freq
gupan (2) - 1 freq
'yon (2) - 14 freq
poh (2) - 1 freq
ipn (2) - 1 freq
elon (2) - 1 freq
urn (2) - 6 freq
epona (2) - 1 freq
upon (0) - 253 freq
opon (1) - 1 freq
upoan (1) - 7 freq
pon (1) - 3 freq
ipon (1) - 16 freq
upn (1) - 1 freq
upun (1) - 5 freq
apon (1) - 90 freq
apen (2) - 70 freq
pun (2) - 59 freq
pan (2) - 137 freq
apone (2) - 3 freq
open (2) - 719 freq
poun (2) - 81 freq
ypn (2) - 1 freq
pen (2) - 119 freq
pin (2) - 35 freq
apin (2) - 13 freq
pony (2) - 12 freq
opin (2) - 9 freq
epona (2) - 1 freq
apoun (2) - 1 freq
upain (2) - 1 freq
poon (2) - 2 freq
ipn (2) - 1 freq
SoundEx code - U150
upon - 253 freq
upoan - 7 freq
upun - 5 freq
upain - 1 freq
upo'm - 1 freq
ubun - 1 freq
uppin - 1 freq
upn - 1 freq
ubmo - 1 freq
uapn - 1 freq
MetaPhone code - UPN
upon - 253 freq
upoan - 7 freq
upun - 5 freq
upain - 1 freq
uppin - 1 freq
upn - 1 freq
uapn - 1 freq
UPON
Time to execute Levenshtein function - 0.200598 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.319505 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.027058 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.037509 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.000873 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.