From c7df01ab61c82d5fc9ee57e1b31f468f1390d72d Mon Sep 17 00:00:00 2001 From: Raffi Khatchadourian Date: Thu, 4 Feb 2021 15:28:30 -0500 Subject: [PATCH] errors -> fixes Judging by [the example on GH pages](https://universal-automata.github.io/liblevenshtein/), it would seem that the output is in terms of "spelling *fixes*". The input, instead, is erroneous. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 61b8ab6..b0950f4 100644 --- a/README.md +++ b/README.md @@ -15,7 +15,7 @@ [![Bountysource][bountysource-badge]][bountysource-link] Levenshtein transducers accept a query term and return all terms in a -dictionary that are within n spelling errors away from it. They constitute a +dictionary that are within n spelling fixes away from it. They constitute a highly-efficient (space _and_ time) class of spelling correctors that work very well when you do not require context while making suggestions. Forget about performing a linear scan over your dictionary to find all terms that are