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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
unscrannable (0) - 1 freq
scrannable (2) - 2 freq
unspeakable (4) - 2 freq
unstappable (4) - 2 freq
uncountable (4) - 1 freq
unsurpassable (4) - 1 freq
unpardonnable (4) - 1 freq
unspaekable (4) - 2 freq
unlearnable (4) - 1 freq
unsinkable (4) - 1 freq
unkennable (4) - 3 freq
inscrutable (4) - 3 freq
unbrakable (4) - 1 freq
unstable (5) - 1 freq
unsociable (5) - 2 freq
unremarkable (5) - 2 freq
describable (5) - 1 freq
unforgivable (5) - 2 freq
unstoppable (5) - 5 freq
inseparable (5) - 5 freq
unbearable (5) - 2 freq
unseasonably (5) - 1 freq
undeniable (5) - 1 freq
unassailable (5) - 1 freq
unseparably (5) - 1 freq
unscrannable (0) - 1 freq
scrannable (3) - 2 freq
inscrutable (6) - 3 freq
unlearnable (7) - 1 freq
unkennable (7) - 3 freq
unpardonnable (7) - 1 freq
unsinkable (7) - 1 freq
uncountable (7) - 1 freq
interminable (8) - 1 freq
unrenewable (8) - 2 freq
unseparably (8) - 1 freq
unseasonably (8) - 1 freq
unaccoontable (8) - 4 freq
unsmuirable (8) - 1 freq
scrabble (8) - 12 freq
inseparable (8) - 5 freq
discernible (8) - 1 freq
inescapable (8) - 1 freq
scramble (8) - 6 freq
unreasonable (8) - 2 freq
describable (8) - 1 freq
unsociable (8) - 2 freq
unsurpassable (8) - 1 freq
unstappable (8) - 2 freq
unbrakable (8) - 1 freq
SoundEx code - U526
unswered - 4 freq
unsered - 1 freq
unscrewed - 3 freq
unswers - 1 freq
unswer - 6 freq
ungairded - 1 freq
uncertaintie - 2 freq
unicorns - 9 freq
unker - 4 freq
unser - 3 freq
ungert - 1 freq
uncracked - 1 freq
uncharmin - 1 freq
uncarin - 3 freq
unsure - 6 freq
uncharacteristically - 2 freq
ungaretti - 1 freq
unicorn - 60 freq
unguardit - 1 freq
uncertainty - 7 freq
unsurpation - 1 freq
uncorked - 1 freq
ungaro - 2 freq
unscrewit - 1 freq
unscrewin - 2 freq
unscrew - 3 freq
unshair - 3 freq
ungratefu - 6 freq
unscrannable - 1 freq
unnser - 8 freq
uncorkin - 1 freq
unnsers - 1 freq
uncurled - 2 freq
ungrateful - 3 freq
uncurlin - 1 freq
uncertain - 8 freq
ungrip - 1 freq
'unnser - 2 freq
uncertainly - 2 freq
uncrc - 1 freq
uncried - 1 freq
unshared - 1 freq
uncrook - 1 freq
ungrammatical - 3 freq
ungehörte - 1 freq
unchristen'd - 2 freq
unicorms - 1 freq
uncertainties - 1 freq
unscrupulous - 2 freq
unchartered - 1 freq
un-christian - 1 freq
unsurpassable - 1 freq
uncrunklin - 1 freq
unceremoniously - 1 freq
unsurprised - 1 freq
unnserstuid - 1 freq
unsurprisingly - 1 freq
ungrhd - 1 freq
ungreatful - 1 freq
unsurprisinly - 1 freq
'ungrateful' - 1 freq
MetaPhone code - UNSKRNBL
unscrannable - 1 freq
UNSCRANNABLE
Time to execute Levenshtein function - 0.230891 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.433777 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.030038 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.038281 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.000888 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.