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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
invite (0) - 44 freq
incite (1) - 1 freq
invitet (1) - 4 freq
invites (1) - 11 freq
invie (1) - 1 freq
invited (1) - 38 freq
indite (1) - 1 freq
inite (1) - 6 freq
invyte (1) - 1 freq
injine (2) - 7 freq
unite (2) - 11 freq
finite (2) - 3 freq
init (2) - 1 freq
invied (2) - 1 freq
ingine (2) - 33 freq
inate (2) - 1 freq
inspite (2) - 3 freq
inuits (2) - 2 freq
inveit (2) - 5 freq
envie (2) - 2 freq
invoke (2) - 1 freq
innate (2) - 3 freq
inte (2) - 129 freq
invoice (2) - 5 freq
intiae (2) - 1 freq
invite (0) - 44 freq
invyte (1) - 1 freq
inite (2) - 6 freq
invitet (2) - 4 freq
inveit (2) - 5 freq
indite (2) - 1 freq
incite (2) - 1 freq
invited (2) - 38 freq
invie (2) - 1 freq
invites (2) - 11 freq
intit (3) - 11 freq
invis (3) - 1 freq
inpit (3) - 49 freq
nvt (3) - 1 freq
endite (3) - 1 freq
innit (3) - 10 freq
invitin (3) - 16 freq
evite (3) - 12 freq
levite (3) - 2 freq
invitit (3) - 39 freq
invade (3) - 5 freq
onsite (3) - 1 freq
infit (3) - 1 freq
inveits (3) - 1 freq
ingate (3) - 4 freq
SoundEx code - I513
impatiently - 20 freq
invitation - 27 freq
inbetween - 3 freq
inevitably - 10 freq
infatuation - 1 freq
impatient - 16 freq
inveetit - 4 freq
inobedience - 2 freq
inevitable - 29 freq
impediment - 10 freq
invite - 44 freq
invitin - 16 freq
inpit - 49 freq
invited - 38 freq
impident - 8 freq
invaders - 9 freq
invites - 11 freq
impudent - 2 freq
impidence - 8 freq
invitit - 39 freq
inpitten - 2 freq
inaboot - 35 freq
impty - 14 freq
invade - 5 freq
infatuated - 1 freq
invadit - 5 freq
invadin - 5 freq
invitatioun - 1 freq
invaded - 4 freq
'invited' - 2 freq
impidint - 1 freq
invitit's - 1 freq
impetus - 3 freq
impeedence - 1 freq
inhabitants - 8 freq
inhabit - 3 freq
input - 4 freq
invitet - 4 freq
invading - 1 freq
inaboots - 3 freq
innovations - 4 freq
inviterate - 1 freq
inpits - 5 freq
inpittin - 1 freq
inveit - 5 freq
invitaetion - 2 freq
infodump - 1 freq
invitin's - 1 freq
inviting - 3 freq
in-aboots - 1 freq
in-aboot - 1 freq
inybuddy - 1 freq
invitations - 4 freq
innovation - 6 freq
innovative - 9 freq
in-betweenies - 2 freq
impit - 1 freq
inapt - 1 freq
invye't - 1 freq
inbidin - 5 freq
inbye't - 1 freq
ineptly - 1 freq
inhibit - 2 freq
invyte - 1 freq
invied - 1 freq
inhabiters - 1 freq
inveterate - 1 freq
in-between - 1 freq
in-pittin - 1 freq
infit - 1 freq
inveits - 1 freq
inhabited - 2 freq
impediments - 2 freq
inevitability - 2 freq
innovator - 1 freq
impetuous - 2 freq
impudence - 2 freq
invitingly - 1 freq
inhabitit - 1 freq
impiddently - 1 freq
imbued - 1 freq
impotence - 1 freq
inhibition - 1 freq
inabootcomer - 1 freq
ianbhood - 2 freq
inhibitions - 1 freq
inept - 1 freq
ineptitude - 1 freq
infidelnumber - 5 freq
MetaPhone code - INFT
invite - 44 freq
invade - 5 freq
inveit - 5 freq
invyte - 1 freq
invied - 1 freq
infit - 1 freq
INVITE
Time to execute Levenshtein function - 0.231579 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.355171 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.027931 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.037513 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.000874 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.