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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
upheid (0) - 1 freq
upheld (1) - 6 freq
'heid (2) - 2 freq
ushed (2) - 1 freq
uphaud (2) - 121 freq
uphaad (2) - 1 freq
upheized (2) - 1 freq
beheid (2) - 3 freq
aheid (2) - 194 freq
sheid (2) - 1 freq
uphold (2) - 1 freq
speid (2) - 5 freq
uplaid (2) - 1 freq
undeid (2) - 3 freq
unherd (2) - 2 freq
spreid (2) - 94 freq
upped (2) - 5 freq
heid (2) - 3306 freq
uized (3) - 21 freq
sheed (3) - 19 freq
hid (3) - 3439 freq
theii (3) - 1 freq
paid (3) - 82 freq
spreids (3) - 12 freq
heird (3) - 1 freq
upheid (0) - 1 freq
uphaad (2) - 1 freq
uphaud (2) - 121 freq
upheld (2) - 6 freq
uphold (3) - 1 freq
phd (3) - 9 freq
uplaid (3) - 1 freq
heid (3) - 3306 freq
sheid (3) - 1 freq
upped (3) - 5 freq
ushed (3) - 1 freq
aheid (3) - 194 freq
'heid (3) - 2 freq
upheized (3) - 1 freq
beheid (3) - 3 freq
ahead (4) - 84 freq
baeheid (4) - 1 freq
upheeze (4) - 4 freq
huid (4) - 2 freq
phil (4) - 29 freq
praid (4) - 1 freq
ahid (4) - 2 freq
sheud (4) - 1 freq
upload (4) - 2 freq
uphauld (4) - 1 freq
SoundEx code - U130
uptae - 22 freq
upped - 5 freq
upwide - 1 freq
uphaud - 121 freq
upbeat - 4 freq
ufft - 1 freq
up't - 1 freq
uppity - 6 freq
upt - 2 freq
upo't - 1 freq
up-pit - 1 freq
updo - 1 freq
upheid - 1 freq
uphaad - 1 freq
u-bait - 1 freq
uppt - 1 freq
upwith - 1 freq
up-the - 1 freq
up-the-wey - 1 freq
upd - 1 freq
ueabd - 1 freq
MetaPhone code - UFT
uphaud - 121 freq
ufft - 1 freq
upheid - 1 freq
uphaad - 1 freq
UPHEID
Time to execute Levenshtein function - 0.250488 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.434700 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.031699 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.038744 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.001244 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.