Repository: gonum/gonum (language: go)

Issue:
typos
I decline to appear in AUTHORS/CONTRIBUTORS.

Cancellation
Suppress
capacity
distribution
information
maximal
moderately

```
$ grep -nr Cancelation gonum
gonum/internal/cmplx64/sqrt.go:47:// Cancelation error in r-x or r+x is avoided by using the
$ grep -nr Supress gonum
gonum/graph/formats/rdf/testdata/mk_manifest.rb:180:  ["--quiet",         GetoptLong::NO_ARGUMENT,      "Supress most output other than progress indicators"],
$ grep -nr capacty gonum
gonum/mat/vector_test.go:121:                   t.Errorf("unexpected capacty for test %d: got: %d want: %d", i, got, test.want)
$ grep -nr distributon gonum
gonum/stat/distmv/uniform.go:158:// Rand generates a random sample according to the distributon.
gonum/stat/distmv/dirichlet.go:137:// Rand generates a random number according to the distributon.
gonum/stat/distmv/interfaces.go:21:// Rander generates a random number according to the distributon.
gonum/stat/distmv/studentst.go:334:// Rand generates a random sample according to the distributon.
gonum/stat/distmv/normal.go:297:// Rand generates a random sample according to the distributon.
gonum/stat/distmv/normal.go:306:// NormalRand generates a random sample from a multivariate normal distributon
$ grep -nr informations gonum
gonum/mathext/beta.go:21:// See http://mathworld.wolfram.com/BetaFunction.html for more detailed informations.
$ grep -nr maximimal gonum
gonum/README.md:46:- tomita — use [Tomita, Tanaka, Takahashi pivot choice](https://doi.org/10.1016%2Fj.tcs.2006.06.015) for maximimal clique calculation, otherwise use random pivot (only in [topo package](https://pkg.go.dev/gonum.org/v1/gonum/graph/topo))
$ grep -nr moderatly gonum
gonum/optimize/functions/functions.go:713://     minimization problems of moderatly large size. Towards Global
gonum/optimize/functions/functions.go:1337://     minimization problems of moderatly large size. Towards Global
$
```

guess these should be relationship and stratified

```
$ ed -s gonum/graph/product/product_ext_example_test.go <<<'55,64p'
        // Make a graph for the query pattern: a love triangle.
        pattern := simple.NewDirectedGraph()
        for _, relationsip := range []simple.WeightedEdge{
                {F: person{name: "A", id: -1}, T: person{name: "B", id: -2}, W: 1},
                {F: person{name: "B", id: -2}, T: person{name: "A", id: -1}, W: 1},
                {F: person{name: "C", id: -3}, T: person{name: "A", id: -1}, W: -1},
                {F: person{name: "C", id: -3}, T: person{name: "B", id: -2}, W: 1},
        } {
                pattern.SetEdge(relationsip)
        }
$ ed -s gonum/stat/samplemv/halton_test.go <<<'31,34p'
                // In each dimension, the samples should be stratefied according to the
                // prime for that dimension. There should be at most 1 sample per
                // 1/b^k block, where k is log(n)/log(b).
                for d := 0; d < test.d; d++ {
$

```

`https://www.netlib.org/amos/zairy.f`

```
$ grep -nr netlib.no gonum
gonum/mathext/internal/amos/origcode_test.go:26:        // http://www.netlib.no/netlib/amos/zairy.f
gonum/mathext/internal/amos/amos.go:33: // http://www.netlib.no/netlib/amos/zairy.f
$
```

WON'T FIX

```
$ grep -nr DEFINTIONS gonum
gonum/mathext/internal/amos/origcode_test.go:50:                C         DEFINTIONS AND NOTATION ARE FOUND IN THE NBS HANDBOOK OF
gonum/mathext/internal/amos/amos.go:57:         C         DEFINTIONS AND NOTATION ARE FOUND IN THE NBS HANDBOOK OF
gonum/mathext/internal/amos/amoslib/zairy.f:22:C         DEFINTIONS AND NOTATION ARE FOUND IN THE NBS HANDBOOK OF
gonum/mathext/internal/amos/amoslib/zbiry.f:18:C         DEFINTIONS AND NOTATION ARE FOUND IN THE NBS HANDBOOK OF
$ grep -nr FUNCIONS gonum
gonum/mathext/internal/amos/amoslib/zunk2.f:294:C     CSPN AND CSGN ARE COEFF OF K AND I FUNCIONS RESP.
$ grep -nr IMTERMEDIATE gonum
gonum/mathext/internal/amos/amoslib/zbesi.f:67:C         NEUMANN SERIES FOR IMTERMEDIATE MAGNITUDES, AND THE
$ 
```


Discussion / hints:

Fix patch:
diff --git a/README.md b/README.md
index b01b9e1ef..9c90a76fe 100644
--- a/README.md
+++ b/README.md
@@ -43,7 +43,7 @@ The current list of non-internal tags is as follows:
 - safe — do not use assembly or unsafe
 - bounds — use bounds checks even in internal calls
 - noasm — do not use assembly implementations
-- tomita — use [Tomita, Tanaka, Takahashi pivot choice](https://doi.org/10.1016%2Fj.tcs.2006.06.015) for maximimal clique calculation, otherwise use random pivot (only in [topo package](https://pkg.go.dev/gonum.org/v1/gonum/graph/topo))
+- tomita — use [Tomita, Tanaka, Takahashi pivot choice](https://doi.org/10.1016%2Fj.tcs.2006.06.015) for maximal clique calculation, otherwise use random pivot (only in [topo package](https://pkg.go.dev/gonum.org/v1/gonum/graph/topo))
 
 
 ## Issues [![TODOs](https://badgen.net/https/api.tickgit.com/badgen/github.com/gonum/gonum)](https://www.tickgit.com/browse?repo=github.com/gonum/gonum)
diff --git a/mathext/beta.go b/mathext/beta.go
index 203ec5779..2df51f3dd 100644
--- a/mathext/beta.go
+++ b/mathext/beta.go
@@ -18,7 +18,7 @@ import "gonum.org/v1/gonum/mathext/internal/gonum"
 //	B(a,b) returns NaN if a or b is < 0
 //	B(a,b) returns +Inf if a xor b is 0.
 //
-// See http://mathworld.wolfram.com/BetaFunction.html for more detailed informations.
+// See http://mathworld.wolfram.com/BetaFunction.html for more detailed information.
 func Beta(a, b float64) float64 {
 	return gonum.Beta(a, b)
 }
diff --git a/optimize/functions/functions.go b/optimize/functions/functions.go
index 233d71dc2..d3ae55a07 100644
--- a/optimize/functions/functions.go
+++ b/optimize/functions/functions.go
@@ -710,7 +710,7 @@ func (BrownAndDennis) Minima() []Minimum {
 //
 // References:
 //   - Spedicato E.: Computational experience with quasi-Newton algorithms for
-//     minimization problems of moderatly large size. Towards Global
+//     minimization problems of moderately large size. Towards Global
 //     Optimization 2 (1978), 209-219
 //   - More, J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained
 //     optimization software. ACM Trans Math Softw 7 (1981), 17-41
@@ -1334,7 +1334,7 @@ func (PowellBadlyScaled) Minima() []Minimum {
 //
 // References:
 //   - Spedicato E.: Computational experience with quasi-Newton algorithms for
-//     minimization problems of moderatly large size. Towards Global
+//     minimization problems of moderately large size. Towards Global
 //     Optimization 2 (1978), 209-219
 //   - More, J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained
 //     optimization software. ACM Trans Math Softw 7 (1981), 17-41
diff --git a/stat/distmv/dirichlet.go b/stat/distmv/dirichlet.go
index 4869f0220..fec49ce43 100644
--- a/stat/distmv/dirichlet.go
+++ b/stat/distmv/dirichlet.go
@@ -134,7 +134,7 @@ func (d *Dirichlet) Prob(x []float64) float64 {
 	return math.Exp(d.LogProb(x))
 }
 
-// Rand generates a random number according to the distributon.
+// Rand generates a random number according to the distribution.
 //
 // If dst is not nil, the sample will be stored in-place into dst and returned,
 // otherwise a new slice will be allocated first. If dst is not nil, it must
diff --git a/stat/distmv/interfaces.go b/stat/distmv/interfaces.go
index 35dd25505..04f56aa29 100644
--- a/stat/distmv/interfaces.go
+++ b/stat/distmv/interfaces.go
@@ -18,9 +18,11 @@ type LogProber interface {
 	LogProb(x []float64) float64
 }
 
-// Rander generates a random number according to the distributon.
+// Rander generates a random number according to the distribution.
+//
 // If the input is non-nil, len(x) must equal len(p) and the dimension of the distribution,
 // otherwise Quantile will panic.
+//
 // If the input is nil, a new slice will be allocated and returned.
 type Rander interface {
 	Rand(x []float64) []float64
diff --git a/stat/distmv/normal.go b/stat/distmv/normal.go
index bd609eeb2..8d6cc8140 100644
--- a/stat/distmv/normal.go
+++ b/stat/distmv/normal.go
@@ -294,7 +294,7 @@ func (n *Normal) Quantile(dst, p []float64) []float64 {
 	return dst
 }
 
-// Rand generates a random sample according to the distributon.
+// Rand generates a random sample according to the distribution.
 //
 // If dst is not nil, the sample will be stored in-place into dst and returned,
 // otherwise a new slice will be allocated first. If dst is not nil, it must
@@ -303,7 +303,7 @@ func (n *Normal) Rand(dst []float64) []float64 {
 	return NormalRand(dst, n.mu, &n.chol, n.src)
 }
 
-// NormalRand generates a random sample from a multivariate normal distributon
+// NormalRand generates a random sample from a multivariate normal distribution
 // given by the mean and the Cholesky factorization of the covariance matrix.
 //
 // If dst is not nil, the sample will be stored in-place into dst and returned,
diff --git a/stat/distmv/studentst.go b/stat/distmv/studentst.go
index e038d506a..2ef71beca 100644
--- a/stat/distmv/studentst.go
+++ b/stat/distmv/studentst.go
@@ -331,7 +331,7 @@ func (s *StudentsT) Prob(y []float64) float64 {
 	return math.Exp(s.LogProb(y))
 }
 
-// Rand generates a random sample according to the distributon.
+// Rand generates a random sample according to the distribution.
 //
 // If dst is not nil, the sample will be stored in-place into dst and returned,
 // otherwise a new slice will be allocated first. If dst is not nil, it must
diff --git a/stat/distmv/uniform.go b/stat/distmv/uniform.go
index 742359037..75082f7a9 100644
--- a/stat/distmv/uniform.go
+++ b/stat/distmv/uniform.go
@@ -155,7 +155,7 @@ func (u *Uniform) Prob(x []float64) float64 {
 	return math.Exp(u.LogProb(x))
 }
 
-// Rand generates a random sample according to the distributon.
+// Rand generates a random sample according to the distribution.
 //
 // If dst is not nil, the sample will be stored in-place into dst and returned,
 // otherwise a new slice will be allocated first. If dst is not nil, it must


Test patch:
diff --git a/graph/product/product_ext_example_test.go b/graph/product/product_ext_example_test.go
index e868faafe..955e5b5da 100644
--- a/graph/product/product_ext_example_test.go
+++ b/graph/product/product_ext_example_test.go
@@ -54,13 +54,13 @@ func ExampleModularExt_subgraphIsomorphism() {
 
 	// Make a graph for the query pattern: a love triangle.
 	pattern := simple.NewDirectedGraph()
-	for _, relationsip := range []simple.WeightedEdge{
+	for _, relationship := range []simple.WeightedEdge{
 		{F: person{name: "A", id: -1}, T: person{name: "B", id: -2}, W: 1},
 		{F: person{name: "B", id: -2}, T: person{name: "A", id: -1}, W: 1},
 		{F: person{name: "C", id: -3}, T: person{name: "A", id: -1}, W: -1},
 		{F: person{name: "C", id: -3}, T: person{name: "B", id: -2}, W: 1},
 	} {
-		pattern.SetEdge(relationsip)
+		pattern.SetEdge(relationship)
 	}
 
 	// Produce the modular product of the two graphs.
diff --git a/mat/vector_test.go b/mat/vector_test.go
index 89e3fceb0..258cab7ac 100644
--- a/mat/vector_test.go
+++ b/mat/vector_test.go
@@ -118,7 +118,7 @@ func TestCap(t *testing.T) {
 	} {
 		got := test.vector.Cap()
 		if got != test.want {
-			t.Errorf("unexpected capacty for test %d: got: %d want: %d", i, got, test.want)
+			t.Errorf("unexpected capacity for test %d: got: %d want: %d", i, got, test.want)
 		}
 	}
 }
diff --git a/stat/samplemv/halton_test.go b/stat/samplemv/halton_test.go
index 7a03ca46b..b23819504 100644
--- a/stat/samplemv/halton_test.go
+++ b/stat/samplemv/halton_test.go
@@ -28,7 +28,7 @@ func TestHalton(t *testing.T) {
 		batch := mat.NewDense(test.n, test.d, nil)
 		Halton{Kind: Owen, Q: distmv.NewUnitUniform(test.d, nil), Src: src}.Sample(batch)
 
-		// In each dimension, the samples should be stratefied according to the
+		// In each dimension, the samples should be stratified according to the
 		// prime for that dimension. There should be at most 1 sample per
 		// 1/b^k block, where k is log(n)/log(b).
 		for d := 0; d < test.d; d++ {