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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
tremmlin (0) - 27 freq
tremblin (1) - 15 freq
trimmlin (1) - 30 freq
trummlin (1) - 1 freq
tremlin (1) - 2 freq
tremmlit (1) - 1 freq
trembling (2) - 4 freq
trèmmlin (2) - 1 freq
trevlin (2) - 1 freq
gremlin (2) - 4 freq
trevelin (2) - 4 freq
rummlin (2) - 23 freq
trimmin (2) - 2 freq
tummlin (2) - 25 freq
grummlin (2) - 7 freq
trummelin (2) - 1 freq
rammlin (2) - 2 freq
crummlin (2) - 8 freq
tremmles (2) - 2 freq
tremblan (2) - 6 freq
trimmlit (2) - 1 freq
tremmled (2) - 3 freq
tramplin (2) - 3 freq
trimlin (2) - 1 freq
thrummlin (2) - 1 freq
tremmlin (0) - 27 freq
trimmlin (1) - 30 freq
trummlin (1) - 1 freq
trummelin (2) - 1 freq
tremmlit (2) - 1 freq
tremlin (2) - 2 freq
tremblin (2) - 15 freq
tremblan (3) - 6 freq
tremmles (3) - 2 freq
crummlin (3) - 8 freq
trimmlit (3) - 1 freq
tremmle (3) - 5 freq
rammlin (3) - 2 freq
trimlin (3) - 1 freq
tramplin (3) - 3 freq
tremmled (3) - 3 freq
thrummlin (3) - 1 freq
rummlin (3) - 23 freq
trimmin (3) - 2 freq
grummlin (3) - 7 freq
tummlin (3) - 25 freq
tremmelt (4) - 1 freq
tummelin (4) - 1 freq
trimmled (4) - 2 freq
trummlet (4) - 1 freq
SoundEx code - T654
tremulous - 2 freq
tremmle - 5 freq
trainline - 3 freq
trummlin - 1 freq
thrawnlie - 2 freq
tremmlin - 27 freq
trimmlin - 30 freq
trimmlt - 3 freq
trimmle - 3 freq
tramlines - 5 freq
'tramlines - 1 freq
trinnlin - 2 freq
thrummle - 2 freq
tremmles - 2 freq
thermals - 9 freq
thrummelt - 1 freq
thornhill - 4 freq
tremmlit - 1 freq
trummelt - 1 freq
tremmled - 3 freq
trimmled - 2 freq
thrimmelt - 1 freq
thrawn-like - 1 freq
tremlin - 2 freq
tremmulous - 1 freq
tremmelt - 1 freq
trèmmlin - 1 freq
thrawnly - 1 freq
turmoil - 4 freq
trinnles - 2 freq
thermal - 12 freq
trunnel - 1 freq
trummle - 3 freq
trinnilt - 2 freq
trimmeled - 1 freq
trinnle - 2 freq
trimmles - 1 freq
trummelin - 1 freq
thrawn-lookin - 1 freq
tourmaline - 1 freq
trimmlit - 1 freq
thrawn-lik - 1 freq
trinnlet - 1 freq
trunnelt - 26 freq
trimlin - 1 freq
tremulously - 1 freq
trummils - 1 freq
thrummles - 1 freq
trummlet - 1 freq
thrawnlik - 1 freq
trinnled - 2 freq
trimmlin-tam - 1 freq
thrummlin - 1 freq
terrymaley - 1 freq
tramowl - 7 freq
traml - 1 freq
MetaPhone code - TRMLN
tremblin - 15 freq
trummlin - 1 freq
tremmlin - 27 freq
trimmlin - 30 freq
tremlin - 2 freq
trèmmlin - 1 freq
trummelin - 1 freq
tremblan - 6 freq
tourmaline - 1 freq
trimlin - 1 freq
TREMMLIN
Time to execute Levenshtein function - 0.212030 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.410532 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.029924 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.037229 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.000877 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.