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

Levenshtein Double Levenshtein SoundEx MetaPhone Manually curated
trimmle (0) - 3 freq
tremmle (1) - 5 freq
thimmle (1) - 4 freq
timmle (1) - 4 freq
trimmlt (1) - 3 freq
trimmles (1) - 1 freq
trimmled (1) - 2 freq
trummle (1) - 3 freq
trimmhn (2) - 1 freq
trummlet (2) - 1 freq
trimmeled (2) - 1 freq
crummle (2) - 5 freq
triple (2) - 12 freq
trumple (2) - 1 freq
trimmed (2) - 8 freq
trinnle (2) - 2 freq
trimmt (2) - 1 freq
tummle (2) - 19 freq
nimmle (2) - 2 freq
brummle (2) - 1 freq
tribble (2) - 31 freq
tremble (2) - 6 freq
tremmled (2) - 3 freq
trimmin (2) - 2 freq
trickle (2) - 5 freq
trimmle (0) - 3 freq
trummle (1) - 3 freq
tremmle (1) - 5 freq
trimmles (2) - 1 freq
trimmled (2) - 2 freq
trimmlt (2) - 3 freq
thimmle (2) - 4 freq
timmle (2) - 4 freq
grummle (3) - 4 freq
trimmer (3) - 1 freq
trample (3) - 2 freq
trimmin (3) - 2 freq
rammle (3) - 3 freq
rummle (3) - 21 freq
traimple (3) - 1 freq
tremmled (3) - 3 freq
trimmlin (3) - 30 freq
brammle (3) - 2 freq
tremmles (3) - 2 freq
prummle (3) - 3 freq
trimmlit (3) - 1 freq
thrummle (3) - 2 freq
trimmeled (3) - 1 freq
trimmed (3) - 8 freq
tremble (3) - 6 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 - TRML
tremble - 6 freq
tremmle - 5 freq
drumlie - 14 freq
drumly - 3 freq
trimmle - 3 freq
drumblie - 1 freq
tremblay - 2 freq
turmoil - 4 freq
trummle - 3 freq
dreamily - 1 freq
terrymaley - 1 freq
tramowl - 7 freq
traml - 1 freq
TRIMMLE
Time to execute Levenshtein function - 0.222101 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.365212 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.031472 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.038345 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.000846 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.