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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
disreputable (0) - 1 freq
reputable (3) - 3 freq
indisputable (4) - 1 freq
disposable (4) - 3 freq
inevitable (5) - 26 freq
dishonourable (5) - 1 freq
susceptible (5) - 3 freq
disruptive (5) - 1 freq
prestable (5) - 2 freq
discernible (5) - 1 freq
relatable (5) - 3 freq
immutable (5) - 1 freq
time-table (5) - 1 freq
rispectible (5) - 1 freq
respectable (5) - 12 freq
reperable (5) - 1 freq
€œdiscreditable (5) - 1 freq
detectable (5) - 1 freq
inseparable (5) - 5 freq
miserable (5) - 56 freq
creditable (5) - 1 freq
despicable (5) - 1 freq
delectable (5) - 1 freq
disrepair (5) - 3 freq
irritable (5) - 2 freq
disreputable (0) - 1 freq
reputable (5) - 3 freq
disposable (6) - 3 freq
indisputable (6) - 1 freq
repeatable (7) - 1 freq
hospitable (7) - 1 freq
disruptive (7) - 1 freq
despicable (7) - 1 freq
susceptible (7) - 3 freq
irritable (8) - 2 freq
dispensible (8) - 1 freq
acceptable (8) - 24 freq
inscrutable (8) - 3 freq
debatable (8) - 1 freq
regrettable (8) - 1 freq
disrupt (8) - 1 freq
corruptible (8) - 1 freq
adaptable (8) - 1 freq
desirable (8) - 4 freq
disruption (8) - 3 freq
disrupted (8) - 1 freq
disrepair (8) - 3 freq
disable (8) - 1 freq
dispute (8) - 6 freq
reperable (8) - 1 freq
SoundEx code - D261
deserves - 32 freq
'deserve - 1 freq
deserve - 63 freq
describe - 43 freq
descryvin - 2 freq
descrive - 25 freq
descrived - 18 freq
descrivin - 9 freq
described - 33 freq
descreived - 4 freq
deserved - 58 freq
description - 38 freq
descreeved - 1 freq
describes - 19 freq
descriving - 1 freq
desairve - 1 freq
decrepit - 3 freq
describin - 11 freq
desirable - 4 freq
descreivit - 5 freq
describit - 3 freq
disruptive - 1 freq
disrupt - 1 freq
desarves - 1 freq
desarve - 2 freq
descrievit - 5 freq
descriptive - 5 freq
descriptors - 1 freq
descrives - 14 freq
disrepair - 3 freq
deskrieve - 1 freq
deskreived - 4 freq
deskreivin - 1 freq
deskreive - 2 freq
disservice - 2 freq
descrieves - 4 freq
desairved - 1 freq
discrepancy - 1 freq
decriptive - 1 freq
descryvit - 1 freq
descreeptions - 1 freq
descreive - 3 freq
descrieve - 8 freq
desairves - 2 freq
desarivedly - 1 freq
deservaidly - 1 freq
descryve - 2 freq
descreve - 1 freq
disreputable - 1 freq
describable - 1 freq
digraphs - 4 freq
digraph - 3 freq
digraph's - 1 freq
discribe - 2 freq
describing - 2 freq
descriptions - 3 freq
descrption - 1 freq
descrieved - 1 freq
deservin - 4 freq
disrupted - 1 freq
deskrive - 1 freq
descreivin - 1 freq
descreeption - 1 freq
deservedly - 1 freq
disruption - 3 freq
deservis - 1 freq
descrievin - 1 freq
deservit - 3 freq
dscriptions - 1 freq
descrivit - 2 freq
descraib - 1 freq
deskraibs - 2 freq
deskraibd - 1 freq
deskraiban - 1 freq
djrobingalloway - 3 freq
descripshin - 1 freq
dwzrhypkhy - 1 freq
dsreb - 1 freq
dgriffinphoto - 1 freq
MetaPhone code - TSRPTBL
disreputable - 1 freq
DISREPUTABLE
Time to execute Levenshtein function - 0.259607 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.457173 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.032804 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.039251 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.000797 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.