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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
jameses (0) - 1 freq
james's (1) - 3 freq
jamesca (2) - 1 freq
jameson (2) - 2 freq
james' (2) - 2 freq
james (2) - 283 freq
jamesie (2) - 2 freq
jammies (2) - 14 freq
jeames's (2) - 1 freq
jamesy's (2) - 1 freq
jamesy (2) - 25 freq
jaysus (3) - 2 freq
mammies (3) - 8 freq
nameless (3) - 5 freq
games (3) - 248 freq
games' (3) - 2 freq
ambles (3) - 2 freq
caises (3) - 2 freq
lames (3) - 1 freq
jammie (3) - 2 freq
taests (3) - 1 freq
oeses (3) - 1 freq
namesy (3) - 1 freq
abuses (3) - 4 freq
jams (3) - 3 freq
jameses (0) - 1 freq
james's (2) - 3 freq
jammies (3) - 14 freq
jeames's (3) - 1 freq
jamesy (3) - 25 freq
jamesie (3) - 2 freq
jamesy's (3) - 1 freq
james (3) - 283 freq
jamesca (3) - 1 freq
jameson (3) - 2 freq
james' (3) - 2 freq
jeames (4) - 32 freq
jamsie (4) - 3 freq
jalooses (4) - 1 freq
amiss (4) - 16 freq
nemesis (4) - 2 freq
muses (4) - 7 freq
jauss (4) - 7 freq
jeesus (4) - 2 freq
jess (4) - 21 freq
moses (4) - 68 freq
jamieson (4) - 21 freq
jassies (4) - 1 freq
jamie's (4) - 10 freq
jasus (4) - 1 freq
SoundEx code - J522
jamesy's - 1 freq
jameses - 1 freq
junkies - 9 freq
janice's - 1 freq
johnnycakes - 1 freq
jimsie's - 7 freq
junky's - 1 freq
jamsie's - 1 freq
€˜junkies - 1 freq
jcjmjuoj - 1 freq
jankosfuller - 1 freq
janmjax - 3 freq
jamiejaycar - 1 freq
jameshogg - 1 freq
MetaPhone code - JMSS
jamesy's - 1 freq
jameses - 1 freq
james's - 3 freq
jeames's - 1 freq
jeems's - 2 freq
jimsie's - 7 freq
jamsie's - 1 freq
JAMESES
Time to execute Levenshtein function - 0.239629 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.444765 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.028705 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.040109 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.000985 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.