From d5d8be9bff0c328b8c1b1fa73622701118889eed Mon Sep 17 00:00:00 2001 From: James Rodewig <40268737+jrodewig@users.noreply.github.com> Date: Wed, 3 Feb 2021 10:45:16 -0500 Subject: [PATCH] [DOCS] Fix typo --- docs/reference/analysis/stemming.asciidoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/reference/analysis/stemming.asciidoc b/docs/reference/analysis/stemming.asciidoc index c590152d2dfa..6e92348f9875 100644 --- a/docs/reference/analysis/stemming.asciidoc +++ b/docs/reference/analysis/stemming.asciidoc @@ -35,7 +35,7 @@ filters during <>. Algorithmic stemmers apply a series of rules to each word to reduce it to its root form. For example, an algorithmic stemmer for English may remove the `-s` -and `-es` prefixes from the end of plural words. +and `-es` suffixes from the end of plural words. Algorithmic stemmers have a few advantages: