diff --git a/lib/node_modules/@stdlib/blas/ext/base/README.md b/lib/node_modules/@stdlib/blas/ext/base/README.md
index 4187e545aebe..c5845d5fc9c5 100644
--- a/lib/node_modules/@stdlib/blas/ext/base/README.md
+++ b/lib/node_modules/@stdlib/blas/ext/base/README.md
@@ -118,9 +118,9 @@ var ns = extblas;
- [`gsortsh( N, order, x, stride )`][@stdlib/blas/ext/base/gsortsh]: sort a strided array using Shellsort.
- [`gsum( N, x, stride )`][@stdlib/blas/ext/base/gsum]: calculate the sum of strided array elements.
- [`gsumkbn( N, x, stride )`][@stdlib/blas/ext/base/gsumkbn]: calculate the sum of strided array elements using an improved Kahan–Babuška algorithm.
-- [`gsumkbn2( N, x, stride )`][@stdlib/blas/ext/base/gsumkbn2]: calculate the sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.
-- [`gsumors( N, x, stride )`][@stdlib/blas/ext/base/gsumors]: calculate the sum of strided array elements using ordinary recursive summation.
-- [`gsumpw( N, x, stride )`][@stdlib/blas/ext/base/gsumpw]: calculate the sum of strided array elements using pairwise summation.
+- [`gsumkbn2( N, x, strideX )`][@stdlib/blas/ext/base/gsumkbn2]: calculate the sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.
+- [`gsumors( N, x, strideX )`][@stdlib/blas/ext/base/gsumors]: calculate the sum of strided array elements using ordinary recursive summation.
+- [`gsumpw( N, x, strideX )`][@stdlib/blas/ext/base/gsumpw]: calculate the sum of strided array elements using pairwise summation.
- [`sapx( N, alpha, x, stride )`][@stdlib/blas/ext/base/sapx]: add a constant to each element in a single-precision floating-point strided array.
- [`sapxsum( N, alpha, x, stride )`][@stdlib/blas/ext/base/sapxsum]: add a constant to each single-precision floating-point strided array element and compute the sum.
- [`sapxsumkbn( N, alpha, x, stride )`][@stdlib/blas/ext/base/sapxsumkbn]: add a constant to each single-precision floating-point strided array element and compute the sum using an improved Kahan–Babuška algorithm.
diff --git a/lib/node_modules/@stdlib/stats/base/README.md b/lib/node_modules/@stdlib/stats/base/README.md
index 3754b2b20ed5..41768f2698cc 100644
--- a/lib/node_modules/@stdlib/stats/base/README.md
+++ b/lib/node_modules/@stdlib/stats/base/README.md
@@ -120,7 +120,7 @@ The namespace contains the following statistical functions:
- [`dsemch( N, correction, x, stride )`][@stdlib/stats/base/dsemch]: calculate the standard error of the mean of a double-precision floating-point strided array using a one-pass trial mean algorithm.
- [`dsempn( N, correction, x, stride )`][@stdlib/stats/base/dsempn]: calculate the standard error of the mean of a double-precision floating-point strided array using a two-pass algorithm.
- [`dsemtk( N, correction, x, stride )`][@stdlib/stats/base/dsemtk]: calculate the standard error of the mean of a double-precision floating-point strided array using a one-pass textbook algorithm.
-- [`dsemwd( N, correction, x, stride )`][@stdlib/stats/base/dsemwd]: calculate the standard error of the mean of a double-precision floating-point strided array using Welford's algorithm.
+- [`dsemwd( N, correction, x, strideX )`][@stdlib/stats/base/dsemwd]: calculate the standard error of the mean of a double-precision floating-point strided array using Welford's algorithm.
- [`dsemyc( N, correction, x, stride )`][@stdlib/stats/base/dsemyc]: calculate the standard error of the mean of a double-precision floating-point strided array using a one-pass algorithm proposed by Youngs and Cramer.
- [`dsmean( N, x, stride )`][@stdlib/stats/base/dsmean]: calculate the arithmetic mean of a single-precision floating-point strided array using extended accumulation and returning an extended precision result.
- [`dsmeanors( N, x, stride )`][@stdlib/stats/base/dsmeanors]: calculate the arithmetic mean of a single-precision floating-point strided array using ordinary recursive summation with extended accumulation and returning an extended precision result.