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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
expensive (0) - 22 freq
expansive (1) - 6 freq
extensive (1) - 8 freq
expinsive (1) - 1 freq
excessive (2) - 2 freq
pensive (2) - 2 freq
expressive (2) - 10 freq
expense (2) - 17 freq
explosive (2) - 3 freq
expensively (2) - 1 freq
exclusive (3) - 10 freq
extension (3) - 11 freq
expertise (3) - 14 freq
offensive (3) - 12 freq
intensive (3) - 7 freq
expenses (3) - 8 freq
expanse (3) - 8 freq
expinse (3) - 1 freq
explosives (3) - 4 freq
expansively (3) - 2 freq
defensive (3) - 9 freq
extensively (3) - 4 freq
expletive (3) - 1 freq
expansion (3) - 5 freq
pensie (3) - 3 freq
expensive (0) - 22 freq
expansive (1) - 6 freq
expinsive (1) - 1 freq
extensive (2) - 8 freq
expensively (3) - 1 freq
expense (3) - 17 freq
explosive (3) - 3 freq
pensive (3) - 2 freq
expenses (4) - 8 freq
expanse (4) - 8 freq
expressive (4) - 10 freq
expinse (4) - 1 freq
expansion (4) - 5 freq
expansively (4) - 2 freq
excessive (4) - 2 freq
pensie (5) - 3 freq
extensively (5) - 4 freq
expletive (5) - 1 freq
defensive (5) - 9 freq
extension (5) - 11 freq
explosives (5) - 4 freq
exclusive (5) - 10 freq
offensive (5) - 12 freq
intensive (5) - 7 freq
extens (6) - 1 freq
SoundEx code - E215
expoondin - 3 freq
expansion - 5 freq
expoondit - 3 freq
espionage - 3 freq
escapin - 13 freq
expensive - 22 freq
equipment - 10 freq
expenses-peyed - 1 freq
exibmien - 1 freq
expinsive - 1 freq
expandin - 9 freq
expanse - 8 freq
expands - 3 freq
expenses - 8 freq
expense - 17 freq
expanded - 3 freq
escaping - 2 freq
expand - 9 freq
eesefaeness - 1 freq
'expenses - 1 freq
expansive - 6 freq
exponents - 1 freq
expoond - 2 freq
expandan - 1 freq
expensive-lookin - 1 freq
expinse - 1 freq
expensively - 1 freq
expanding - 1 freq
expound - 1 freq
esponsible - 1 freq
expansiveness - 3 freq
expandit - 6 freq
expounit - 4 freq
expounin - 1 freq
expoun - 1 freq
exponent - 1 freq
expenditure - 1 freq
expaund - 1 freq
expoundit - 1 freq
exponed - 4 freq
exceppin - 2 freq
expendable - 2 freq
expend - 1 freq
expended - 1 freq
expansively - 2 freq
expiaint - 1 freq
expone - 2 freq
eqvwmsldqr - 1 freq
eqbnvqb - 1 freq
euukavmiq - 1 freq
ecfmscotland - 3 freq
MetaPhone code - EKSPNSF
expensive - 22 freq
expinsive - 1 freq
expansive - 6 freq
EXPENSIVE
Time to execute Levenshtein function - 0.254217 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.433148 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.030434 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.047025 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.001127 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.