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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
tumilt (0) - 1 freq
tumblt (1) - 2 freq
tummlt (1) - 8 freq
tumit (1) - 1 freq
tummilt (1) - 8 freq
tumult (1) - 2 freq
tuil (2) - 3 freq
tuils (2) - 13 freq
bummilt (2) - 1 freq
smilt (2) - 1 freq
tuimit (2) - 3 freq
wumpilt (2) - 1 freq
tummle (2) - 19 freq
tumbl't (2) - 1 freq
hamilt (2) - 1 freq
tilt (2) - 30 freq
guilt (2) - 37 freq
rummilt (2) - 4 freq
sumit (2) - 1 freq
tumips (2) - 1 freq
tuimt (2) - 8 freq
tumt (2) - 1 freq
tumml't (2) - 2 freq
tumble (2) - 9 freq
rummlt (2) - 1 freq
tumilt (0) - 1 freq
tumult (1) - 2 freq
tumblt (2) - 2 freq
tummlt (2) - 8 freq
tummilt (2) - 8 freq
tumit (2) - 1 freq
trailt (3) - 7 freq
tummelt (3) - 17 freq
timit (3) - 1 freq
tilt (3) - 30 freq
tumt (3) - 1 freq
hamilt (3) - 1 freq
tuimt (3) - 8 freq
twilt (3) - 2 freq
tummlet (3) - 3 freq
tousilt (3) - 1 freq
tumults (3) - 1 freq
smilt (3) - 1 freq
tuimit (3) - 3 freq
stumult (3) - 1 freq
tamil (3) - 1 freq
tootlt (4) - 1 freq
jumlit (4) - 2 freq
smelt (4) - 43 freq
timely (4) - 4 freq
SoundEx code - T543
tummlet - 3 freq
tummilt - 8 freq
tummlt - 8 freq
tummelt - 17 freq
tumults - 1 freq
tummled - 4 freq
tumult - 2 freq
tunnelled - 1 freq
tumilt - 1 freq
tummelled - 2 freq
tömald - 1 freq
tumml't - 2 freq
MetaPhone code - TMLT
tumbl't - 1 freq
tummlet - 3 freq
tummilt - 8 freq
tummlt - 8 freq
tummelt - 17 freq
tumbled - 9 freq
tumblt - 2 freq
tummled - 4 freq
tumult - 2 freq
tumilt - 1 freq
tummelled - 2 freq
tömald - 1 freq
tumml't - 2 freq
TUMILT
Time to execute Levenshtein function - 0.231594 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.387469 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.028196 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.039477 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.000865 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.