misc: fix typos (apache#1281)

Author: jbampton

.github/linters/codespell.txt

@@ -1,5 +1,4 @@
 abl
-absolut
 acccount
 accessability
 accidently
@@ -10,7 +9,6 @@ adherance
 administr
 adquire
 advices
-afer
 afile
 afte
 afterwords
@@ -21,7 +19,6 @@ alle
 allo
 allocte
 allong
-alocate
 alot
 alow
 alpha-numeric
@@ -38,7 +35,6 @@ anothers
 appropropriate
 apprpriate
 aquire
-arbitarily
 arent
 arguents
 assemblie
@@ -165,7 +161,6 @@ guerilla
 guiness
 hart
 hav
-havent
 heder
 hendler
 highligh
@@ -211,7 +206,6 @@ itsself
 kake
 ket
 lama
-lenght
 lief
 lien
 loner
@@ -235,9 +229,7 @@ meus
 millenium
 millepede
 mimicing
-mimick
 mimicks
-minimun
 mininum
 mis
 mot
@@ -272,7 +264,6 @@ ommitted
 ond
 ons
 ony
-oposite
 oppertunity
 ore
 oriente

src/Lucene.Net.Analysis.Common/Analysis/Br/BrazilianStemmer.cs

@@ -720,7 +720,7 @@ private bool Step2()
                 return false;
             }
 
-            // suffix lenght = 7
+            // suffix length = 7
             if (RV.Length >= 7)
             {
                 if (Suffix(RV, "issemos"))

src/Lucene.Net.Analysis.Common/Analysis/Compound/Hyphenation/hyphenation.dtd

@@ -25,7 +25,7 @@
 <!ELEMENT hyphen-char EMPTY>
 <!ATTLIST hyphen-char value CDATA #REQUIRED>
 
-<!-- Default minimun length in characters of hyphenated word fragments
+<!-- Default minimum length in characters of hyphenated word fragments
      before and after the line break. For some languages this is not
      only for aesthetic purposes, wrong hyphens may be generated if this
      is not accounted for.

src/Lucene.Net.Analysis.Common/Analysis/Hunspell/Dictionary.cs

@@ -923,7 +923,7 @@ private void ReadDictionaryFiles(IList<Stream> dictionaries, Encoding decoder, B
                             continue;
                         }
                         line = UnescapeEntry(line);
-                        // if we havent seen any stem exceptions, try to parse one
+                        // if we haven't seen any stem exceptions, try to parse one
                         if (hasStemExceptions == false)
                         {
                             int morphStart = line.IndexOf(MORPH_SEPARATOR);

src/Lucene.Net.Analysis.Common/Analysis/Hunspell/HunspellStemFilterFactory.cs

@@ -64,7 +64,7 @@ public HunspellStemFilterFactory(IDictionary<string, string> args)
             affixFile = Get(args, PARAM_AFFIX);
             ignoreCase = GetBoolean(args, PARAM_IGNORE_CASE, false);
             longestOnly = GetBoolean(args, PARAM_LONGEST_ONLY, false);
-            // this isnt necessary: we properly load all dictionaries.
+            // this isn't necessary: we properly load all dictionaries.
             // but recognize and ignore for back compat
             GetBoolean(args, "strictAffixParsing", true);
             // this isn't necessary: multi-stage stripping is fixed and

src/Lucene.Net.Analysis.Common/Analysis/Hunspell/Stemmer.cs

@@ -601,7 +601,7 @@ private bool CheckCondition(int condition, char[] c1, int c1off, int c1len, char
         /// <param name="strippedWord"> Word the affix has been removed and the strip added </param>
         /// <param name="length"> valid length of stripped word </param>
         /// <param name="affix"> HunspellAffix representing the affix rule itself </param>
-        /// <param name="prefixFlag"> when we already stripped a prefix, we cant simply recurse and check the suffix, unless both are compatible
+        /// <param name="prefixFlag"> when we already stripped a prefix, we can't simply recurse and check the suffix, unless both are compatible
         ///                   so we must check dictionary form against both to add it as a stem! </param>
         /// <param name="recursionDepth"> current recursion depth </param>
         /// <param name="prefix"> true if we are removing a prefix (false if its a suffix) </param>

src/Lucene.Net.Analysis.Common/Analysis/Path/PathHierarchyTokenizerFactory.cs

@@ -50,7 +50,7 @@ namespace Lucene.Net.Analysis.Path
     /// </fieldType>
     /// </code>
     /// <para>
-    /// In this example however we see the oposite configuration, so that a query
+    /// In this example however we see the opposite configuration, so that a query
     /// for <c>Books/NonFic/Science/Physics</c> would match documents
     /// containing <c>Books/NonFic</c>, <c>Books/NonFic/Science</c>,
     /// or <c>Books/NonFic/Science/Physics</c>, but not

src/Lucene.Net.Analysis.Common/Analysis/Util/CharArraySet.cs

@@ -537,7 +537,7 @@ internal static CharArraySet CopySet<T>(LuceneVersion matchVersion, IEnumerable<
 
             return new CharArraySet(matchVersion, collection.Select(text =>
             {
-                // We cannot capture Span<T> from outside of the lambda, so we just re-alocate the
+                // We cannot capture Span<T> from outside of the lambda, so we just re-allocate the
                 // stack on every loop.
                 var returnType = CharArrayDictionary.ConvertObjectToChars(text, out char[] chars, out string s);
                 if (returnType == CharArrayDictionary.CharReturnType.String)

src/Lucene.Net.Analysis.Common/Analysis/Util/CharacterUtils.cs

@@ -124,7 +124,7 @@ public static CharacterUtils GetJava4Instance(LuceneVersion matchVersion) // LUC
         ///          a character array </param>
         /// <param name="offset">
         ///          the offset to the char values in the chars array to be converted </param>
-        /// <param name="limit"> the index afer the last element that should be used to calculate
+        /// <param name="limit"> the index after the last element that should be used to calculate
         ///        codepoint.
         /// </param>
         /// <returns> the Unicode code point at the given index </returns>

src/Lucene.Net.Analysis.Common/Analysis/Util/RollingCharBuffer.cs

@@ -65,7 +65,7 @@ public void Reset(TextReader reader)
 
         /// <summary>
         /// Absolute position read.  NOTE: pos must not jump
-        /// ahead by more than 1!  Ie, it's OK to read arbitarily
+        /// ahead by more than 1!  Ie, it's OK to read arbitrarily
         /// far back (just not prior to the last <see cref="FreeBefore(int)"/>,
         /// but NOT ok to read arbitrarily far
         /// ahead.  Returns -1 if you hit EOF.