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 ablow

- basic concord - pre-sorted concord - post-sorted concord - map and chronology - chronogrid - fine-grain concord -

Similar words to residence in Corpus

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
residence (0) - 17 freq
residences (1) - 1 freq
residency (1) - 4 freq
residents (2) - 6 freq
resident (2) - 16 freq
raisidence (2) - 1 freq
eevidence (2) - 1 freq
residenter (2) - 3 freq
evidence (2) - 151 freq
resilience (2) - 6 freq
avidence (3) - 2 freq
resydents (3) - 1 freq
reuerence (3) - 1 freq
accidence (3) - 1 freq
resurgence (3) - 6 freq
eydence (3) - 1 freq
residentin (3) - 1 freq
reverence (3) - 10 freq
presence (3) - 69 freq
reliance (3) - 4 freq
pestilence (3) - 6 freq
reiden (3) - 1 freq
resides (3) - 1 freq
credence (3) - 4 freq
president (3) - 25 freq
residence (0) - 17 freq
residency (1) - 4 freq
residences (2) - 1 freq
raisidence (2) - 1 freq
resilience (3) - 6 freq
resident (3) - 16 freq
resonance (4) - 5 freq
residin (4) - 1 freq
residents (4) - 6 freq
eevidence (4) - 1 freq
residenter (4) - 3 freq
evidence (4) - 151 freq
reseistence (5) - 1 freq
impidence (5) - 8 freq
residue (5) - 2 freq
reference (5) - 52 freq
reident (5) - 2 freq
providence (5) - 9 freq
prescience (5) - 1 freq
seilence (5) - 6 freq
radiance (5) - 1 freq
riddance (5) - 4 freq
lvidence (5) - 1 freq
decadence (5) - 2 freq
'silence (5) - 1 freq
SoundEx code - R235
rowstin - 4 freq
roastin - 23 freq
reaction - 51 freq
right-haun - 3 freq
restin - 31 freq
rectangular - 2 freq
richt-haun - 6 freq
recedin - 4 freq
residential - 3 freq
resident - 16 freq
ructions - 3 freq
'recitin - 1 freq
racketin - 1 freq
richtness - 3 freq
reactin - 6 freq
rostand's - 1 freq
rowsting - 1 freq
roostin - 5 freq
residents - 6 freq
ruistin - 1 freq
resting - 4 freq
receding - 1 freq
rustin - 5 freq
reactions - 7 freq
recitin - 7 freq
resettin - 1 freq
residin - 1 freq
richt-wing - 5 freq
richtwing - 1 freq
richt-hand - 1 freq
residence - 17 freq
richt-thinkin - 2 freq
ruction - 1 freq
rocketin - 1 freq
reestin - 1 freq
richt-haand - 2 freq
residency - 4 freq
rax-douns - 1 freq
rushton - 1 freq
resydentèr - 45 freq
resydentèrs - 27 freq
ristin - 3 freq
richtin - 3 freq
restan - 4 freq
resiedential - 1 freq
richt-haundit - 2 freq
richthaundit - 2 freq
richtmess - 1 freq
rectangles - 1 freq
righthand - 1 freq
richt-han - 2 freq
roostan - 1 freq
residenters - 8 freq
reactioun - 1 freq
rostin - 2 freq
residentins - 1 freq
residentin - 1 freq
reistin - 1 freq
rosidandrums - 1 freq
rosidandrum - 2 freq
racketing - 1 freq
reactiouns - 1 freq
rostand - 1 freq
rastaman - 1 freq
resydents - 1 freq
right-hand - 1 freq
rose-tintit - 2 freq
roustin - 1 freq
roastin' - 1 freq
€œresidential - 1 freq
rightin - 1 freq
residenter - 3 freq
raisidence - 1 freq
rectangle - 2 freq
reactionary - 6 freq
reactionaries - 1 freq
residences - 1 freq
reciting - 1 freq
roasting - 1 freq
requoting - 1 freq
rqduhm - 1 freq
righting - 1 freq
rejadam - 1 freq
MetaPhone code - RSTNS
residence - 17 freq
residency - 4 freq
raisidence - 1 freq
RESIDENCE
Time to execute Levenshtein function - 0.193306 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.345006 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.027904 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.064311 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.000915 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.