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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
divisive (0) - 7 freq
devisive (1) - 2 freq
division (2) - 17 freq
decisive (2) - 3 freq
digitise (3) - 2 freq
dividin (3) - 4 freq
devisins (3) - 4 freq
invasive (3) - 1 freq
divinin (3) - 1 freq
dividin' (3) - 1 freq
division' (3) - 1 freq
divinity (3) - 2 freq
divide (3) - 24 freq
decisive' (3) - 1 freq
diveision (3) - 1 freq
devisit (3) - 4 freq
civilize (3) - 1 freq
dividit (3) - 7 freq
evasive (3) - 1 freq
devise (3) - 2 freq
digestive (3) - 4 freq
divine (3) - 29 freq
divisions (3) - 8 freq
dismissive (3) - 5 freq
definsive (3) - 1 freq
divisive (0) - 7 freq
devisive (1) - 2 freq
decisive (3) - 3 freq
division (3) - 17 freq
devisit (4) - 4 freq
diveision (4) - 1 freq
invasive (4) - 1 freq
evasive (4) - 1 freq
devisin (4) - 7 freq
devise (4) - 2 freq
advisin (5) - 3 freq
davison (5) - 1 freq
missive (5) - 3 freq
devyse (5) - 2 freq
davis (5) - 7 freq
adhesive (5) - 1 freq
dives (5) - 7 freq
divvy (5) - 3 freq
divisions (5) - 8 freq
devised (5) - 1 freq
adivisor (5) - 1 freq
definsive (5) - 1 freq
decisive' (5) - 1 freq
divinity (5) - 2 freq
divide (5) - 24 freq
SoundEx code - D121
dub-spirkit - 1 freq
divisive - 7 freq
devisive - 2 freq
dvcv - 3 freq
duvxb - 1 freq
davecbatchelor - 3 freq
dfzvsquvu - 1 freq
dofjafcw - 1 freq
dpgfvxd - 1 freq
dvhikpz - 1 freq
dtbcbiqygj - 1 freq
dfpxv - 1 freq
davegiff - 1 freq
dbbvjbopx - 1 freq
davygavin - 33 freq
MetaPhone code - TFSF
divisive - 7 freq
devisive - 2 freq
DIVISIVE
Time to execute Levenshtein function - 0.207603 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.353536 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.028002 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.038088 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.001080 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.