This is an automated email from the ASF dual-hosted git repository.

erans pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-math.git

commit 5f9bbadbb2c8eab5a08c4bbf118a66562f0cfd1d
Author: XenoAmess <[email protected]>
AuthorDate: Wed Jun 3 10:29:05 2020 +0800

    fix_typos
---
 README.md                                          |  2 +-
 src/changes/changes.xml                            |  2 +-
 .../integration/gauss/GaussIntegratorFactory.java  |  4 +-
 .../analysis/interpolation/LoessInterpolator.java  |  6 +-
 .../TricubicInterpolatingFunction.java             |  2 +-
 .../interpolation/UnivariateInterpolator.java      |  2 +-
 .../UnivariatePeriodicInterpolator.java            |  2 +-
 .../commons/math4/complex/ComplexFormat.java       |  2 +-
 .../math4/exception/util/LocalizedFormats.java     |  4 +-
 .../commons/math4/fitting/GaussianCurveFitter.java |  2 +-
 .../commons/math4/fitting/HarmonicCurveFitter.java |  2 +-
 .../math4/fitting/PolynomialCurveFitter.java       |  2 +-
 .../commons/math4/fitting/SimpleCurveFitter.java   |  2 +-
 .../leastsquares/DenseWeightedEvaluation.java      |  2 +-
 .../commons/math4/genetics/SelectionPolicy.java    |  2 +-
 .../commons/math4/genetics/UniformCrossover.java   |  2 +-
 .../threed/NotARotationMatrixException.java        |  2 +-
 .../linear/DefaultIterativeLinearSolverEvent.java  |  2 +-
 .../math4/linear/IterativeLinearSolverEvent.java   |  4 +-
 .../commons/math4/linear/RealMatrixFormat.java     |  2 +-
 .../apache/commons/math4/linear/RealVector.java    |  4 +-
 .../commons/math4/linear/RealVectorFormat.java     |  2 +-
 .../math4/linear/SingularValueDecomposition.java   |  2 +-
 .../neuralnet/twod/util/UnifiedDistanceMatrix.java |  2 +-
 .../math4/ode/ContinuousOutputFieldModel.java      |  2 +-
 .../nonstiff/RungeKuttaFieldStepInterpolator.java  |  2 +-
 .../org/apache/commons/math4/optim/MaxEval.java    |  4 +-
 .../org/apache/commons/math4/optim/MaxIter.java    |  2 +-
 .../commons/math4/optim/SimplePointChecker.java    |  2 +-
 .../math4/optim/SimpleVectorValueChecker.java      |  2 +-
 .../scalar/MultivariateFunctionPenaltyAdapter.java |  2 +-
 .../nonlinear/scalar/noderiv/CMAESOptimizer.java   |  2 +-
 .../math4/optim/univariate/BracketFinder.java      |  4 +-
 .../stat/correlation/PearsonsCorrelation.java      |  2 +-
 .../math4/stat/descriptive/moment/Kurtosis.java    |  2 +-
 .../stat/descriptive/moment/SemiVariance.java      |  4 +-
 .../math4/stat/descriptive/moment/Variance.java    |  2 +-
 .../stat/inference/KolmogorovSmirnovTest.java      |  4 +-
 .../apache/commons/math4/util/IntegerSequence.java |  2 +-
 .../org/apache/commons/math4/util/KthSelector.java |  2 +-
 src/site/xdoc/userguide/utilities.xml              |  2 +-
 .../org/apache/commons/math4/PerfTestUtils.java    |  4 +-
 .../analysis/integration/gauss/HermiteTest.java    |  2 +-
 .../org/apache/commons/math4/dfp/DfpDecTest.java   |  2 +-
 .../org/apache/commons/math4/dfp/DfpMathTest.java  |  2 +-
 .../java/org/apache/commons/math4/dfp/DfpTest.java | 48 ++++++-------
 .../distribution/EmpiricalDistributionTest.java    |  4 +-
 .../IntegerDistributionAbstractTest.java           |  4 +-
 ...teNormalMixtureExpectationMaximizationTest.java |  2 +-
 .../math4/genetics/GeneticAlgorithmTestBinary.java |  2 +-
 .../math4/linear/Array2DRowRealMatrixTest.java     |  2 +-
 .../math4/linear/BiDiagonalTransformerTest.java    | 11 ++-
 .../commons/math4/linear/BlockRealMatrixTest.java  |  2 +-
 .../commons/math4/linear/FieldMatrixImplTest.java  |  2 +-
 .../math4/linear/SparseFieldMatrixTest.java        |  2 +-
 .../commons/math4/linear/SparseRealMatrixTest.java |  2 +-
 .../math4/ml/neuralnet/oned/NeuronStringTest.java  | 16 ++---
 .../neuralnet/sofm/TravellingSalesmanSolver.java   | 10 +--
 .../ml/neuralnet/twod/NeuronSquareMesh2DTest.java  | 78 +++++++++++-----------
 .../commons/math4/ode/events/EventStateTest.java   |  2 +-
 .../math4/stat/correlation/CovarianceTest.java     |  2 +-
 .../stat/correlation/KendallsCorrelationTest.java  |  2 +-
 .../stat/correlation/PearsonsCorrelationTest.java  |  2 +-
 .../correlation/SpearmansRankCorrelationTest.java  |  2 +-
 .../stat/correlation/StorelessCovarianceTest.java  |  6 +-
 .../math4/stat/descriptive/ListUnivariateImpl.java |  2 +-
 .../descriptive/rank/PSquarePercentileTest.java    |  2 +-
 .../commons/math4/stat/inference/GTestTest.java    |  6 +-
 .../stat/inference/InferenceTestUtilsTest.java     |  2 +-
 .../stat/inference/WilcoxonSignedRankTestTest.java |  2 +-
 .../regression/MillerUpdatingRegressionTest.java   |  2 +-
 .../OLSMultipleLinearRegressionTest.java           |  2 +-
 .../stat/regression/SimpleRegressionTest.java      |  2 +-
 .../apache/commons/math4/util/MathArraysTest.java  |  4 +-
 .../math4/util/ResizableDoubleArrayTest.java       |  2 +-
 .../commons/math4/userguide/ExampleUtils.java      |  2 +-
 76 files changed, 169 insertions(+), 172 deletions(-)

diff --git a/README.md b/README.md
index 28204f4..36e15e6 100644
--- a/README.md
+++ b/README.md
@@ -98,6 +98,6 @@ Additional Resources
 + [Apache Commons Homepage](https://commons.apache.org/)
 + [Apache Bugtracker (JIRA)](https://issues.apache.org/jira/)
 + [Apache Commons Twitter Account](https://twitter.com/ApacheCommons)
-+ #apachecommons IRC channel on freenode.org
++ `#apache-commons` IRC channel on `irc.freenode.org`
 
 [ml]:https://commons.apache.org/mail-lists.html
diff --git a/src/changes/changes.xml b/src/changes/changes.xml
index 800f66c..a951246 100644
--- a/src/changes/changes.xml
+++ b/src/changes/changes.xml
@@ -3779,7 +3779,7 @@ are simply solved by adjusting the import statements in 
users code.">
         static methods to create instances and execute tests.
       </action>
       <action dev="psteitz" type="update" issue="MATH-95"  due-to="Paul Field">
-        Eliminated repeated endpoint function evalutations in BrentSolver, 
SecantSolver.
+        Eliminated repeated endpoint function evaluations in BrentSolver, 
SecantSolver.
       </action>
       <action dev="psteitz" type="update" issue="MATH-137"  due-to="Rodrigo di 
Lorenzo Lopes">
         Added setSubMatrix methods to RealMatrixImpl, BigMatrixImpl.  To
diff --git 
a/src/main/java/org/apache/commons/math4/analysis/integration/gauss/GaussIntegratorFactory.java
 
b/src/main/java/org/apache/commons/math4/analysis/integration/gauss/GaussIntegratorFactory.java
index 2504692..14a73ef 100644
--- 
a/src/main/java/org/apache/commons/math4/analysis/integration/gauss/GaussIntegratorFactory.java
+++ 
b/src/main/java/org/apache/commons/math4/analysis/integration/gauss/GaussIntegratorFactory.java
@@ -43,7 +43,7 @@ public class GaussIntegratorFactory {
      * The call to the
      * {@link 
GaussIntegrator#integrate(org.apache.commons.math4.analysis.UnivariateFunction)
      * integrate} method will perform an integration on the interval
-     * \([0, +\infty)\): the computed value is the improper integral of
+     * \([0, +\infinity)\): the computed value is the improper integral of
      * \(e^{-x} f(x)\)
      * where \(f(x)\) is the function passed to the
      * {@link 
SymmetricGaussIntegrator#integrate(org.apache.commons.math4.analysis.UnivariateFunction)
@@ -131,7 +131,7 @@ public class GaussIntegratorFactory {
      * The call to the
      * {@link 
SymmetricGaussIntegrator#integrate(org.apache.commons.math4.analysis.UnivariateFunction)
      * integrate} method will perform a weighted integration on the interval
-     * \([-\infty, +\infty]\): the computed value is the improper integral of
+     * \([-\infinity, +\infinity]\): the computed value is the improper 
integral of
      * \(e^{-x^2}f(x)\)
      * where \(f(x)\) is the function passed to the
      * {@link 
SymmetricGaussIntegrator#integrate(org.apache.commons.math4.analysis.UnivariateFunction)
diff --git 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/LoessInterpolator.java
 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/LoessInterpolator.java
index 1209df5..1528eae 100644
--- 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/LoessInterpolator.java
+++ 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/LoessInterpolator.java
@@ -177,7 +177,7 @@ public class LoessInterpolator
      * @throws NotFiniteNumberException if any of the arguments and values are
      * not finite real numbers.
      * @throws NumberIsTooSmallException if the bandwidth is too small to
-     * accomodate the size of the input data (i.e. the bandwidth must be
+     * accommodate the size of the input data (i.e. the bandwidth must be
      * larger than 2/n).
      */
     @Override
@@ -207,7 +207,7 @@ public class LoessInterpolator
      * @throws NotFiniteNumberException if any of the arguments and values are
      not finite real numbers.
      * @throws NumberIsTooSmallException if the bandwidth is too small to
-     * accomodate the size of the input data (i.e. the bandwidth must be
+     * accommodate the size of the input data (i.e. the bandwidth must be
      * larger than 2/n).
      * @since 2.1
      */
@@ -376,7 +376,7 @@ public class LoessInterpolator
      * @throws NotFiniteNumberException if any of the arguments and values are
      * not finite real numbers.
      * @throws NumberIsTooSmallException if the bandwidth is too small to
-     * accomodate the size of the input data (i.e. the bandwidth must be
+     * accommodate the size of the input data (i.e. the bandwidth must be
      * larger than 2/n).
      */
     public final double[] smooth(final double[] xval, final double[] yval)
diff --git 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/TricubicInterpolatingFunction.java
 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/TricubicInterpolatingFunction.java
index d81b664..ca1698b 100644
--- 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/TricubicInterpolatingFunction.java
+++ 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/TricubicInterpolatingFunction.java
@@ -114,7 +114,7 @@ public class TricubicInterpolatingFunction
     private final double[] yval;
     /** Samples z-coordinates */
     private final double[] zval;
-    /** Set of cubic splines pacthing the whole data grid */
+    /** Set of cubic splines patching the whole data grid */
     private final TricubicFunction[][][] splines;
 
     /**
diff --git 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariateInterpolator.java
 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariateInterpolator.java
index 349d22d..93629a9 100644
--- 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariateInterpolator.java
+++ 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariateInterpolator.java
@@ -34,7 +34,7 @@ public interface UnivariateInterpolator {
      * @throws MathIllegalArgumentException
      * if the arguments violate assumptions made by the interpolation
      * algorithm.
-     * @throws DimensionMismatchException if arrays lengthes do not match
+     * @throws DimensionMismatchException if arrays lengths do not match
      */
     UnivariateFunction interpolate(double xval[], double yval[])
         throws MathIllegalArgumentException, DimensionMismatchException;
diff --git 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariatePeriodicInterpolator.java
 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariatePeriodicInterpolator.java
index 5665f8a..d7da5a6 100644
--- 
a/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariatePeriodicInterpolator.java
+++ 
b/src/main/java/org/apache/commons/math4/analysis/interpolation/UnivariatePeriodicInterpolator.java
@@ -50,7 +50,7 @@ public class UnivariatePeriodicInterpolator
      * @param period Period.
      * @param extend Number of points to be appended at the beginning and
      * end of the sample arrays in order to avoid interpolation failure at
-     * the (periodic) boundaries of the orginal interval. The value is the
+     * the (periodic) boundaries of the original interval. The value is the
      * number of sample points which the original {@code interpolator} needs
      * on each side of the interpolated point.
      */
diff --git a/src/main/java/org/apache/commons/math4/complex/ComplexFormat.java 
b/src/main/java/org/apache/commons/math4/complex/ComplexFormat.java
index 8f0aa6f..34fc506 100644
--- a/src/main/java/org/apache/commons/math4/complex/ComplexFormat.java
+++ b/src/main/java/org/apache/commons/math4/complex/ComplexFormat.java
@@ -363,7 +363,7 @@ public class ComplexFormat {
      * Parses a string to produce a {@link Complex} object.
      *
      * @param source the string to parse
-     * @param pos input/ouput parsing parameter.
+     * @param pos input/output parsing parameter.
      * @return the parsed {@link Complex} object.
      */
     public Complex parse(String source, ParsePosition pos) {
diff --git 
a/src/main/java/org/apache/commons/math4/exception/util/LocalizedFormats.java 
b/src/main/java/org/apache/commons/math4/exception/util/LocalizedFormats.java
index f504516..a1281ce 100644
--- 
a/src/main/java/org/apache/commons/math4/exception/util/LocalizedFormats.java
+++ 
b/src/main/java/org/apache/commons/math4/exception/util/LocalizedFormats.java
@@ -303,7 +303,7 @@ public enum LocalizedFormats implements Localizable {
     OVERFLOW_IN_MULTIPLICATION("overflow in multiplication: {0} * {1}"),
     PERCENTILE_IMPLEMENTATION_CANNOT_ACCESS_METHOD("cannot access {0} method 
in percentile implementation {1}"),
     PERCENTILE_IMPLEMENTATION_UNSUPPORTED_METHOD("percentile implementation 
{0} does not support {1}"),
-    PERMUTATION_EXCEEDS_N("permutation size ({0}) exceeds permuation domain 
({1})"), /* keep */
+    PERMUTATION_EXCEEDS_N("permutation size ({0}) exceeds permutation domain 
({1})"), /* keep */
     POLYNOMIAL("polynomial"), /* keep */
     POLYNOMIAL_INTERPOLANTS_MISMATCH_SEGMENTS("number of polynomial 
interpolants must match the number of segments ({0} != {1} - 1)"),
     POPULATION_LIMIT_NOT_POSITIVE("population limit has to be positive"),
@@ -357,7 +357,7 @@ public enum LocalizedFormats implements Localizable {
     VALUES_ADDED_BEFORE_CONFIGURING_STATISTIC("{0} values have been added 
before statistic is configured"),
     VECTOR_LENGTH_MISMATCH("vector length mismatch: got {0} but expected {1}"),
     VECTOR_MUST_HAVE_AT_LEAST_ONE_ELEMENT("vector must have at least one 
element"),
-    WEIGHT_AT_LEAST_ONE_NON_ZERO("weigth array must contain at least one 
non-zero value"),
+    WEIGHT_AT_LEAST_ONE_NON_ZERO("weight array must contain at least one 
non-zero value"),
     WRONG_BLOCK_LENGTH("wrong array shape (block length = {0}, expected {1})"),
     WRONG_NUMBER_OF_POINTS("{0} points are required, got only {1}"),
     NUMBER_OF_POINTS("number of points ({0})"), /* keep */
diff --git 
a/src/main/java/org/apache/commons/math4/fitting/GaussianCurveFitter.java 
b/src/main/java/org/apache/commons/math4/fitting/GaussianCurveFitter.java
index 4af1200..93d99b6 100644
--- a/src/main/java/org/apache/commons/math4/fitting/GaussianCurveFitter.java
+++ b/src/main/java/org/apache/commons/math4/fitting/GaussianCurveFitter.java
@@ -104,7 +104,7 @@ public class GaussianCurveFitter extends 
AbstractCurveFitter {
     private final int maxIter;
 
     /**
-     * Contructor used by the factory methods.
+     * Constructor used by the factory methods.
      *
      * @param initialGuess Initial guess. If set to {@code null}, the initial 
guess
      * will be estimated using the {@link ParameterGuesser}.
diff --git 
a/src/main/java/org/apache/commons/math4/fitting/HarmonicCurveFitter.java 
b/src/main/java/org/apache/commons/math4/fitting/HarmonicCurveFitter.java
index a487781..1f324be 100644
--- a/src/main/java/org/apache/commons/math4/fitting/HarmonicCurveFitter.java
+++ b/src/main/java/org/apache/commons/math4/fitting/HarmonicCurveFitter.java
@@ -55,7 +55,7 @@ public class HarmonicCurveFitter extends AbstractCurveFitter {
     private final int maxIter;
 
     /**
-     * Contructor used by the factory methods.
+     * Constructor used by the factory methods.
      *
      * @param initialGuess Initial guess. If set to {@code null}, the initial 
guess
      * will be estimated using the {@link ParameterGuesser}.
diff --git 
a/src/main/java/org/apache/commons/math4/fitting/PolynomialCurveFitter.java 
b/src/main/java/org/apache/commons/math4/fitting/PolynomialCurveFitter.java
index 6704c16..8fa2085 100644
--- a/src/main/java/org/apache/commons/math4/fitting/PolynomialCurveFitter.java
+++ b/src/main/java/org/apache/commons/math4/fitting/PolynomialCurveFitter.java
@@ -45,7 +45,7 @@ public class PolynomialCurveFitter extends 
AbstractCurveFitter {
     private final int maxIter;
 
     /**
-     * Contructor used by the factory methods.
+     * Constructor used by the factory methods.
      *
      * @param initialGuess Initial guess.
      * @param maxIter Maximum number of iterations of the optimization 
algorithm.
diff --git 
a/src/main/java/org/apache/commons/math4/fitting/SimpleCurveFitter.java 
b/src/main/java/org/apache/commons/math4/fitting/SimpleCurveFitter.java
index 54f6cbf..b693c2d 100644
--- a/src/main/java/org/apache/commons/math4/fitting/SimpleCurveFitter.java
+++ b/src/main/java/org/apache/commons/math4/fitting/SimpleCurveFitter.java
@@ -37,7 +37,7 @@ public class SimpleCurveFitter extends AbstractCurveFitter {
     private final int maxIter;
 
     /**
-     * Contructor used by the factory methods.
+     * Constructor used by the factory methods.
      *
      * @param function Function to fit.
      * @param initialGuess Initial guess. Cannot be {@code null}. Its length 
must
diff --git 
a/src/main/java/org/apache/commons/math4/fitting/leastsquares/DenseWeightedEvaluation.java
 
b/src/main/java/org/apache/commons/math4/fitting/leastsquares/DenseWeightedEvaluation.java
index befea12..4e084a7 100644
--- 
a/src/main/java/org/apache/commons/math4/fitting/leastsquares/DenseWeightedEvaluation.java
+++ 
b/src/main/java/org/apache/commons/math4/fitting/leastsquares/DenseWeightedEvaluation.java
@@ -35,7 +35,7 @@ class DenseWeightedEvaluation extends AbstractEvaluation {
     /**
      * Create a weighted evaluation from an unweighted one.
      *
-     * @param unweighted the evalutation before weights are applied
+     * @param unweighted the evaluation before weights are applied
      * @param weightSqrt the matrix square root of the weight matrix
      */
     DenseWeightedEvaluation(final Evaluation unweighted,
diff --git 
a/src/main/java/org/apache/commons/math4/genetics/SelectionPolicy.java 
b/src/main/java/org/apache/commons/math4/genetics/SelectionPolicy.java
index 156653b..27a073c 100644
--- a/src/main/java/org/apache/commons/math4/genetics/SelectionPolicy.java
+++ b/src/main/java/org/apache/commons/math4/genetics/SelectionPolicy.java
@@ -26,7 +26,7 @@ import 
org.apache.commons.math4.exception.MathIllegalArgumentException;
 public interface SelectionPolicy {
     /**
      * Select two chromosomes from the population.
-     * @param population the population from which the chromosomes are choosen.
+     * @param population the population from which the chromosomes are chosen.
      * @return the selected chromosomes.
      * @throws MathIllegalArgumentException if the population is not 
compatible with this {@link SelectionPolicy}
      */
diff --git 
a/src/main/java/org/apache/commons/math4/genetics/UniformCrossover.java 
b/src/main/java/org/apache/commons/math4/genetics/UniformCrossover.java
index 76c48e0..40b7d99 100644
--- a/src/main/java/org/apache/commons/math4/genetics/UniformCrossover.java
+++ b/src/main/java/org/apache/commons/math4/genetics/UniformCrossover.java
@@ -33,7 +33,7 @@ import org.apache.commons.rng.UniformRandomProvider;
  * suggests that it is more exploratory and results in a larger part of the
  * problem space being searched.
  * <p>
- * This crossover policy evaluates each gene of the parent chromosomes by 
chosing a
+ * This crossover policy evaluates each gene of the parent chromosomes by 
choosing a
  * uniform random number {@code p} in the range [0, 1]. If {@code p} &lt; 
{@code ratio},
  * the parent genes are swapped. This means with a ratio of 0.7, 30% of the 
genes from the
  * first parent and 70% from the second parent will be selected for the first 
offspring (and
diff --git 
a/src/main/java/org/apache/commons/math4/geometry/euclidean/threed/NotARotationMatrixException.java
 
b/src/main/java/org/apache/commons/math4/geometry/euclidean/threed/NotARotationMatrixException.java
index 28be3be..09d00f8 100644
--- 
a/src/main/java/org/apache/commons/math4/geometry/euclidean/threed/NotARotationMatrixException.java
+++ 
b/src/main/java/org/apache/commons/math4/geometry/euclidean/threed/NotARotationMatrixException.java
@@ -35,7 +35,7 @@ public class NotARotationMatrixException
 
     /**
      * Simple constructor.
-     * Build an exception by translating and formating a message
+     * Build an exception by translating and formatting a message
      * @param specifier format specifier (to be translated)
      * @param parts to insert in the format (no translation)
      * @since 2.2
diff --git 
a/src/main/java/org/apache/commons/math4/linear/DefaultIterativeLinearSolverEvent.java
 
b/src/main/java/org/apache/commons/math4/linear/DefaultIterativeLinearSolverEvent.java
index 4c4b7f7..b5f4244 100644
--- 
a/src/main/java/org/apache/commons/math4/linear/DefaultIterativeLinearSolverEvent.java
+++ 
b/src/main/java/org/apache/commons/math4/linear/DefaultIterativeLinearSolverEvent.java
@@ -75,7 +75,7 @@ public class DefaultIterativeLinearSolverEvent extends 
IterativeLinearSolverEven
      * Therefore the user must make sure that these vectors are either
      * unmodifiable views or deep copies of the same vectors actually used by
      * the {@code source}. Failure to do so may compromise subsequent 
iterations
-     * of the {@code source}. Callling {@link #getResidual()} on instances
+     * of the {@code source}. Calling {@link #getResidual()} on instances
      * returned by this constructor throws a
      * {@link MathUnsupportedOperationException}, while
      * {@link #providesResidual()} returns {@code false}.
diff --git 
a/src/main/java/org/apache/commons/math4/linear/IterativeLinearSolverEvent.java 
b/src/main/java/org/apache/commons/math4/linear/IterativeLinearSolverEvent.java
index 94b47ef..fd052be 100644
--- 
a/src/main/java/org/apache/commons/math4/linear/IterativeLinearSolverEvent.java
+++ 
b/src/main/java/org/apache/commons/math4/linear/IterativeLinearSolverEvent.java
@@ -82,8 +82,8 @@ public abstract class IterativeLinearSolverEvent
      * </ul>
      * <p>
      * The default implementation throws a
-     * {@link MathUnsupportedOperationException}. If this method is overriden,
-     * then {@link #providesResidual()} should be overriden as well.
+     * {@link MathUnsupportedOperationException}. If this method is overridden,
+     * then {@link #providesResidual()} should be overridden as well.
      * </p>
      *
      * @return the updated residual, r
diff --git 
a/src/main/java/org/apache/commons/math4/linear/RealMatrixFormat.java 
b/src/main/java/org/apache/commons/math4/linear/RealMatrixFormat.java
index 34c0b0e..ff025f8 100644
--- a/src/main/java/org/apache/commons/math4/linear/RealMatrixFormat.java
+++ b/src/main/java/org/apache/commons/math4/linear/RealMatrixFormat.java
@@ -295,7 +295,7 @@ public class RealMatrixFormat {
      * Parse a string to produce a {@link RealMatrix} object.
      *
      * @param source String to parse.
-     * @param pos input/ouput parsing parameter.
+     * @param pos input/output parsing parameter.
      * @return the parsed {@link RealMatrix} object.
      */
     public RealMatrix parse(String source, ParsePosition pos) {
diff --git a/src/main/java/org/apache/commons/math4/linear/RealVector.java 
b/src/main/java/org/apache/commons/math4/linear/RealVector.java
index 7344f42..d3e35b8 100644
--- a/src/main/java/org/apache/commons/math4/linear/RealVector.java
+++ b/src/main/java/org/apache/commons/math4/linear/RealVector.java
@@ -1082,7 +1082,7 @@ public abstract class RealVector {
      * coordinates.
      * </p>
      * <p>
-     * This method <em>must</em> be overriden by concrete subclasses of
+     * This method <em>must</em> be overridden by concrete subclasses of
      * {@link RealVector} (the current implementation throws an exception).
      * </p>
      *
@@ -1100,7 +1100,7 @@ public abstract class RealVector {
     }
 
     /**
-     * {@inheritDoc}. This method <em>must</em> be overriden by concrete
+     * {@inheritDoc}. This method <em>must</em> be overridden by concrete
      * subclasses of {@link RealVector} (current implementation throws an
      * exception).
      *
diff --git 
a/src/main/java/org/apache/commons/math4/linear/RealVectorFormat.java 
b/src/main/java/org/apache/commons/math4/linear/RealVectorFormat.java
index 2ffb378..67de299 100644
--- a/src/main/java/org/apache/commons/math4/linear/RealVectorFormat.java
+++ b/src/main/java/org/apache/commons/math4/linear/RealVectorFormat.java
@@ -234,7 +234,7 @@ public class RealVectorFormat {
      * Parse a string to produce a {@link RealVector} object.
      *
      * @param source String to parse.
-     * @param pos input/ouput parsing parameter.
+     * @param pos input/output parsing parameter.
      * @return the parsed {@link RealVector} object.
      */
     public ArrayRealVector parse(String source, ParsePosition pos) {
diff --git 
a/src/main/java/org/apache/commons/math4/linear/SingularValueDecomposition.java 
b/src/main/java/org/apache/commons/math4/linear/SingularValueDecomposition.java
index 4d4116e..e35d4e0 100644
--- 
a/src/main/java/org/apache/commons/math4/linear/SingularValueDecomposition.java
+++ 
b/src/main/java/org/apache/commons/math4/linear/SingularValueDecomposition.java
@@ -601,7 +601,7 @@ public class SingularValueDecomposition {
      * Returns the L<sub>2</sub> norm of the matrix.
      * <p>The L<sub>2</sub> norm is max(|A &times; u|<sub>2</sub> /
      * |u|<sub>2</sub>), where |.|<sub>2</sub> denotes the vectorial 2-norm
-     * (i.e. the traditional euclidian norm).</p>
+     * (i.e. the traditional euclidean norm).</p>
      * @return norm
      */
     public double getNorm() {
diff --git 
a/src/main/java/org/apache/commons/math4/ml/neuralnet/twod/util/UnifiedDistanceMatrix.java
 
b/src/main/java/org/apache/commons/math4/ml/neuralnet/twod/util/UnifiedDistanceMatrix.java
index b76e847..0fa2002 100644
--- 
a/src/main/java/org/apache/commons/math4/ml/neuralnet/twod/util/UnifiedDistanceMatrix.java
+++ 
b/src/main/java/org/apache/commons/math4/ml/neuralnet/twod/util/UnifiedDistanceMatrix.java
@@ -123,7 +123,7 @@ public class UnifiedDistanceMatrix implements 
MapVisualization {
         }
 
         // 2.
-        // Fill the bottom-rigth slot of each unit's location with the average
+        // Fill the bottom-right slot of each unit's location with the average
         // of the distances between
         //  * the current unit and its bottom-right neighbour, and
         //  * the bottom-center neighbour and the right neighbour.
diff --git 
a/src/main/java/org/apache/commons/math4/ode/ContinuousOutputFieldModel.java 
b/src/main/java/org/apache/commons/math4/ode/ContinuousOutputFieldModel.java
index 45a5694..c933b82 100644
--- a/src/main/java/org/apache/commons/math4/ode/ContinuousOutputFieldModel.java
+++ b/src/main/java/org/apache/commons/math4/ode/ContinuousOutputFieldModel.java
@@ -165,7 +165,7 @@ public class ContinuousOutputFieldModel<T extends 
RealFieldElement<T>>
 
     /** Check dimensions equality.
      * @param d1 first dimension
-     * @param d2 second dimansion
+     * @param d2 second dimension
      * @exception DimensionMismatchException if dimensions do not match
      */
     private void checkDimensionsEquality(final int d1, final int d2)
diff --git 
a/src/main/java/org/apache/commons/math4/ode/nonstiff/RungeKuttaFieldStepInterpolator.java
 
b/src/main/java/org/apache/commons/math4/ode/nonstiff/RungeKuttaFieldStepInterpolator.java
index 20bff18..1b80197 100644
--- 
a/src/main/java/org/apache/commons/math4/ode/nonstiff/RungeKuttaFieldStepInterpolator.java
+++ 
b/src/main/java/org/apache/commons/math4/ode/nonstiff/RungeKuttaFieldStepInterpolator.java
@@ -132,7 +132,7 @@ abstract class RungeKuttaFieldStepInterpolator<T extends 
RealFieldElement<T>>
     /** Linearly combine arrays.
      * @param a array to add to
      * @param coefficients coefficients to apply to the method staged 
derivatives
-     * @return a itself, as a conveniency for fluent API
+     * @return a itself, as a convenience for fluent API
      */
     @SuppressWarnings("unchecked")
     private T[] combine(final T[] a, final T ... coefficients) {
diff --git a/src/main/java/org/apache/commons/math4/optim/MaxEval.java 
b/src/main/java/org/apache/commons/math4/optim/MaxEval.java
index 2ef4e97..ab080a9 100644
--- a/src/main/java/org/apache/commons/math4/optim/MaxEval.java
+++ b/src/main/java/org/apache/commons/math4/optim/MaxEval.java
@@ -24,11 +24,11 @@ import 
org.apache.commons.math4.exception.NotStrictlyPositiveException;
  * @since 3.1
  */
 public class MaxEval implements OptimizationData {
-    /** Allowed number of evalutations. */
+    /** Allowed number of evaluations. */
     private final int maxEval;
 
     /**
-     * @param max Allowed number of evalutations.
+     * @param max Allowed number of evaluations.
      * @throws NotStrictlyPositiveException if {@code max <= 0}.
      */
     public MaxEval(int max) {
diff --git a/src/main/java/org/apache/commons/math4/optim/MaxIter.java 
b/src/main/java/org/apache/commons/math4/optim/MaxIter.java
index 315359a..5e15d33 100644
--- a/src/main/java/org/apache/commons/math4/optim/MaxIter.java
+++ b/src/main/java/org/apache/commons/math4/optim/MaxIter.java
@@ -24,7 +24,7 @@ import 
org.apache.commons.math4.exception.NotStrictlyPositiveException;
  * @since 3.1
  */
 public class MaxIter implements OptimizationData {
-    /** Allowed number of evalutations. */
+    /** Allowed number of evaluations. */
     private final int maxIter;
 
     /**
diff --git 
a/src/main/java/org/apache/commons/math4/optim/SimplePointChecker.java 
b/src/main/java/org/apache/commons/math4/optim/SimplePointChecker.java
index 6bb1800..c01a1fb 100644
--- a/src/main/java/org/apache/commons/math4/optim/SimplePointChecker.java
+++ b/src/main/java/org/apache/commons/math4/optim/SimplePointChecker.java
@@ -106,7 +106,7 @@ public class SimplePointChecker<PAIR extends Pair<double[], 
? extends Object>>
      * @param iteration Index of current iteration
      * @param previous Best point in the previous iteration.
      * @param current Best point in the current iteration.
-     * @return {@code true} if the arguments satify the convergence criterion.
+     * @return {@code true} if the arguments satisfy the convergence criterion.
      */
     @Override
     public boolean converged(final int iteration,
diff --git 
a/src/main/java/org/apache/commons/math4/optim/SimpleVectorValueChecker.java 
b/src/main/java/org/apache/commons/math4/optim/SimpleVectorValueChecker.java
index 7d31520..375fe44 100644
--- a/src/main/java/org/apache/commons/math4/optim/SimpleVectorValueChecker.java
+++ b/src/main/java/org/apache/commons/math4/optim/SimpleVectorValueChecker.java
@@ -107,7 +107,7 @@ public class SimpleVectorValueChecker
      * @param iteration Index of current iteration
      * @param previous Best point in the previous iteration.
      * @param current Best point in the current iteration.
-     * @return {@code true} if the arguments satify the convergence criterion.
+     * @return {@code true} if the arguments satisfy the convergence criterion.
      */
     @Override
     public boolean converged(final int iteration,
diff --git 
a/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/MultivariateFunctionPenaltyAdapter.java
 
b/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/MultivariateFunctionPenaltyAdapter.java
index 79bd770..ceb4a7a 100644
--- 
a/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/MultivariateFunctionPenaltyAdapter.java
+++ 
b/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/MultivariateFunctionPenaltyAdapter.java
@@ -116,7 +116,7 @@ public class MultivariateFunctionPenaltyAdapter
      * @param offset base offset of the penalty function
      * @param scale scale of the penalty function
      * @exception DimensionMismatchException if lower bounds, upper bounds and
-     * scales are not consistent, either according to dimension or to bounadary
+     * scales are not consistent, either according to dimension or to boundary
      * values
      */
     public MultivariateFunctionPenaltyAdapter(final MultivariateFunction 
bounded,
diff --git 
a/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/noderiv/CMAESOptimizer.java
 
b/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/noderiv/CMAESOptimizer.java
index ffc2dd4..4e20fb6 100644
--- 
a/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/noderiv/CMAESOptimizer.java
+++ 
b/src/main/java/org/apache/commons/math4/optim/nonlinear/scalar/noderiv/CMAESOptimizer.java
@@ -627,7 +627,7 @@ public class CMAESOptimizer
         ccovmuSep = FastMath.min(1 - ccov1, ccovmu * (dimension + 1.5) / 3);
         chiN = FastMath.sqrt(dimension) *
                 (1 - 1 / ((double) 4 * dimension) + 1 / ((double) 21 * 
dimension * dimension));
-        // intialize CMA internal values - updated each generation
+        // initialize CMA internal values - updated each generation
         xmean = MatrixUtils.createColumnRealMatrix(guess); // objective 
variables
         diagD = insigma.scalarMultiply(1 / sigma);
         diagC = square(diagD);
diff --git 
a/src/main/java/org/apache/commons/math4/optim/univariate/BracketFinder.java 
b/src/main/java/org/apache/commons/math4/optim/univariate/BracketFinder.java
index 44e3717..5e00bbf 100644
--- a/src/main/java/org/apache/commons/math4/optim/univariate/BracketFinder.java
+++ b/src/main/java/org/apache/commons/math4/optim/univariate/BracketFinder.java
@@ -215,14 +215,14 @@ public class BracketFinder {
     }
 
     /**
-     * @return the number of evalutations.
+     * @return the number of evaluations.
      */
     public int getMaxEvaluations() {
         return maxEvaluations;
     }
 
     /**
-     * @return the number of evalutations.
+     * @return the number of evaluations.
      */
     public int getEvaluations() {
         return evaluations;
diff --git 
a/src/main/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelation.java
 
b/src/main/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelation.java
index c964d58..7866bed 100644
--- 
a/src/main/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelation.java
+++ 
b/src/main/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelation.java
@@ -132,7 +132,7 @@ public class PearsonsCorrelation {
     /**
      * Returns the correlation matrix.
      *
-     * <p>This method will return null if the argumentless constructor was used
+     * <p>This method will return null if the non-argument constructor was used
      * to create this instance, even if {@link 
#computeCorrelationMatrix(double[][])}
      * has been called before it is activated.</p>
      *
diff --git 
a/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Kurtosis.java 
b/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Kurtosis.java
index a9a0cc5..3046679 100644
--- 
a/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Kurtosis.java
+++ 
b/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Kurtosis.java
@@ -143,7 +143,7 @@ public class Kurtosis extends 
AbstractStorelessUnivariateStatistic  implements S
         return moment.getN();
     }
 
-    /* UnvariateStatistic Approach  */
+    /* UinvariateStatistic Approach  */
 
     /**
      * Returns the kurtosis of the entries in the specified portion of the
diff --git 
a/src/main/java/org/apache/commons/math4/stat/descriptive/moment/SemiVariance.java
 
b/src/main/java/org/apache/commons/math4/stat/descriptive/moment/SemiVariance.java
index 33c0c8e..8d9ae1d 100644
--- 
a/src/main/java/org/apache/commons/math4/stat/descriptive/moment/SemiVariance.java
+++ 
b/src/main/java/org/apache/commons/math4/stat/descriptive/moment/SemiVariance.java
@@ -92,7 +92,7 @@ public class SemiVariance extends AbstractUnivariateStatistic 
implements Seriali
      * property and default (Downside) <code>varianceDirection</code> property.
      *
      * @param biasCorrected  setting for bias correction - true means
-     * bias will be corrected and is equivalent to using the argumentless
+     * bias will be corrected and is equivalent to using the non-argument
      * constructor
      */
     public SemiVariance(final boolean biasCorrected) {
@@ -115,7 +115,7 @@ public class SemiVariance extends 
AbstractUnivariateStatistic implements Seriali
      * property and the specified <code>Direction</code> property.
      *
      * @param corrected  setting for bias correction - true means
-     * bias will be corrected and is equivalent to using the argumentless
+     * bias will be corrected and is equivalent to using the non-argument
      * constructor
      *
      * @param direction  setting for the direction of the SemiVariance
diff --git 
a/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Variance.java 
b/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Variance.java
index 7dfab7d..250cc0f 100644
--- 
a/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Variance.java
+++ 
b/src/main/java/org/apache/commons/math4/stat/descriptive/moment/Variance.java
@@ -118,7 +118,7 @@ public class Variance extends 
AbstractStorelessUnivariateStatistic implements Se
      * property.
      *
      * @param isBiasCorrected  setting for bias correction - true means
-     * bias will be corrected and is equivalent to using the argumentless
+     * bias will be corrected and is equivalent to using the non-argument
      * constructor
      */
     public Variance(boolean isBiasCorrected) {
diff --git 
a/src/main/java/org/apache/commons/math4/stat/inference/KolmogorovSmirnovTest.java
 
b/src/main/java/org/apache/commons/math4/stat/inference/KolmogorovSmirnovTest.java
index 52e28ab..d7a284d 100644
--- 
a/src/main/java/org/apache/commons/math4/stat/inference/KolmogorovSmirnovTest.java
+++ 
b/src/main/java/org/apache/commons/math4/stat/inference/KolmogorovSmirnovTest.java
@@ -862,7 +862,7 @@ public class KolmogorovSmirnovTest {
     }
 
     /**
-     * Computes \( 1 + 2 \sum_{i=1}^\infty (-1)^i e^{-2 i^2 t^2} \) stopping 
when successive partial
+     * Computes \( 1 + 2 \sum_{i=1}^\infinity (-1)^i e^{-2 i^2 t^2} \) 
stopping when successive partial
      * sums are within {@code tolerance} of one another, or when {@code 
maxIterations} partial sums
      * have been computed. If the sum does not converge before {@code 
maxIterations} iterations a
      * {@link TooManyIterationsException} is thrown.
@@ -951,7 +951,7 @@ public class KolmogorovSmirnovTest {
      * {@link #kolmogorovSmirnovStatistic(double[], double[])} for the 
definition of \(D_{n,m}\).
      * <p>
      * Specifically, what is returned is \(1 - k(d \sqrt{mn / (m + n)})\) 
where \(k(t) = 1 + 2
-     * \sum_{i=1}^\infty (-1)^i e^{-2 i^2 t^2}\). See {@link #ksSum(double, 
double, int)} for
+     * \sum_{i=1}^\infinity (-1)^i e^{-2 i^2 t^2}\). See {@link #ksSum(double, 
double, int)} for
      * details on how convergence of the sum is determined.
      * </p>
      *
diff --git a/src/main/java/org/apache/commons/math4/util/IntegerSequence.java 
b/src/main/java/org/apache/commons/math4/util/IntegerSequence.java
index b4db78c..711008e 100644
--- a/src/main/java/org/apache/commons/math4/util/IntegerSequence.java
+++ b/src/main/java/org/apache/commons/math4/util/IntegerSequence.java
@@ -332,7 +332,7 @@ public class IntegerSequence {
          * {@link MaxCountExceededCallback#trigger(int) trigger} method of the
          * callback object passed to the
          * {@link #withCallback(MaxCountExceededCallback)} method.
-         * If not explictly set, a default callback is used that will throw
+         * If not explicitly set, a default callback is used that will throw
          * a {@code MaxCountExceededException}.
          *
          * @throws MaxCountExceededException at counter exhaustion, unless a
diff --git a/src/main/java/org/apache/commons/math4/util/KthSelector.java 
b/src/main/java/org/apache/commons/math4/util/KthSelector.java
index 2820cbf..fc8f4c6 100644
--- a/src/main/java/org/apache/commons/math4/util/KthSelector.java
+++ b/src/main/java/org/apache/commons/math4/util/KthSelector.java
@@ -61,7 +61,7 @@ public class KthSelector implements Serializable {
         this.pivotingStrategy = pivotingStrategy;
     }
 
-    /** Get the pivotin strategy.
+    /** Get the pivoting strategy.
      * @return pivoting strategy
      */
     public PivotingStrategyInterface getPivotingStrategy() {
diff --git a/src/site/xdoc/userguide/utilities.xml 
b/src/site/xdoc/userguide/utilities.xml
index e166e77..f94018a 100644
--- a/src/site/xdoc/userguide/utilities.xml
+++ b/src/site/xdoc/userguide/utilities.xml
@@ -112,7 +112,7 @@
   </p>
   <p>
     Then, to evalute Pi, simply call any of the <code>evalute</code> methods
-    (Note, the point of evalution in this example is meaningless since Pi is a
+    (Note, the point of evaluation in this example is meaningless since Pi is a
     constant).
   </p>
   <p>
diff --git a/src/test/java/org/apache/commons/math4/PerfTestUtils.java 
b/src/test/java/org/apache/commons/math4/PerfTestUtils.java
index f51bf32..4affb70 100644
--- a/src/test/java/org/apache/commons/math4/PerfTestUtils.java
+++ b/src/test/java/org/apache/commons/math4/PerfTestUtils.java
@@ -337,9 +337,9 @@ public class PerfTestUtils {
      * It will shorten package names and remove memory addresses
      * that appear in an instance's name.
      *
-     * @param str Orginal string.
+     * @param str Original string.
      * @param removePackageName Whether package name part of a
-     * fully-quallified name should be removed entirely.
+     * fully-qualified name should be removed entirely.
      * @return the shortened string.
      */
     private static String shorten(String str,
diff --git 
a/src/test/java/org/apache/commons/math4/analysis/integration/gauss/HermiteTest.java
 
b/src/test/java/org/apache/commons/math4/analysis/integration/gauss/HermiteTest.java
index 513b13f..fc07048 100644
--- 
a/src/test/java/org/apache/commons/math4/analysis/integration/gauss/HermiteTest.java
+++ 
b/src/test/java/org/apache/commons/math4/analysis/integration/gauss/HermiteTest.java
@@ -35,7 +35,7 @@ public class HermiteTest {
     public void testNormalDistribution() {
         final double oneOverSqrtPi = 1 / FastMath.sqrt(Math.PI);
 
-        // By defintion, Gauss-Hermite quadrature readily provides the
+        // By definition, Gauss-Hermite quadrature readily provides the
         // integral of the normal distribution density.
         final int numPoints = 1;
 
diff --git a/src/test/java/org/apache/commons/math4/dfp/DfpDecTest.java 
b/src/test/java/org/apache/commons/math4/dfp/DfpDecTest.java
index a454490..7432e1f 100644
--- a/src/test/java/org/apache/commons/math4/dfp/DfpDecTest.java
+++ b/src/test/java/org/apache/commons/math4/dfp/DfpDecTest.java
@@ -62,7 +62,7 @@ public class DfpDecTest {
         b = (b && x.getField().getIEEEFlags() == flags);
 
         if (!b) {
-            Assert.assertTrue("assersion failed "+desc+" x = "+x.toString()+" 
flags = "+x.getField().getIEEEFlags(), b);
+            Assert.assertTrue("assertion failed "+desc+" x = "+x.toString()+" 
flags = "+x.getField().getIEEEFlags(), b);
         }
 
         x.getField().clearIEEEFlags();
diff --git a/src/test/java/org/apache/commons/math4/dfp/DfpMathTest.java 
b/src/test/java/org/apache/commons/math4/dfp/DfpMathTest.java
index b089acd..949114f 100644
--- a/src/test/java/org/apache/commons/math4/dfp/DfpMathTest.java
+++ b/src/test/java/org/apache/commons/math4/dfp/DfpMathTest.java
@@ -72,7 +72,7 @@ public class DfpMathTest {
         b = (b && x.getField().getIEEEFlags() == flags);
 
         if (!b) {
-            Assert.assertTrue("assersion failed "+desc+" x = "+x.toString()+" 
flags = "+x.getField().getIEEEFlags(), b);
+            Assert.assertTrue("assertion failed "+desc+" x = "+x.toString()+" 
flags = "+x.getField().getIEEEFlags(), b);
         }
 
         x.getField().clearIEEEFlags();
diff --git a/src/test/java/org/apache/commons/math4/dfp/DfpTest.java 
b/src/test/java/org/apache/commons/math4/dfp/DfpTest.java
index 01bd54d..63f59ac 100644
--- a/src/test/java/org/apache/commons/math4/dfp/DfpTest.java
+++ b/src/test/java/org/apache/commons/math4/dfp/DfpTest.java
@@ -79,7 +79,7 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         b = (b && x.getField().getIEEEFlags() == flags);
 
         if (!b)
-            Assert.assertTrue("assersion failed "+desc+" x = "+x.toString()+" 
flags = "+x.getField().getIEEEFlags(), b);
+            Assert.assertTrue("assertion failed "+desc+" x = "+x.toString()+" 
flags = "+x.getField().getIEEEFlags(), b);
 
         x.getField().clearIEEEFlags();
     }
@@ -377,25 +377,25 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
     {
         if (op == "equal") {
             if (a.equals(b) != result) {
-                Assert.fail("assersion failed.  "+op+" compare #"+num);
+                Assert.fail("assertion failed.  "+op+" compare #"+num);
             }
         }
 
         if (op == "unequal") {
             if (a.unequal(b) != result) {
-                Assert.fail("assersion failed.  "+op+" compare #"+num);
+                Assert.fail("assertion failed.  "+op+" compare #"+num);
             }
         }
 
         if (op == "lessThan") {
             if (a.lessThan(b) != result) {
-                Assert.fail("assersion failed.  "+op+" compare #"+num);
+                Assert.fail("assertion failed.  "+op+" compare #"+num);
             }
         }
 
         if (op == "greaterThan") {
             if (a.greaterThan(b) != result) {
-                Assert.fail("assersion failed.  "+op+" compare #"+num);
+                Assert.fail("assertion failed.  "+op+" compare #"+num);
             }
         }
     }
@@ -421,14 +421,14 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         cmptst(field.newDfp("0"), field.newDfp("1e-131072"), "equal", false, 
9); // 0 == 1e-131072
         // check flags
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0"), field.newDfp("1e-131078"), "equal", false, 
10); // 0 == 1e-131078
 
         // check flags  -- underflow should be set
         if (field.getIEEEFlags() != DfpField.FLAG_UNDERFLOW) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         field.clearIEEEFlags();
@@ -460,12 +460,12 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         // 100000 == 1.0000000000000001
         cmptst(field.newDfp("1e20"), field.newDfp("1.0000000000000001"), 
"equal", false, 24);
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0.000001"), field.newDfp("1e-6"), "equal", true, 
25);
 
-        // check some nans -- nans shouldnt equal anything
+        // check some nans -- nans shouldn't equal anything
 
         cmptst(snan, snan, "equal", false, 27);
         cmptst(qnan, qnan, "equal", false, 28);
@@ -512,14 +512,14 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         cmptst(field.newDfp("0"), field.newDfp("1e-131072"), "unequal", true, 
9); // 0 == 1e-131072
         // check flags
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0"), field.newDfp("1e-131078"), "unequal", true, 
10); // 0 == 1e-131078
 
         // check flags  -- underflow should be set
         if (field.getIEEEFlags() != DfpField.FLAG_UNDERFLOW) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         field.clearIEEEFlags();
@@ -551,12 +551,12 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         // 100000 == 1.0000000000000001
         cmptst(field.newDfp("1e20"), field.newDfp("1.0000000000000001"), 
"unequal", true, 24);
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0.000001"), field.newDfp("1e-6"), "unequal", 
false, 25);
 
-        // check some nans -- nans shouldnt be unequal to anything
+        // check some nans -- nans shouldn't be unequal to anything
 
         cmptst(snan, snan, "unequal", false, 27);
         cmptst(qnan, qnan, "unequal", false, 28);
@@ -586,7 +586,7 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         cmptst(qnan.negate(), qnan, "unequal", false, 52);
 
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare unequal flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare unequal flags = 
"+field.getIEEEFlags());
         }
 
         //
@@ -607,14 +607,14 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         cmptst(field.newDfp("0"), field.newDfp("1e-131072"), "lessThan", true, 
9); // 0 < 1e-131072
         // check flags
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0"), field.newDfp("1e-131078"), "lessThan", true, 
10); // 0 < 1e-131078
 
         // check flags  -- underflow should be set
         if (field.getIEEEFlags() != DfpField.FLAG_UNDERFLOW) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
         field.clearIEEEFlags();
 
@@ -645,12 +645,12 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         // 100000 < 1.0000000000000001
         cmptst(field.newDfp("1e20"), field.newDfp("1.0000000000000001"), 
"lessThan", false, 24);
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0.000001"), field.newDfp("1e-6"), "lessThan", 
false, 25);
 
-        // check some nans -- nans shouldnt be lessThan to anything
+        // check some nans -- nans shouldn't be lessThan to anything
         cmptst(snan, snan, "lessThan", false, 27);
         cmptst(qnan, qnan, "lessThan", false, 28);
         cmptst(snan, qnan, "lessThan", false, 29);
@@ -680,7 +680,7 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
 
         //lessThan compares with nans should raise FLAG_INVALID
         if (field.getIEEEFlags() != DfpField.FLAG_INVALID) {
-            Assert.fail("assersion failed.  compare lessThan flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare lessThan flags = 
"+field.getIEEEFlags());
         }
         field.clearIEEEFlags();
 
@@ -702,14 +702,14 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         cmptst(field.newDfp("0"), field.newDfp("1e-131072"), "greaterThan", 
false, 9); // 0 > 1e-131072
         // check flags
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0"), field.newDfp("1e-131078"), "greaterThan", 
false, 10); // 0 > 1e-131078
 
         // check flags  -- underflow should be set
         if (field.getIEEEFlags() != DfpField.FLAG_UNDERFLOW) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
         field.clearIEEEFlags();
 
@@ -740,12 +740,12 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
         // 100000 > 1.0000000000000001
         cmptst(field.newDfp("1e20"), field.newDfp("1.0000000000000001"), 
"greaterThan", true, 24);
         if (field.getIEEEFlags() != 0) {
-            Assert.fail("assersion failed.  compare flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare flags = 
"+field.getIEEEFlags());
         }
 
         cmptst(field.newDfp("0.000001"), field.newDfp("1e-6"), "greaterThan", 
false, 25);
 
-        // check some nans -- nans shouldnt be greaterThan to anything
+        // check some nans -- nans shouldn't be greaterThan to anything
         cmptst(snan, snan, "greaterThan", false, 27);
         cmptst(qnan, qnan, "greaterThan", false, 28);
         cmptst(snan, qnan, "greaterThan", false, 29);
@@ -775,7 +775,7 @@ public class DfpTest extends 
ExtendedFieldElementAbstractTest<Dfp> {
 
         //greaterThan compares with nans should raise FLAG_INVALID
         if (field.getIEEEFlags() != DfpField.FLAG_INVALID) {
-            Assert.fail("assersion failed.  compare greaterThan flags = 
"+field.getIEEEFlags());
+            Assert.fail("assertion failed.  compare greaterThan flags = 
"+field.getIEEEFlags());
         }
         field.clearIEEEFlags();
     }
diff --git 
a/src/test/java/org/apache/commons/math4/distribution/EmpiricalDistributionTest.java
 
b/src/test/java/org/apache/commons/math4/distribution/EmpiricalDistributionTest.java
index a7b5825..15b6378 100644
--- 
a/src/test/java/org/apache/commons/math4/distribution/EmpiricalDistributionTest.java
+++ 
b/src/test/java/org/apache/commons/math4/distribution/EmpiricalDistributionTest.java
@@ -91,7 +91,7 @@ public final class EmpiricalDistributionTest extends 
RealDistributionAbstractTes
     }
 
     /**
-     * Test EmpiricalDistrbution.load() using sample data file.<br>
+     * Test EmpiricalDistribution.load() using sample data file.<br>
      * Check that the sampleCount, mu and sigma match data in
      * the sample data file. Also verify that load is idempotent.
      */
@@ -119,7 +119,7 @@ public final class EmpiricalDistributionTest extends 
RealDistributionAbstractTes
     }
 
     /**
-     * Test EmpiricalDistrbution.load(double[]) using data taken from
+     * Test EmpiricalDistribution.load(double[]) using data taken from
      * sample data file.<br>
      * Check that the sampleCount, mu and sigma match data in
      * the sample data file.
diff --git 
a/src/test/java/org/apache/commons/math4/distribution/IntegerDistributionAbstractTest.java
 
b/src/test/java/org/apache/commons/math4/distribution/IntegerDistributionAbstractTest.java
index 8a6e229..09749d9 100644
--- 
a/src/test/java/org/apache/commons/math4/distribution/IntegerDistributionAbstractTest.java
+++ 
b/src/test/java/org/apache/commons/math4/distribution/IntegerDistributionAbstractTest.java
@@ -39,7 +39,7 @@ import org.junit.Test;
  *  makeDensityTestPoints() -- arguments used to test probability density 
calculation
  *  makeDensityTestValues() -- expected probability densities
  *  makeCumulativeTestPoints() -- arguments used to test cumulative 
probabilities
- *  makeCumulativeTestValues() -- expected cumulative probabilites
+ *  makeCumulativeTestValues() -- expected cumulative probabilities
  *  makeInverseCumulativeTestPoints() -- arguments used to test inverse cdf 
evaluation
  *  makeInverseCumulativeTestValues() -- expected inverse cdf values
  * <p>
@@ -241,7 +241,7 @@ public abstract class IntegerDistributionAbstractTest {
     @Test
     public void testConsistencyAtSupportBounds() {
         final int lower = distribution.getSupportLowerBound();
-        Assert.assertEquals("Cumulative probability mmust be 0 below support 
lower bound.",
+        Assert.assertEquals("Cumulative probability must be 0 below support 
lower bound.",
                 0.0, distribution.cumulativeProbability(lower - 1), 0.0);
         Assert.assertEquals("Cumulative probability of support lower bound 
must be equal to probability mass at this point.",
                 distribution.probability(lower), 
distribution.cumulativeProbability(lower), getTolerance());
diff --git 
a/src/test/java/org/apache/commons/math4/distribution/fitting/MultivariateNormalMixtureExpectationMaximizationTest.java
 
b/src/test/java/org/apache/commons/math4/distribution/fitting/MultivariateNormalMixtureExpectationMaximizationTest.java
index f31f4c8..5adb201 100644
--- 
a/src/test/java/org/apache/commons/math4/distribution/fitting/MultivariateNormalMixtureExpectationMaximizationTest.java
+++ 
b/src/test/java/org/apache/commons/math4/distribution/fitting/MultivariateNormalMixtureExpectationMaximizationTest.java
@@ -106,7 +106,7 @@ public class 
MultivariateNormalMixtureExpectationMaximizationTest {
     }
 
     @Test(expected = DimensionMismatchException.class)
-    public void testIncompatibleIntialMixture() {
+    public void testIncompatibleInitialMixture() {
         // Data has 3 columns
         double[][] data = new double[][] {
                 { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 }
diff --git 
a/src/test/java/org/apache/commons/math4/genetics/GeneticAlgorithmTestBinary.java
 
b/src/test/java/org/apache/commons/math4/genetics/GeneticAlgorithmTestBinary.java
index e791c98..fc442d3 100644
--- 
a/src/test/java/org/apache/commons/math4/genetics/GeneticAlgorithmTestBinary.java
+++ 
b/src/test/java/org/apache/commons/math4/genetics/GeneticAlgorithmTestBinary.java
@@ -55,7 +55,7 @@ public class GeneticAlgorithmTestBinary {
         // initialize a new genetic algorithm
         GeneticAlgorithm ga = new GeneticAlgorithm(
                 new OnePointCrossover<Integer>(),
-                CROSSOVER_RATE, // all selected chromosomes will be recombined 
(=crosssover)
+                CROSSOVER_RATE, // all selected chromosomes will be recombined 
(=crossover)
                 new BinaryMutation(),
                 MUTATION_RATE,
                 new TournamentSelection(TOURNAMENT_ARITY)
diff --git 
a/src/test/java/org/apache/commons/math4/linear/Array2DRowRealMatrixTest.java 
b/src/test/java/org/apache/commons/math4/linear/Array2DRowRealMatrixTest.java
index 147e80f..ad17b48 100644
--- 
a/src/test/java/org/apache/commons/math4/linear/Array2DRowRealMatrixTest.java
+++ 
b/src/test/java/org/apache/commons/math4/linear/Array2DRowRealMatrixTest.java
@@ -299,7 +299,7 @@ public final class Array2DRowRealMatrixTest {
         }
     }
 
-    /** test sclarAdd */
+    /** test scalarAdd */
     @Test
     public void testScalarAdd() {
         RealMatrix m = new Array2DRowRealMatrix(testData);
diff --git 
a/src/test/java/org/apache/commons/math4/linear/BiDiagonalTransformerTest.java 
b/src/test/java/org/apache/commons/math4/linear/BiDiagonalTransformerTest.java
index b7d1669..26694e3 100644
--- 
a/src/test/java/org/apache/commons/math4/linear/BiDiagonalTransformerTest.java
+++ 
b/src/test/java/org/apache/commons/math4/linear/BiDiagonalTransformerTest.java
@@ -17,9 +17,6 @@
 
 package org.apache.commons.math4.linear;
 
-import org.apache.commons.math4.linear.BiDiagonalTransformer;
-import org.apache.commons.math4.linear.MatrixUtils;
-import org.apache.commons.math4.linear.RealMatrix;
 import org.apache.commons.math4.util.FastMath;
 import org.junit.Assert;
 import org.junit.Test;
@@ -40,12 +37,12 @@ public class BiDiagonalTransformerTest {
 
     @Test
     public void testDimensions() {
-        checkdimensions(MatrixUtils.createRealMatrix(testSquare));
-        checkdimensions(MatrixUtils.createRealMatrix(testNonSquare));
-        
checkdimensions(MatrixUtils.createRealMatrix(testNonSquare).transpose());
+        checkDimensions(MatrixUtils.createRealMatrix(testSquare));
+        checkDimensions(MatrixUtils.createRealMatrix(testNonSquare));
+        
checkDimensions(MatrixUtils.createRealMatrix(testNonSquare).transpose());
     }
 
-    private void checkdimensions(RealMatrix matrix) {
+    private void checkDimensions(RealMatrix matrix) {
         final int m = matrix.getRowDimension();
         final int n = matrix.getColumnDimension();
         BiDiagonalTransformer transformer = new BiDiagonalTransformer(matrix);
diff --git 
a/src/test/java/org/apache/commons/math4/linear/BlockRealMatrixTest.java 
b/src/test/java/org/apache/commons/math4/linear/BlockRealMatrixTest.java
index 7d3acf1..ce08b43 100644
--- a/src/test/java/org/apache/commons/math4/linear/BlockRealMatrixTest.java
+++ b/src/test/java/org/apache/commons/math4/linear/BlockRealMatrixTest.java
@@ -553,7 +553,7 @@ public final class BlockRealMatrixTest {
             if (reference != null) {
                 Assert.assertEquals(new BlockRealMatrix(reference), sub);
             } else {
-                Assert.fail("Expecting OutOfRangeException or 
NumberIsTooSmallExceptiono r NoDataException");
+                Assert.fail("Expecting OutOfRangeException or 
NumberIsTooSmallException or NoDataException");
             }
         } catch (OutOfRangeException e) {
             if (reference != null) {
diff --git 
a/src/test/java/org/apache/commons/math4/linear/FieldMatrixImplTest.java 
b/src/test/java/org/apache/commons/math4/linear/FieldMatrixImplTest.java
index 98935ad..5b5e097 100644
--- a/src/test/java/org/apache/commons/math4/linear/FieldMatrixImplTest.java
+++ b/src/test/java/org/apache/commons/math4/linear/FieldMatrixImplTest.java
@@ -266,7 +266,7 @@ public final class FieldMatrixImplTest {
         }
     }
 
-    /** test sclarAdd */
+    /** test scalarAdd */
     @Test
     public void testScalarAdd() {
         FieldMatrix<Dfp> m = new Array2DRowFieldMatrix<>(testData);
diff --git 
a/src/test/java/org/apache/commons/math4/linear/SparseFieldMatrixTest.java 
b/src/test/java/org/apache/commons/math4/linear/SparseFieldMatrixTest.java
index 7f34529..94c71fc 100644
--- a/src/test/java/org/apache/commons/math4/linear/SparseFieldMatrixTest.java
+++ b/src/test/java/org/apache/commons/math4/linear/SparseFieldMatrixTest.java
@@ -249,7 +249,7 @@ public class SparseFieldMatrixTest {
         }
     }
 
-    /** test sclarAdd */
+    /** test scalarAdd */
     @Test
     public void testScalarAdd() {
         FieldMatrix<Dfp> m = createSparseMatrix(testData);
diff --git 
a/src/test/java/org/apache/commons/math4/linear/SparseRealMatrixTest.java 
b/src/test/java/org/apache/commons/math4/linear/SparseRealMatrixTest.java
index 9a1afa4..9356927 100644
--- a/src/test/java/org/apache/commons/math4/linear/SparseRealMatrixTest.java
+++ b/src/test/java/org/apache/commons/math4/linear/SparseRealMatrixTest.java
@@ -246,7 +246,7 @@ public final class SparseRealMatrixTest {
         }
     }
 
-    /** test sclarAdd */
+    /** test scalarAdd */
     @Test
     public void testScalarAdd() {
         RealMatrix m = createSparseMatrix(testData);
diff --git 
a/src/test/java/org/apache/commons/math4/ml/neuralnet/oned/NeuronStringTest.java
 
b/src/test/java/org/apache/commons/math4/ml/neuralnet/oned/NeuronStringTest.java
index 5871956..dbe5976 100644
--- 
a/src/test/java/org/apache/commons/math4/ml/neuralnet/oned/NeuronStringTest.java
+++ 
b/src/test/java/org/apache/commons/math4/ml/neuralnet/oned/NeuronStringTest.java
@@ -57,7 +57,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 1 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(1, neighbours.size());
 
         // Neuron 1.
@@ -65,7 +65,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 0, 2 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(2, neighbours.size());
 
         // Neuron 2.
@@ -73,7 +73,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 1, 3 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(2, neighbours.size());
 
         // Neuron 3.
@@ -81,7 +81,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 2 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(1, neighbours.size());
     }
 
@@ -102,7 +102,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 1, 3 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(2, neighbours.size());
 
         // Neuron 1.
@@ -110,7 +110,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 0, 2 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(2, neighbours.size());
 
         // Neuron 2.
@@ -118,7 +118,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 1, 3 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(2, neighbours.size());
 
         // Neuron 3.
@@ -126,7 +126,7 @@ public class NeuronStringTest {
         for (long nId : new long[] { 0, 2 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(2, neighbours.size());
     }
 
diff --git 
a/src/test/java/org/apache/commons/math4/ml/neuralnet/sofm/TravellingSalesmanSolver.java
 
b/src/test/java/org/apache/commons/math4/ml/neuralnet/sofm/TravellingSalesmanSolver.java
index bd24f4a..c2fc0fe 100644
--- 
a/src/test/java/org/apache/commons/math4/ml/neuralnet/sofm/TravellingSalesmanSolver.java
+++ 
b/src/test/java/org/apache/commons/math4/ml/neuralnet/sofm/TravellingSalesmanSolver.java
@@ -142,7 +142,7 @@ public class TravellingSalesmanSolver {
     /**
      * Measures the network's concurrent update performance.
      *
-     * @return the ratio between the number of succesful network updates
+     * @return the ratio between the number of successful network updates
      * and the number of update attempts.
      */
     public double getUpdateRatio() {
@@ -303,8 +303,8 @@ public class TravellingSalesmanSolver {
      * Computes the largest distance between the point at coordinates
      * {@code (x, y)} and any of the cities.
      *
-     * @param x x-coodinate.
-     * @param y y-coodinate.
+     * @param x x-coordinate.
+     * @param y y-coordinate.
      * @param cities City list.
      * @return the largest distance.
      */
@@ -394,8 +394,8 @@ class City {
      * Computes the distance between this city and
      * the given point.
      *
-     * @param x x-coodinate.
-     * @param y y-coodinate.
+     * @param x x-coordinate.
+     * @param y y-coordinate.
      * @return the distance between {@code (x, y)} and this
      * city.
      */
diff --git 
a/src/test/java/org/apache/commons/math4/ml/neuralnet/twod/NeuronSquareMesh2DTest.java
 
b/src/test/java/org/apache/commons/math4/ml/neuralnet/twod/NeuronSquareMesh2DTest.java
index 8337175..1c58b93 100644
--- 
a/src/test/java/org/apache/commons/math4/ml/neuralnet/twod/NeuronSquareMesh2DTest.java
+++ 
b/src/test/java/org/apache/commons/math4/ml/neuralnet/twod/NeuronSquareMesh2DTest.java
@@ -99,7 +99,7 @@ public class NeuronSquareMesh2DTest {
             for (long nId : new long[] { 1, 2 }) {
                 Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
             }
-            // Ensures that no other neurons is in the neihbourhood set.
+            // Ensures that no other neurons is in the neighbourhood set.
             Assert.assertEquals(2, neighbours.size());
         }
 
@@ -109,7 +109,7 @@ public class NeuronSquareMesh2DTest {
             for (long nId : new long[] { 0, 3 }) {
                 Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
             }
-            // Ensures that no other neurons is in the neihbourhood set.
+            // Ensures that no other neurons is in the neighbourhood set.
             Assert.assertEquals(2, neighbours.size());
         }
     }
@@ -164,7 +164,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 2, 3 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 1.
@@ -172,7 +172,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 2, 4 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 2.
@@ -180,7 +180,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 5 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 3.
@@ -188,7 +188,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 4, 5 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 4.
@@ -196,7 +196,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 3, 5 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 5.
@@ -204,7 +204,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 2, 3, 4 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
     }
 
@@ -262,7 +262,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 2, 3, 6 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 1.
@@ -270,7 +270,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 2, 4, 7 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 2.
@@ -278,7 +278,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 5, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 3.
@@ -286,7 +286,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 4, 5, 6 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 4.
@@ -294,7 +294,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 3, 5, 7 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 5.
@@ -302,7 +302,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 2, 3, 4, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 6.
@@ -310,7 +310,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 3, 7, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 7.
@@ -318,7 +318,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 4, 6, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // Neuron 8.
@@ -326,7 +326,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 2, 5, 6, 7 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
     }
 
@@ -387,7 +387,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 2, 3, 4, 5}) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 1.
@@ -395,7 +395,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 2, 3, 4, 5 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 2.
@@ -403,7 +403,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 3, 4, 5 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 3.
@@ -411,7 +411,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 2, 4, 5, 6, 7, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(8, neighbours.size());
 
         // Neuron 4.
@@ -419,7 +419,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 2, 3, 5, 6, 7, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(8, neighbours.size());
 
         // Neuron 5.
@@ -427,7 +427,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 2, 3, 4, 6, 7, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(8, neighbours.size());
 
         // Neuron 6.
@@ -435,7 +435,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 3, 4, 5, 7, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 7.
@@ -443,7 +443,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 3, 4, 5, 6, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 8.
@@ -451,7 +451,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 3, 4, 5, 6, 7 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
     }
 
@@ -480,7 +480,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 3, 4}) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 1.
@@ -488,7 +488,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 2, 3, 4, 5 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 2.
@@ -496,7 +496,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 4, 5 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 3.
@@ -504,7 +504,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 4, 6, 7 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 4.
@@ -512,7 +512,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 0, 1, 2, 3, 5, 6, 7, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(8, neighbours.size());
 
         // Neuron 5.
@@ -520,7 +520,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 2, 4, 7, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 6.
@@ -528,7 +528,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 3, 4, 7 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
 
         // Neuron 7.
@@ -536,7 +536,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 3, 4, 5, 6, 8 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(5, neighbours.size());
 
         // Neuron 8.
@@ -544,7 +544,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 4, 5, 7 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(3, neighbours.size());
     }
 
@@ -581,7 +581,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 7, 11, 13, 17 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(4, neighbours.size());
 
         // 1. Add the neuron to the "exclude" list.
@@ -593,7 +593,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 6, 8, 16, 18, 2, 10, 14, 22 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(8, neighbours.size());
     }
 
@@ -630,7 +630,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 2, 3, 4, 7, 9, 12, 13, 14 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(8, neighbours.size());
 
         // 1. Add the neuron to the "exclude" list.
@@ -642,7 +642,7 @@ public class NeuronSquareMesh2DTest {
         for (long nId : new long[] { 1, 6, 11, 16, 17, 18, 19, 15, 10, 5, 0, 
20, 24, 23, 22, 21 }) {
             Assert.assertTrue(neighbours.contains(net.getNeuron(nId)));
         }
-        // Ensures that no other neurons is in the neihbourhood set.
+        // Ensures that no other neurons is in the neighbourhood set.
         Assert.assertEquals(16, neighbours.size());
     }
 
diff --git 
a/src/test/java/org/apache/commons/math4/ode/events/EventStateTest.java 
b/src/test/java/org/apache/commons/math4/ode/events/EventStateTest.java
index cd13861..edfd5d5 100644
--- a/src/test/java/org/apache/commons/math4/ode/events/EventStateTest.java
+++ b/src/test/java/org/apache/commons/math4/ode/events/EventStateTest.java
@@ -134,7 +134,7 @@ public class EventStateTest {
             // to be called at obsolete times t despite an event
             // occurring later has already been triggered.
             // When this occurs, the following assertion is violated
-            Assert.assertTrue("going backard in time! (" + t + " < " + 
lastTriggerTime + ")",
+            Assert.assertTrue("going backward in time! (" + t + " < " + 
lastTriggerTime + ")",
                               t >= lastTriggerTime);
             return t - tEvent;
         }
diff --git 
a/src/test/java/org/apache/commons/math4/stat/correlation/CovarianceTest.java 
b/src/test/java/org/apache/commons/math4/stat/correlation/CovarianceTest.java
index de67cff..b9cdf7b 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/correlation/CovarianceTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/correlation/CovarianceTest.java
@@ -110,7 +110,7 @@ public class CovarianceTest {
      * http://www.itl.nist.gov/div898/strd/lls/data/LINKS/DATA/Longley.dat
      */
     @Test
-    public void testLongly() {
+    public void testLongley() {
         RealMatrix matrix = createRealMatrix(longleyData, 16, 7);
         RealMatrix covarianceMatrix = new 
Covariance(matrix).getCovarianceMatrix();
         double[] rData = new double[] {
diff --git 
a/src/test/java/org/apache/commons/math4/stat/correlation/KendallsCorrelationTest.java
 
b/src/test/java/org/apache/commons/math4/stat/correlation/KendallsCorrelationTest.java
index 6e751c8..715415b 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/correlation/KendallsCorrelationTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/correlation/KendallsCorrelationTest.java
@@ -45,7 +45,7 @@ public class KendallsCorrelationTest extends 
PearsonsCorrelationTest {
      */
     @Override
     @Test
-    public void testLongly() {
+    public void testLongley() {
         RealMatrix matrix = createRealMatrix(longleyData, 16, 7);
         KendallsCorrelation corrInstance = new KendallsCorrelation(matrix);
         RealMatrix correlationMatrix = corrInstance.getCorrelationMatrix();
diff --git 
a/src/test/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelationTest.java
 
b/src/test/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelationTest.java
index 08dbabc..9dcf09e 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelationTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/correlation/PearsonsCorrelationTest.java
@@ -104,7 +104,7 @@ public class PearsonsCorrelationTest {
      * Test Longley dataset against R.
      */
     @Test
-    public void testLongly() {
+    public void testLongley() {
         RealMatrix matrix = createRealMatrix(longleyData, 16, 7);
         PearsonsCorrelation corrInstance = new PearsonsCorrelation(matrix);
         RealMatrix correlationMatrix = corrInstance.getCorrelationMatrix();
diff --git 
a/src/test/java/org/apache/commons/math4/stat/correlation/SpearmansRankCorrelationTest.java
 
b/src/test/java/org/apache/commons/math4/stat/correlation/SpearmansRankCorrelationTest.java
index 20cacd9..0e25f8b 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/correlation/SpearmansRankCorrelationTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/correlation/SpearmansRankCorrelationTest.java
@@ -39,7 +39,7 @@ public class SpearmansRankCorrelationTest extends 
PearsonsCorrelationTest {
      */
     @Override
     @Test
-    public void testLongly() {
+    public void testLongley() {
         RealMatrix matrix = createRealMatrix(longleyData, 16, 7);
         SpearmansCorrelation corrInstance = new SpearmansCorrelation(matrix);
         RealMatrix correlationMatrix = corrInstance.getCorrelationMatrix();
diff --git 
a/src/test/java/org/apache/commons/math4/stat/correlation/StorelessCovarianceTest.java
 
b/src/test/java/org/apache/commons/math4/stat/correlation/StorelessCovarianceTest.java
index 8f4f851..8e6bc13 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/correlation/StorelessCovarianceTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/correlation/StorelessCovarianceTest.java
@@ -117,7 +117,7 @@ public class StorelessCovarianceTest {
     };
 
     @Test
-    public void testLonglySimpleVar(){
+    public void testLongleySimpleVar(){
         double rCov = 12333921.73333333246;
         StorelessBivariateCovariance cov = new StorelessBivariateCovariance();
         for(int i=0;i<longleyDataSimple.length;i++){
@@ -127,7 +127,7 @@ public class StorelessCovarianceTest {
     }
 
     @Test
-    public void testLonglySimpleCov(){
+    public void testLongleySimpleCov(){
         double rCov = 36796.660000;
         StorelessBivariateCovariance cov = new StorelessBivariateCovariance();
         for(int i=0;i<longleyDataSimple.length;i++){
@@ -147,7 +147,7 @@ public class StorelessCovarianceTest {
      * http://www.itl.nist.gov/div898/strd/lls/data/LINKS/DATA/Longley.dat
      */
     @Test
-    public void testLonglyByRow() {
+    public void testLongleyByRow() {
         RealMatrix matrix = createRealMatrix(longleyData, 16, 7);
 
         double[] rData = new double[] {
diff --git 
a/src/test/java/org/apache/commons/math4/stat/descriptive/ListUnivariateImpl.java
 
b/src/test/java/org/apache/commons/math4/stat/descriptive/ListUnivariateImpl.java
index 19b9b9f..cf15b93 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/descriptive/ListUnivariateImpl.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/descriptive/ListUnivariateImpl.java
@@ -78,7 +78,7 @@ public class ListUnivariateImpl extends DescriptiveStatistics 
implements Seriali
         // If the window size is not INFINITE_WINDOW AND
         // the current list is larger that the window size, we need to
         // take into account only the last n elements of the list
-        // as definied by windowSize
+        // as defined by windowSize
 
         final int wSize = getWindowSize();
         if (wSize != DescriptiveStatistics.INFINITE_WINDOW && wSize < 
list.size()) {
diff --git 
a/src/test/java/org/apache/commons/math4/stat/descriptive/rank/PSquarePercentileTest.java
 
b/src/test/java/org/apache/commons/math4/stat/descriptive/rank/PSquarePercentileTest.java
index ea985dd..b15499b 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/descriptive/rank/PSquarePercentileTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/descriptive/rank/PSquarePercentileTest.java
@@ -133,7 +133,7 @@ public class PSquarePercentileTest extends
 
     @Test(expected = MathIllegalArgumentException.class)
     public void testNullListInMarkers() {
-        // In case of null list Markers cannot be instantiated..is geting
+        // In case of null list Markers cannot be instantiated..is getting
         // verified
         // new Markers(null, 0, PSquarePercentile.newEstimator());
         PSquarePercentile.newMarkers(null, 0);
diff --git 
a/src/test/java/org/apache/commons/math4/stat/inference/GTestTest.java 
b/src/test/java/org/apache/commons/math4/stat/inference/GTestTest.java
index 3d11e8b..235224d 100644
--- a/src/test/java/org/apache/commons/math4/stat/inference/GTestTest.java
+++ b/src/test/java/org/apache/commons/math4/stat/inference/GTestTest.java
@@ -93,7 +93,7 @@ public class GTestTest {
     }
 
     @Test
-    public void testGTestIndependance1() throws Exception {
+    public void testGTestIndependence1() throws Exception {
         final long[] obs1 = new long[]{
             268, 199, 42
         };
@@ -113,7 +113,7 @@ public class GTestTest {
     }
 
     @Test
-    public void testGTestIndependance2() throws Exception {
+    public void testGTestIndependence2() throws Exception {
         final long[] obs1 = new long[]{
             127, 99, 264
         };
@@ -133,7 +133,7 @@ public class GTestTest {
     }
 
     @Test
-    public void testGTestIndependance3() throws Exception {
+    public void testGTestIndependence3() throws Exception {
         final long[] obs1 = new long[]{
             190, 149
         };
diff --git 
a/src/test/java/org/apache/commons/math4/stat/inference/InferenceTestUtilsTest.java
 
b/src/test/java/org/apache/commons/math4/stat/inference/InferenceTestUtilsTest.java
index 6b9f1b7..a193e46 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/inference/InferenceTestUtilsTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/inference/InferenceTestUtilsTest.java
@@ -487,7 +487,7 @@ public class InferenceTestUtilsTest {
 }
 
     @Test
-    public void testGTestIndependance() throws Exception {
+    public void testGTestIndependence() throws Exception {
         long[] obs1 = new long[]{
             268, 199, 42
         };
diff --git 
a/src/test/java/org/apache/commons/math4/stat/inference/WilcoxonSignedRankTestTest.java
 
b/src/test/java/org/apache/commons/math4/stat/inference/WilcoxonSignedRankTestTest.java
index 335f5ce..8f39848 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/inference/WilcoxonSignedRankTestTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/inference/WilcoxonSignedRankTestTest.java
@@ -117,7 +117,7 @@ public class WilcoxonSignedRankTestTest {
             // expected
         }
 
-        /* Samples not same size, i.e. cannot be pairred
+        /* Samples not same size, i.e. cannot be paired
          */
         try {
             testStatistic.wilcoxonSignedRankTest(new double[] { 1.0, 2.0 }, 
new double[] { 3.0 }, true);
diff --git 
a/src/test/java/org/apache/commons/math4/stat/regression/MillerUpdatingRegressionTest.java
 
b/src/test/java/org/apache/commons/math4/stat/regression/MillerUpdatingRegressionTest.java
index 01065db..d7184a7 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/regression/MillerUpdatingRegressionTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/regression/MillerUpdatingRegressionTest.java
@@ -629,7 +629,7 @@ public class MillerUpdatingRegressionTest {
      * http://www.itl.nist.gov/div898/strd/lls/data/LINKS/DATA/Longley.dat
      */
     @Test
-    public void testLongly() {
+    public void testLongley() {
         // Y values are first, then independent vars
         // Each row is one observation
         double[] design = new double[]{
diff --git 
a/src/test/java/org/apache/commons/math4/stat/regression/OLSMultipleLinearRegressionTest.java
 
b/src/test/java/org/apache/commons/math4/stat/regression/OLSMultipleLinearRegressionTest.java
index 16001d1..b253c38 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/regression/OLSMultipleLinearRegressionTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/regression/OLSMultipleLinearRegressionTest.java
@@ -116,7 +116,7 @@ public class OLSMultipleLinearRegressionTest extends 
MultipleLinearRegressionAbs
      * http://www.itl.nist.gov/div898/strd/lls/data/LINKS/DATA/Longley.dat
      */
     @Test
-    public void testLongly() {
+    public void testLongley() {
         // Y values are first, then independent vars
         // Each row is one observation
         double[] design = new double[] {
diff --git 
a/src/test/java/org/apache/commons/math4/stat/regression/SimpleRegressionTest.java
 
b/src/test/java/org/apache/commons/math4/stat/regression/SimpleRegressionTest.java
index 437b6c5..bd793b8 100644
--- 
a/src/test/java/org/apache/commons/math4/stat/regression/SimpleRegressionTest.java
+++ 
b/src/test/java/org/apache/commons/math4/stat/regression/SimpleRegressionTest.java
@@ -39,7 +39,7 @@ import org.junit.Test;
 public final class SimpleRegressionTest {
 
     /*
-     * NIST "Norris" refernce data set from
+     * NIST "Norris" reference data set from
      * http://www.itl.nist.gov/div898/strd/lls/data/LINKS/DATA/Norris.dat
      * Strangely, order is {y,x}
      */
diff --git a/src/test/java/org/apache/commons/math4/util/MathArraysTest.java 
b/src/test/java/org/apache/commons/math4/util/MathArraysTest.java
index b20b996..3d53a72 100644
--- a/src/test/java/org/apache/commons/math4/util/MathArraysTest.java
+++ b/src/test/java/org/apache/commons/math4/util/MathArraysTest.java
@@ -469,7 +469,7 @@ public class MathArraysTest {
     }
 
     @Test
-    public void testSortInPlaceDecresasingOrder() {
+    public void testSortInPlaceDecreasingOrder() {
         final double[] x1 = {2,   5,  -3, 1,  4};
         final double[] x2 = {4,  25,   9, 1, 16};
         final double[] x3 = {8, 125, -27, 1, 64};
@@ -793,7 +793,7 @@ public class MathArraysTest {
     }
 
     @Test
-    public void testConcatentateSingle() {
+    public void testConcatenateSingle() {
         final double[] x = new double[] {0, 1, 2};
         Assert.assertArrayEquals(x, MathArrays.concatenate(x), 0);
     }
diff --git 
a/src/test/java/org/apache/commons/math4/util/ResizableDoubleArrayTest.java 
b/src/test/java/org/apache/commons/math4/util/ResizableDoubleArrayTest.java
index f88a283..88373e8 100644
--- a/src/test/java/org/apache/commons/math4/util/ResizableDoubleArrayTest.java
+++ b/src/test/java/org/apache/commons/math4/util/ResizableDoubleArrayTest.java
@@ -463,7 +463,7 @@ public class ResizableDoubleArrayTest extends 
DoubleArrayAbstractTest {
         // Reflexive
         Assert.assertTrue(first.equals(first));
 
-        // Argumentless constructor
+        // Non-argument constructor
         ResizableDoubleArray second = new ResizableDoubleArray();
         verifyEquality(first, second);
 
diff --git 
a/src/userguide/java/org/apache/commons/math4/userguide/ExampleUtils.java 
b/src/userguide/java/org/apache/commons/math4/userguide/ExampleUtils.java
index dddc96c..2825589 100644
--- a/src/userguide/java/org/apache/commons/math4/userguide/ExampleUtils.java
+++ b/src/userguide/java/org/apache/commons/math4/userguide/ExampleUtils.java
@@ -43,7 +43,7 @@ public class ExampleUtils {
         /**
          * Returns the main panel which should be printed by the screenshot 
action.
          * <p>
-         * By default, it returns the content pane of this frame, but can be 
overriden
+         * By default, it returns the content pane of this frame, but can be 
overridden
          * in case the frame has a global scroll pane which would cut off any 
offscreen content. 
          *
          * @return the main panel to print

Reply via email to