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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
valhalla (0) - 9 freq
tinhalla (3) - 1 freq
vauxhall (3) - 2 freq
valuable (3) - 18 freq
shalla (3) - 9 freq
dalhanna (3) - 1 freq
vanilla (3) - 6 freq
sallna (4) - 1 freq
alkhaled (4) - 1 freq
ah'll (4) - 739 freq
dahlia (4) - 1 freq
valiant (4) - 5 freq
nasally (4) - 2 freq
vandals (4) - 4 freq
a'all (4) - 1 freq
hall (4) - 180 freq
valuables (4) - 3 freq
ahill (4) - 1 freq
earshall (4) - 1 freq
malaya (4) - 3 freq
palpable (4) - 2 freq
'shall (4) - 1 freq
earlshall (4) - 3 freq
mahal (4) - 3 freq
halls (4) - 12 freq
valhalla (0) - 9 freq
vauxhall (4) - 2 freq
vanilla (5) - 6 freq
shalla (5) - 9 freq
tinhalla (5) - 1 freq
valuable (5) - 18 freq
holdall (6) - 14 freq
shilla (6) - 3 freq
alll (6) - 1 freq
finhall (6) - 22 freq
vulgarly (6) - 1 freq
withall (6) - 1 freq
villa (6) - 7 freq
verball (6) - 1 freq
whall (6) - 1 freq
valles (6) - 1 freq
raphaell (6) - 1 freq
holla (6) - 1 freq
vwehacle (6) - 1 freq
halle (6) - 4 freq
vaill (6) - 7 freq
lyall (6) - 9 freq
hallo (6) - 5 freq
shall (6) - 120 freq
kilsally (6) - 2 freq
SoundEx code - V440
valhalla - 9 freq
MetaPhone code - FLHL
valhalla - 9 freq
VALHALLA
Time to execute Levenshtein function - 0.226105 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.354488 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.032982 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.040423 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.000864 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.