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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
condeitions (0) - 4 freq
condeetions (1) - 7 freq
condeition (1) - 3 freq
conditions (1) - 35 freq
condeetion (2) - 5 freq
conditions' (2) - 1 freq
conventions (2) - 15 freq
connections (2) - 35 freq
condition (2) - 36 freq
contentions (2) - 1 freq
rendeitions (2) - 2 freq
convictions (3) - 1 freq
connection (3) - 41 freq
contrition (3) - 1 freq
coalitions (3) - 1 freq
rendeition (3) - 1 freq
conditioned (3) - 1 freq
conversions (3) - 1 freq
conneckions (3) - 1 freq
contortions (3) - 2 freq
conception (3) - 4 freq
convention (3) - 31 freq
concoctions (3) - 6 freq
poseitions (3) - 3 freq
neitions (3) - 1 freq
condeitions (0) - 4 freq
condeetions (1) - 7 freq
conditions (1) - 35 freq
condeition (2) - 3 freq
condition (3) - 36 freq
condeetion (3) - 5 freq
conditions' (3) - 1 freq
rendeitions (3) - 2 freq
conditioner (4) - 1 freq
conotations (4) - 4 freq
conditional (4) - 2 freq
conditioned (4) - 1 freq
condeetionin (4) - 1 freq
contentions (4) - 1 freq
conventions (4) - 15 freq
connections (4) - 35 freq
conventionis (5) - 1 freq
conteins (5) - 2 freq
tradeitions (5) - 9 freq
condemnations (5) - 1 freq
foundations (5) - 4 freq
foondations (5) - 7 freq
conduits (5) - 1 freq
edeitions (5) - 3 freq
fundations (5) - 1 freq
SoundEx code - C533
connotations - 9 freq
coonted - 16 freq
chantit - 8 freq
coontit - 30 freq
condeition - 3 freq
countit - 3 freq
conditions - 35 freq
candidate - 21 freq
candidate's - 1 freq
committed - 21 freq
condition - 36 freq
chauntit - 2 freq
conditioner - 1 freq
conduits - 1 freq
counted - 13 freq
chaunted - 2 freq
committit - 12 freq
condeetions - 7 freq
countet - 1 freq
commïtit - 1 freq
can-edit - 1 freq
chanted - 6 freq
commited - 2 freq
candid - 1 freq
condeetion - 5 freq
condeitions - 4 freq
commodity - 1 freq
connotational - 1 freq
commeittit - 1 freq
connotatioun - 1 freq
candidates - 15 freq
conotations - 4 freq
cantit - 1 freq
commitit - 5 freq
condeetionin - 1 freq
cantatation - 1 freq
conditioned - 1 freq
cantata - 1 freq
conduit - 1 freq
connotation - 3 freq
connotit - 1 freq
conditional - 2 freq
conditions' - 1 freq
cantwaitforschoolstogoback - 1 freq
MetaPhone code - KNTXNS
connotations - 9 freq
conditions - 35 freq
condeetions - 7 freq
condeitions - 4 freq
condeeshuns - 1 freq
conotations - 4 freq
conditions' - 1 freq
CONDEITIONS
Time to execute Levenshtein function - 0.227745 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.398532 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.027536 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.037507 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.000885 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.