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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
unexpectit (0) - 9 freq
unexpeckit (1) - 10 freq
unelectit (2) - 2 freq
expectit (2) - 34 freq
unexpectitly (2) - 3 freq
unexpected (2) - 16 freq
uxexpeckit (2) - 1 freq
neglectit (3) - 7 freq
respectit (3) - 12 freq
expectin (3) - 66 freq
expeckit (3) - 31 freq
onexpekkit (3) - 1 freq
inspectit (3) - 3 freq
oonexpeckit (3) - 2 freq
expecktit (3) - 1 freq
expectet (3) - 2 freq
expecit (3) - 2 freq
dejectit (4) - 1 freq
respeckit (4) - 15 freq
expeckin (4) - 21 freq
exceptit (4) - 2 freq
unexpectedly (4) - 4 freq
respectet (4) - 1 freq
perfectit (4) - 2 freq
expleitit (4) - 1 freq
unexpectit (0) - 9 freq
unexpeckit (2) - 10 freq
unexpected (3) - 16 freq
unexpectitly (3) - 3 freq
expectit (3) - 34 freq
expectet (4) - 2 freq
inspectit (4) - 3 freq
oonexpeckit (4) - 2 freq
uxexpeckit (4) - 1 freq
unelectit (4) - 2 freq
expecit (5) - 2 freq
respectit (5) - 12 freq
expecktit (5) - 1 freq
expectin (5) - 66 freq
onexpekkit (5) - 1 freq
expeckit (5) - 31 freq
neglectit (5) - 7 freq
exportit (6) - 1 freq
inspectin (6) - 5 freq
expectant (6) - 1 freq
suspectit (6) - 3 freq
expected (6) - 43 freq
inflectit (6) - 3 freq
unexpeckitlie (6) - 2 freq
expects (6) - 6 freq
SoundEx code - U521
unexpeckit - 10 freq
unexpected - 16 freq
unexpectit - 9 freq
unceevil - 1 freq
unsavoury - 1 freq
unspelt - 1 freq
unexpectedly - 4 freq
unexpectitly - 3 freq
unspecified - 6 freq
unspoken - 5 freq
uncivil - 2 freq
unspeakable - 2 freq
uncouple - 1 freq
unsupervised - 1 freq
unspoke - 1 freq
'unacceptable - 1 freq
uncoupled - 1 freq
unsafe - 2 freq
unspret - 1 freq
unspaekable - 2 freq
unsoupled - 1 freq
unspared - 1 freq
unsubstantiate - 1 freq
unspaed - 1 freq
unspokken - 1 freq
unspun - 1 freq
ungebrochnen - 1 freq
unexpeckitlie - 2 freq
unsportin - 1 freq
unspikkable - 1 freq
€œungava - 1 freq
unexpress - 1 freq
unkept - 2 freq
uncovered - 2 freq
unship - 1 freq
unshiftable - 1 freq
unexpectit-like - 1 freq
unexplained - 1 freq
unmissable - 2 freq
unseparably - 1 freq
uynsieboke - 1 freq
unexplainedpod - 1 freq
unacceptable - 1 freq
MetaPhone code - UNKSPKTT
unexpected - 16 freq
unexpectit - 9 freq
UNEXPECTIT
Time to execute Levenshtein function - 0.235785 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.418573 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.028593 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.038757 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.000910 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.