diff --git a/quadric/convert/+quadric/vecToFunc.m b/quadric/convert/+quadric/vecToFunc.m
index 3ce1353..e81e294 100644
--- a/quadric/convert/+quadric/vecToFunc.m
+++ b/quadric/convert/+quadric/vecToFunc.m
@@ -21,6 +21,9 @@
 %   S                     - 1x10 vector or 4x4 matrix of the quadric
 %                           surface.
 %
+% Outputs:
+%   F                     - Hanndle to polynomial function
+%
 
 % If the quadric surface was passed in matrix form, convert to vec
 if isequal(size(v),[4 4])
diff --git a/quadric/properties/+quadric/mostAnteriorPoint.m b/quadric/properties/+quadric/mostAnteriorPoint.m
index b2369e5..ad4d647 100644
--- a/quadric/properties/+quadric/mostAnteriorPoint.m
+++ b/quadric/properties/+quadric/mostAnteriorPoint.m
@@ -29,7 +29,7 @@
     error('quadric:mostAnteriorPoint','Can only find the most anterior point for an ellipsoid');
 end
 
-% An anonymoys function that returns the area of an ellipse that is in the
+% An anonymous function that returns the area of an ellipse that is in the
 % cross-sectional plane at a given position along the x axis.
 myFun = @(x) ellipseAreaAtX(S,x);
 
@@ -60,8 +60,8 @@
 % Obtain the variables for the quadric
 [A, B, C, D, E, F, G, H, I, K] = quadric.matrixToVars(S);
 
-% Map the ellipsid parameters into the parameters into the implicit
-% parameters of an ellipse at the specfied x-axis position
+% Map the ellipsoid parameters into the implicit parameters of an ellipse
+% at the specfied x-axis position
 a = B;
 b = F;
 c = C;
@@ -82,7 +82,7 @@
     return
 end
 
-% Conver the ellipse parameters from implicit to transparent format, and
+% Convert the ellipse parameters from implicit to transparent format, and
 % extract the area and ellipse center
 transparent = ellipse_ex2transparent(ellipse_im2ex([a 2*b c 2*d 2*f g]));
 area = transparent(3);
diff --git a/quadric/properties/+quadric/radii.m b/quadric/properties/+quadric/radii.m
index da3d608..c5222a4 100644
--- a/quadric/properties/+quadric/radii.m
+++ b/quadric/properties/+quadric/radii.m
@@ -54,7 +54,7 @@
 r = r .* sgns;
 
 % The radius values are at this stage in canonical order (smallest to
-% largest). Now re-order the valus so that the correspond to the actual
+% largest). Now re-order the valus so that they correspond to the actual
 % x,y,z dimensions of the quadric.
 dimensionRank = quadric.dimensionSizeRank(S);
 r = r(dimensionRank);
diff --git a/quadric/relations/+quadric/distancePointRay.m b/quadric/relations/+quadric/distancePointRay.m
index 9a0e90d..0d2f7d0 100644
--- a/quadric/relations/+quadric/distancePointRay.m
+++ b/quadric/relations/+quadric/distancePointRay.m
@@ -9,7 +9,7 @@
 %
 % Inputs:
 %   p                     - 3x1 vector that specifies a point
-%   R                    -- 3x2 matrix that specifies a vector of the form 
+%   R                     - 3x2 matrix that specifies a vector of the form 
 %                           [p; u], corresponding to
 %                               R = p + t*u
 %                           where p is vector origin, u is the direction
diff --git a/quadric/relations/+quadric/reflectRay.m b/quadric/relations/+quadric/reflectRay.m
index d57f097..691547d 100644
--- a/quadric/relations/+quadric/reflectRay.m
+++ b/quadric/relations/+quadric/reflectRay.m
@@ -65,7 +65,7 @@
 % Obtain the direction vector of the surface normal
 q = N(:,2);
 
-% Place the surface intersection point as the origin of the refracted ray
+% Place the surface intersection point as the origin of the reflected ray
 Rr(:,1) = N(:,1);
 
 % Obtain the direction of the reflected ray