Fixed typos in documentation and comments

src/Lucene.Net.Analysis.Common/Analysis/Compound/Hyphenation/TernaryTree.cs

@@ -214,7 +214,7 @@ private char Insert(char p, char[] key, int start, char val)
                     m_lo[pp]++;
                     if (m_kv[m_lo[pp]] == 0)
                     {
-                        // key completly decompressed leaving garbage in key array
+                        // key completely decompressed leaving garbage in key array
                         m_lo[pp] = (char)0;
                         m_sc[pp] = (char)0;
                         m_hi[pp] = (char)0;

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

@@ -290,7 +290,7 @@ private void ReadAffixFile(Stream affixStream, Encoding decoder)
             patterns.Add(null);
 
             // zero strip -> 0 ord
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             IDictionary<string, int> seenStrips = new JCG.OrderedDictionary<string, int>
             {
                 [""] = 0

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

@@ -63,7 +63,7 @@ public void Reload()
             UninterruptableMonitor.Enter(this);
             try
             {
-                // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+                // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
                 IDictionary<string, Type> services = new JCG.OrderedDictionary<string, Type>(this.services);
                 SPIClassIterator<S> loader = SPIClassIterator<S>.Get();
 

src/Lucene.Net.Analysis.Phonetic/Language/DoubleMetaphone.cs

@@ -1073,7 +1073,7 @@ private bool ConditionM0(string value, int index)
 
         /// <summary>
         /// Determines whether or not a value is of slavo-germanic origin. A value is
-        /// of slavo-germanic origin if it contians any of 'W', 'K', 'CZ', or 'WITZ'.
+        /// of slavo-germanic origin if it contains any of 'W', 'K', 'CZ', or 'WITZ'.
         /// </summary>
         [MethodImpl(MethodImplOptions.AggressiveInlining)]
         private static bool IsSlavoGermanic(string value) // LUCENENET: CA1822: Mark members as static

src/Lucene.Net.Benchmark/ByTask/Tasks/RepSumByNameRoundTask.cs

@@ -55,7 +55,7 @@ public override int DoLogic()
         protected virtual Report ReportSumByNameRound(IList<TaskStats> taskStats)
         {
             // aggregate by task name and round
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             JCG.OrderedDictionary<string, TaskStats> p2 = new JCG.OrderedDictionary<string, TaskStats>();
             int reported = 0;
             foreach (TaskStats stat1 in taskStats)

src/Lucene.Net.Benchmark/ByTask/Tasks/RepSumByNameTask.cs

@@ -56,7 +56,7 @@ protected virtual Report ReportSumByName(IList<TaskStats> taskStats)
         {
             // aggregate by task name
             int reported = 0;
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             JCG.OrderedDictionary<string, TaskStats> p2 = new JCG.OrderedDictionary<string, TaskStats>();
             foreach (TaskStats stat1 in taskStats)
             {

src/Lucene.Net.Benchmark/ByTask/Tasks/RepSumByPrefRoundTask.cs

@@ -51,7 +51,7 @@ protected virtual Report ReportSumByPrefixRound(IList<TaskStats> taskStats)
         {
             // aggregate by task name and by round
             int reported = 0;
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             JCG.OrderedDictionary<string, TaskStats> p2 = new JCG.OrderedDictionary<string, TaskStats>();
             foreach (TaskStats stat1 in taskStats)
             {

src/Lucene.Net.Benchmark/ByTask/Tasks/RepSumByPrefTask.cs

@@ -53,7 +53,7 @@ protected virtual Report ReportSumByPrefix(IList<TaskStats> taskStats)
         {
             // aggregate by task name
             int reported = 0;
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             JCG.OrderedDictionary<string, TaskStats> p2 = new JCG.OrderedDictionary<string, TaskStats>();
             foreach (TaskStats stat1 in taskStats)
             {

src/Lucene.Net.Benchmark/ByTask/Tasks/ReportTask.cs

@@ -130,7 +130,7 @@ protected virtual string TaskReportLine(string longestOp, TaskStats stat)
             return sb.ToString();
         }
 
-        // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+        // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
         protected virtual Report GenPartialReport(int reported, JCG.OrderedDictionary<string, TaskStats> partOfTasks, int totalSize)
         {
             string longetOp = LongestOp(partOfTasks.Values);

src/Lucene.Net.Expressions/JS/JavascriptCompiler.cs

@@ -89,7 +89,7 @@ private static MethodInfo GetMethod(Type type, string method, Type[] parms)
 
         private readonly string sourceText;
 
-        // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+        // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
         private readonly IDictionary<string, int> externalsMap = new JCG.OrderedDictionary<string, int>();
 
         private TypeBuilder dynamicType;

src/Lucene.Net.Facet/DrillDownQuery.cs

@@ -76,7 +76,7 @@ public static Term Term(string field, string dim, params string[] path)
 
         private readonly FacetsConfig config;
         private readonly BooleanQuery query;
-        // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+        // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
         private readonly IDictionary<string, int> drillDownDims = new JCG.OrderedDictionary<string, int>();
 
         /// <summary>

src/Lucene.Net.Facet/DrillSidewaysScorer.cs

@@ -89,7 +89,7 @@ public override bool Score(ICollector collector, int maxDoc)
 
             // TODO: if we ever allow null baseScorer ... it will
             // mean we DO score docs out of order ... hmm, or if we
-            // change up the order of the conjuntions below
+            // change up the order of the conjunctions below
             if (Debugging.AssertsEnabled) Debugging.Assert(baseScorer != null);
 
             // some scorers, eg ReqExlScorer, can hit NPE if cost is called after nextDoc

src/Lucene.Net.Grouping/Function/FunctionDistinctValuesCollector.cs

@@ -46,7 +46,7 @@ public FunctionDistinctValuesCollector(IDictionary /*Map<?, ?>*/ vsContext, Valu
             this.vsContext = vsContext;
             this.groupSource = groupSource;
             this.countSource = countSource;
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             groupMap = new JCG.OrderedDictionary<MutableValue, GroupCount>();
             foreach (SearchGroup<MutableValue> group in groups)
             {

src/Lucene.Net.Misc/Index/Sorter/SortingAtomicReader.cs

@@ -499,7 +499,7 @@ internal class SortingDocsAndPositionsEnum : FilterDocsAndPositionsEnum
         {
             /// <summary>
             /// A <see cref="TimSorter"/> which sorts two parallel arrays of doc IDs and
-            /// offsets in one go. Everytime a doc ID is 'swapped', its correponding offset
+            /// offsets in one go. Everytime a doc ID is 'swapped', its corresponding offset
             /// is swapped too.
             /// </summary>
             internal sealed class DocOffsetSorter : TimSorter

src/Lucene.Net.QueryParser/Flexible/Standard/Config/StandardQueryConfigHandler.cs

@@ -50,7 +50,7 @@ public StandardQueryConfigHandler()
             Set(ConfigurationKeys.PHRASE_SLOP, 0); //default value 2.4
             Set(ConfigurationKeys.LOWERCASE_EXPANDED_TERMS, true); //default value 2.4
             Set(ConfigurationKeys.ENABLE_POSITION_INCREMENTS, false); //default value 2.4
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             Set(ConfigurationKeys.FIELD_BOOST_MAP, new JCG.OrderedDictionary<string, float>());
             Set(ConfigurationKeys.FUZZY_CONFIG, new FuzzyConfig());
             Set(ConfigurationKeys.LOCALE, null);

src/Lucene.Net.Spatial/Serialized/SerializedDVStrategy.cs

@@ -33,7 +33,7 @@ namespace Lucene.Net.Spatial.Serialized
 
     /// <summary>
     /// A <see cref="SpatialStrategy"/> based on serializing a Shape stored into BinaryDocValues.
-    /// This is not at all fast; it's designed to be used in conjuction with another index based
+    /// This is not at all fast; it's designed to be used in conjunction with another index based
     /// SpatialStrategy that is approximated(like <see cref="Prefix.RecursivePrefixTreeStrategy"/>)
     /// to add precision or eventually make more specific / advanced calculations on the per-document
     /// geometry.

src/Lucene.Net.TestFramework/Support/Attributes/LuceneNetSpecificAttribute.cs

@@ -30,7 +30,7 @@ internal sealed class LuceneNetSpecificAttribute : CategoryAttribute
         public LuceneNetSpecificAttribute()
             : base("LUCENENET")
         {
-            // nothing to do here but invoke the base contsructor.
+            // nothing to do here but invoke the base constructor.
         }
     }
 }

src/Lucene.Net.TestFramework/Util/LuceneTestCase.cs

@@ -2178,7 +2178,7 @@ public static bool DefaultCodecSupportsSortedSet
 
         /// <summary>
         /// Returns true if the codec "supports" docsWithField
-        /// (other codecs return MatchAllBits, because you couldnt write missing values before)
+        /// (other codecs return MatchAllBits, because you couldn't write missing values before)
         /// </summary>
         public static bool DefaultCodecSupportsDocsWithField
         {

src/Lucene.Net.Tests.Grouping/DistinctValuesCollectorTest.cs

@@ -537,7 +537,7 @@ private IndexContext CreateIndexContext()
                 if (!searchTermToGroupCounts.TryGetValue(content, out var groupToCounts))
                 {
                     // Groups sort always DOCID asc...
-                    // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+                    // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
                     searchTermToGroupCounts.Add(content, groupToCounts = new JCG.OrderedDictionary<string, ISet<string>>());
                     contentStrings.Add(content);
                 }

src/Lucene.Net.Tests.QueryParser/Simple/TestSimpleQueryParser.cs

@@ -541,7 +541,7 @@ public virtual void TestComplex06()
         [Test]
         public virtual void TestWeightedTerm()
         {
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             IDictionary<string, float> weights = new JCG.OrderedDictionary<string, float>();
             weights["field0"] = 5f;
             weights["field1"] = 10f;
@@ -563,7 +563,7 @@ public virtual void TestWeightedTerm()
         [Test]
         public virtual void TestWeightedOR()
         {
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             IDictionary<string, float> weights = new JCG.OrderedDictionary<string, float>();
             weights["field0"] = 5f;
             weights["field1"] = 10f;

src/Lucene.Net.Tests.Spatial/Prefix/SpatialOpRecursivePrefixTreeTest.cs

@@ -231,9 +231,9 @@ private void doTest(SpatialOperation operation)
             bool biasContains = (operation == SpatialOperation.Contains);
 
             //Main index loop:
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             IDictionary<String, IShape> indexedShapes = new JCG.OrderedDictionary<String, IShape>();
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             IDictionary<String, IShape> indexedShapesGS = new JCG.OrderedDictionary<String, IShape>(); //grid snapped
             int numIndexedShapes = randomIntBetween(1, 6);
 #pragma warning disable 219

src/Lucene.Net/Index/BufferedUpdates.cs

@@ -130,7 +130,7 @@ load factor (say 2 * POINTER).  Entry is object w/
         // one that came in wins), and helps us detect faster if the same Term is
         // used to update the same field multiple times (so we later traverse it
         // only once).
-        // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+        // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
         internal readonly SCG.IDictionary<string, OrderedDictionary<Term, NumericDocValuesUpdate>> numericUpdates = new Dictionary<string, OrderedDictionary<Term, NumericDocValuesUpdate>>();
 
         // Map<dvField,Map<updateTerm,BinaryUpdate>>
@@ -140,7 +140,7 @@ load factor (say 2 * POINTER).  Entry is object w/
         // one that came in wins), and helps us detect faster if the same Term is
         // used to update the same field multiple times (so we later traverse it
         // only once).
-        // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+        // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
         internal readonly SCG.IDictionary<string, OrderedDictionary<Term, BinaryDocValuesUpdate>> binaryUpdates = new Dictionary<string, OrderedDictionary<Term, BinaryDocValuesUpdate>>();
 
         /// <summary>
@@ -249,7 +249,7 @@ internal virtual void AddNumericUpdate(NumericDocValuesUpdate update, int docIDU
         {
             if (!numericUpdates.TryGetValue(update.field, out OrderedDictionary<Term, NumericDocValuesUpdate> fieldUpdates))
             {
-                // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+                // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
                 fieldUpdates = new OrderedDictionary<Term, NumericDocValuesUpdate>();
                 numericUpdates[update.field] = fieldUpdates;
                 bytesUsed.AddAndGet(BYTES_PER_NUMERIC_FIELD_ENTRY);
@@ -283,7 +283,7 @@ internal virtual void AddBinaryUpdate(BinaryDocValuesUpdate update, int docIDUpt
         {
             if (!binaryUpdates.TryGetValue(update.field, out OrderedDictionary<Term, BinaryDocValuesUpdate> fieldUpdates))
             {
-                // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+                // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
                 fieldUpdates = new OrderedDictionary<Term, BinaryDocValuesUpdate>();
                 binaryUpdates[update.field] = fieldUpdates;
                 bytesUsed.AddAndGet(BYTES_PER_BINARY_FIELD_ENTRY);

src/Lucene.Net/Search/SloppyPhraseScorer.cs

@@ -536,7 +536,7 @@ private static int TpPos(PhrasePositions pp) // LUCENENET: CA1822: Mark members
         /// Find repeating terms and assign them ordinal values </summary>
         private JCG.OrderedDictionary<Term, int> RepeatingTerms()
         {
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             JCG.OrderedDictionary<Term, int> tord = new JCG.OrderedDictionary<Term, int>();
             Dictionary<Term, int> tcnt = new Dictionary<Term, int>();
             for (PhrasePositions pp = min, prev = null; prev != max; pp = (prev = pp).next) // iterate cyclic list: done once handled max

src/Lucene.Net/Util/AttributeSource.cs

@@ -245,9 +245,9 @@ public AttributeSource(AttributeSource input)
         /// </summary>
         public AttributeSource(AttributeFactory factory)
         {
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             this.attributes = new JCG.OrderedDictionary<Type, Util.Attribute>();
-            // LUCENENET specific: OrderedDictioary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
+            // LUCENENET specific: OrderedDictionary<TKey, TValue> is a replacement for LinkedHashMap<K, V> in the JDK
             this.attributeImpls = new JCG.OrderedDictionary<Type, Util.Attribute>();
             this.currentState = new State[1];
             this.factory = factory;
@@ -429,7 +429,7 @@ public T AddAttribute<T>()
 
         /// <summary>
         /// The caller must pass in an interface type that extends <see cref="IAttribute"/>.
-        /// Returns <c>true</c>, if this <see cref="AttributeSource"/> contains the corrsponding <see cref="Attribute"/>.
+        /// Returns <c>true</c>, if this <see cref="AttributeSource"/> contains the corresponding <see cref="Attribute"/>.
         /// </summary>
         public bool HasAttribute<T>() where T : IAttribute
         {