--- a/libinterp/corefcn/cellfun.cc	Wed Mar 20 08:13:57 2019 -0700
+++ b/libinterp/corefcn/cellfun.cc	Sun Mar 24 21:50:07 2019 -0700
@@ -2118,7 +2118,7 @@
 integers which specifies how to divide that dimension's elements amongst the
 new elements in the output @var{C}.  The number of elements in the @var{i}-th
 dimension is @code{size (@var{A}, @var{i})}.  Because all elements in @var{A}
-must be partitioned, there is a requirement that @code{sum (@var{di}) == size
+must be partitioned, there is a requirement that @code{sum (@var{dimi}) == size
 (@var{A}, i)}.  The size of the output cell @var{C} is numel (@var{dim1}) x
 numel (@var{dim2}) x @dots{} x numel (@var{dimn}).
 

--- a/scripts/polynomial/polyeig.m	Wed Mar 20 08:13:57 2019 -0700
+++ b/scripts/polynomial/polyeig.m	Sun Mar 24 21:50:07 2019 -0700
@@ -29,8 +29,8 @@
 ##
 ## @code{polyeig} solves the eigenvalue problem
 ##
-## @code{(@var{C0} + @var{C1} @var{z} + @dots{} + @var{Cl} z^@var{l}) @var{v} =
-## 0}.
+## @code{(@var{C0} + @var{C1} @var{z} + @dots{} + @var{Cl} @var{z}^@var{l})
+## @var{v} = 0}.
 ##
 ## Note that the eigenvalues @var{z} are the zeros of the matrix polynomial.
 ## @var{z} is a row vector with @code{@var{n}*@var{l}} elements.  @var{v} is a