- basic concord -
pre-sorted concord -
post-sorted concord -
map and chronology -
chronogrid -
fine-grain concord -
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 if we're not happy with the
standard spelling.
Here follows a list of the top fifteen nearest neighbour words to the search
term, with the Levenshtein distance in brackets. You can click through to find all occurrences of that word to check usage
(although I fear words with apostrophes will cause it to behave in an unpredictable manner).
(1) - 1 occurrences (1) - 1 occurrences b (1) - 688 occurrences d (1) - 382 occurrences g (1) - 190 occurrences l (1) - 145 occurrences (1) - 1 occurrences z (1) - 109 occurrences t (1) - 5265 occurrences e (1) - 2318 occurrences i (1) - 10817 occurrences x (1) - 463 occurrences r (1) - 411 occurrences - (1) - 10057 occurrences s (1) - 394 occurrences