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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
veesitor (0) - 21 freq
veisitor (1) - 7 freq
veesiter (1) - 1 freq
veesitur (1) - 1 freq
veesior (1) - 1 freq
veesitors (1) - 50 freq
veisitar (2) - 2 freq
veesited (2) - 7 freq
vísitor (2) - 1 freq
veisitors (2) - 2 freq
veesiters (2) - 2 freq
veesion (2) - 25 freq
veesits (2) - 15 freq
veisitour (2) - 1 freq
'veesitors (2) - 1 freq
veesit (2) - 93 freq
veesitor's (2) - 1 freq
visitor (2) - 23 freq
veesitit (2) - 8 freq
veesitin (2) - 31 freq
veision (3) - 2 freq
vistor (3) - 1 freq
seekitar (3) - 1 freq
visitir (3) - 1 freq
veisited (3) - 3 freq
veesitor (0) - 21 freq
veesitur (1) - 1 freq
veesiter (1) - 1 freq
veisitor (1) - 7 freq
visitor (2) - 23 freq
veisitar (2) - 2 freq
veisitour (2) - 1 freq
veesitors (2) - 50 freq
veesior (2) - 1 freq
veesitit (3) - 8 freq
veesited (3) - 7 freq
vistor (3) - 1 freq
visitir (3) - 1 freq
veesit (3) - 93 freq
veesitin (3) - 31 freq
visietor (3) - 5 freq
veisitors (3) - 2 freq
veesits (3) - 15 freq
veesiters (3) - 2 freq
hestor (4) - 1 freq
vestry (4) - 3 freq
veisitin (4) - 4 freq
heestory (4) - 3 freq
veisits (4) - 8 freq
visitors (4) - 47 freq
SoundEx code - V236
veesitors - 50 freq
veesitor - 21 freq
veisitor - 7 freq
'veisitor' - 1 freq
victory - 44 freq
victor's - 2 freq
victor - 39 freq
visiturs - 1 freq
victoria - 27 freq
visitors - 47 freq
victorious - 3 freq
victorie - 9 freq
victorie's - 1 freq
vegetarian - 10 freq
viktor - 1 freq
victorian - 22 freq
visitor - 23 freq
victries - 1 freq
vestry - 3 freq
vegetarians - 3 freq
victrie - 1 freq
veesitor's - 1 freq
vestiary - 1 freq
'veesitors - 1 freq
veesiters - 2 freq
'victoria - 2 freq
visietor - 5 freq
visietor's - 1 freq
visitir - 1 freq
visitor'll - 1 freq
veectorious - 1 freq
victoary - 1 freq
veectrie - 1 freq
visitors' - 1 freq
victorians - 4 freq
veisitour - 1 freq
veisitar - 2 freq
veisitors - 2 freq
vistor - 1 freq
victories - 5 freq
€œvictor - 1 freq
veesiter - 1 freq
veesitur - 1 freq
vísitor - 1 freq
vísitors - 1 freq
victors - 1 freq
vistors - 1 freq
viseetirs - 1 freq
vicderbyshire - 2 freq
MetaPhone code - FSTR
faster - 77 freq
veesitor - 21 freq
veisitor - 7 freq
'veisitor' - 1 freq
foster - 19 freq
fester - 16 freq
faister - 16 freq
visitor - 23 freq
vestry - 3 freq
'faster - 3 freq
visietor - 5 freq
faaster - 6 freq
visitir - 1 freq
fistir - 1 freq
faister' - 1 freq
veisitour - 1 freq
veisitar - 2 freq
vistor - 1 freq
fister - 2 freq
veesiter - 1 freq
veesitur - 1 freq
vísitor - 1 freq
VEESITOR
Time to execute Levenshtein function - 0.175784 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.336583 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.028535 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.039891 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.000954 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.