diff --git a/lucene/analysis/common/src/java/org/apache/lucene/analysis/compound/hyphenation/HyphenationTree.java b/lucene/analysis/common/src/java/org/apache/lucene/analysis/compound/hyphenation/HyphenationTree.java index 3c72b4fe045..70ad08e2431 100644 --- a/lucene/analysis/common/src/java/org/apache/lucene/analysis/compound/hyphenation/HyphenationTree.java +++ b/lucene/analysis/common/src/java/org/apache/lucene/analysis/compound/hyphenation/HyphenationTree.java @@ -186,7 +186,7 @@ public class HyphenationTree extends TernaryTree implements PatternConsumer { * patterns for languages such as English range from 4000 to 10000. Thus, * doing thousands of string comparisons for each word to hyphenate would be * really slow without the tree. The tradeoff is memory, but using a ternary - * tree instead of a trie, almost halves the the memory used by Lout or TeX. + * tree instead of a trie, almost halves the memory used by Lout or TeX. * It's also faster than using a hash table *
* diff --git a/lucene/core/src/java/org/apache/lucene/index/DocumentsWriterFlushControl.java b/lucene/core/src/java/org/apache/lucene/index/DocumentsWriterFlushControl.java index 0e51dffd58f..e3df50555a3 100644 --- a/lucene/core/src/java/org/apache/lucene/index/DocumentsWriterFlushControl.java +++ b/lucene/core/src/java/org/apache/lucene/index/DocumentsWriterFlushControl.java @@ -130,7 +130,7 @@ final class DocumentsWriterFlushControl implements Accountable, Closeable { * several DWPT in flight indexing large documents (compared to the ram * buffer). This means that those DWPT and their threads will not hit * the stall control before asserting the memory which would in turn - * fail. To prevent this we only assert if the the largest document seen + * fail. To prevent this we only assert if the largest document seen * is smaller than the 1/2 of the maxRamBufferMB */ assert ram <= expected : "actual mem: " + ram + " byte, expected mem: " + expected diff --git a/lucene/facet/src/java/org/apache/lucene/facet/taxonomy/TaxonomyReader.java b/lucene/facet/src/java/org/apache/lucene/facet/taxonomy/TaxonomyReader.java index f631d3be4d4..9fdb53097c7 100644 --- a/lucene/facet/src/java/org/apache/lucene/facet/taxonomy/TaxonomyReader.java +++ b/lucene/facet/src/java/org/apache/lucene/facet/taxonomy/TaxonomyReader.java @@ -54,7 +54,7 @@ import org.apache.lucene.store.AlreadyClosedException; ** This order is important, otherwise it would be possible for the main index * to refer to a category which is not yet visible in the old snapshot of - * the taxonomy. Note that it is indeed fine for the the taxonomy to be opened + * the taxonomy. Note that it is indeed fine for the taxonomy to be opened * after the main index - even a long time after. The reason is that once * a category is added to the taxonomy, it can never be changed or deleted, * so there is no danger that a "too new" taxonomy not being consistent with diff --git a/lucene/queryparser/docs/xml/LuceneCoreQuery.dtd.html b/lucene/queryparser/docs/xml/LuceneCoreQuery.dtd.html index ef7bd881d3c..631e5ab24f2 100644 --- a/lucene/queryparser/docs/xml/LuceneCoreQuery.dtd.html +++ b/lucene/queryparser/docs/xml/LuceneCoreQuery.dtd.html @@ -32,7 +32,7 @@ Lucene QueryParser to parse Google-style search syntax provided by end users.
Filters are not used to select or score content - they are simply used to filter Query output (see FilteredQuery for an example use of query filtering). Because Filters simply offer a yes/no decision for each document in the index their output can be efficiently cached in memory as a Bitset for subsequent reuse (see CachedFilter tag).