diff --git a/Infovis/vtkAppendPoints.h b/Infovis/vtkAppendPoints.h
index 9adfe263bf3631308e47e489927500669e9381ad..998bc3001077d2d586112dac8153294faa7f2b95 100644
--- a/Infovis/vtkAppendPoints.h
+++ b/Infovis/vtkAppendPoints.h
@@ -15,7 +15,7 @@
 // .NAME vtkAppendPoints - appends points of one or more vtkPolyData data sets
 //
 // .SECTION Description
-// vtkAppendPoints is a filter that appends the points and assoicated data
+// vtkAppendPoints is a filter that appends the points and associated data
 // of one or more polygonal (vtkPolyData) datasets. This filter can optionally 
 // add a new array marking the input index that the point came from.
 
diff --git a/Infovis/vtkCollapseVerticesByArray.h b/Infovis/vtkCollapseVerticesByArray.h
index 3e5f9d5272885a4f6d99d68986bd9d03eb239ff5..cc55b484814a6b81bc8f42c839166d3a91c9c276 100644
--- a/Infovis/vtkCollapseVerticesByArray.h
+++ b/Infovis/vtkCollapseVerticesByArray.h
@@ -99,7 +99,7 @@ protected:
                            vtkInformationVector* outputVector);
 
    // Description:
-   // Pipeline funtion.
+   // Pipeline function.
    virtual int FillOutputPortInformation(int port, vtkInformation* info);
 
 
diff --git a/Infovis/vtkConstrained2DLayoutStrategy.h b/Infovis/vtkConstrained2DLayoutStrategy.h
index 92adc485df493e51765bd3a62f126a9f8835aaf2..bf53b761e728d72bc01b1d51f151ac0160b857d7 100644
--- a/Infovis/vtkConstrained2DLayoutStrategy.h
+++ b/Infovis/vtkConstrained2DLayoutStrategy.h
@@ -19,7 +19,7 @@
 -------------------------------------------------------------------------*/
 // .NAME vtkConstrained2DLayoutStrategy - a simple fast 2D graph layout
 // that looks for a 'constraint' array (vtkDoubleArray). Any entry in the 
-// constraint array will indicate the level of impedence a node has to 
+// constraint array will indicate the level of impedance a node has to 
 // the force calculations during the layout optimization. The array is 
 // assumed to be normalized between zero and one, with one being totally 
 // constrained, so no force will be applied to the node (i.e. no movement), 
diff --git a/Infovis/vtkCosmicTreeLayoutStrategy.cxx b/Infovis/vtkCosmicTreeLayoutStrategy.cxx
index c42757ff12bbfd10a0b74fae10e8f42d8115514b..11273f8ba5f2d9c08094587d074020e94b01339b 100644
--- a/Infovis/vtkCosmicTreeLayoutStrategy.cxx
+++ b/Infovis/vtkCosmicTreeLayoutStrategy.cxx
@@ -325,7 +325,7 @@ int vtkCosmicTreeLayoutStrategyComputeCentersWell(
         }
       if ( // both:
         ( fabs( dRe / Re ) < 1.e-4 ) && // change in radius is relatively large and ...
-        ( dRe >= 0. ) // we need to grow, not shrink (i.e., Re is smaller than neccessary, not too large).
+        ( dRe >= 0. ) // we need to grow, not shrink (i.e., Re is smaller than necessary, not too large).
       )
         { // done!
         cout << "Stopping at iter: " << iter << ". ReOld: " << ReOld << " Re: " << Re << " dRe: " << dRe << "\n";
@@ -348,7 +348,7 @@ int vtkCosmicTreeLayoutStrategyComputeCentersWell(
          ( angsum > twopi ) || // we wrap around
          ( // both:
           ( fabs( ( Re - ReOld ) / ReOld - 1. ) > 1.e-4 ) && // change in radius is relatively large and ...
-          ( dReTangent <= 0. ) // we need to grow, not shrink (i.e., Re is smaller than neccessary, not too large).
+          ( dReTangent <= 0. ) // we need to grow, not shrink (i.e., Re is smaller than necessary, not too large).
          )
         ) &&
         ( iter < 30 ) ); // we haven't taken too long
diff --git a/Infovis/vtkForceDirectedLayoutStrategy.cxx b/Infovis/vtkForceDirectedLayoutStrategy.cxx
index 4555d15e57919350797a94f921f0dab36b2517b9..1e1e56ced8edc7261efa53ab22dda4d89e0bf9e4 100644
--- a/Infovis/vtkForceDirectedLayoutStrategy.cxx
+++ b/Infovis/vtkForceDirectedLayoutStrategy.cxx
@@ -88,7 +88,7 @@ static inline double forceRepulse(double x, double k)
 
 // In the future this method should setup data
 // structures, etc... so that Layout doesn't have to
-// do that everytime it's called
+// do that every time it's called
 void vtkForceDirectedLayoutStrategy::Initialize() 
 {
   vtkPoints* pts = this->Graph->GetPoints();
diff --git a/Infovis/vtkGeoEdgeStrategy.cxx b/Infovis/vtkGeoEdgeStrategy.cxx
index a4d4075238e147cc0b8d36c2045bbe4a7a1d6703..24c5f59c17a049aeefba8d122a5e1c37509d25b4 100644
--- a/Infovis/vtkGeoEdgeStrategy.cxx
+++ b/Infovis/vtkGeoEdgeStrategy.cxx
@@ -101,7 +101,7 @@ void vtkGeoEdgeStrategy::Layout()
     this->Graph->GetPoint(e.Target, targetPt);
 
     // Find w, a unit vector pointing from the center of the
-    // earth directly inbetween the two endpoints.
+    // earth directly between the two endpoints.
     double w[3];
     for (int c = 0; c < 3; ++c)
       {
diff --git a/Infovis/vtkPerturbCoincidentVertices.cxx b/Infovis/vtkPerturbCoincidentVertices.cxx
index c93269223d0dcfc237f18c5e42b128fe8cd435c1..79dc5359c0b86b1312cd7c52ae058c383d0eacab 100644
--- a/Infovis/vtkPerturbCoincidentVertices.cxx
+++ b/Infovis/vtkPerturbCoincidentVertices.cxx
@@ -91,7 +91,7 @@ void vtkPerturbCoincidentVertices::SpiralPerturbation(vtkGraph *input, vtkGraph
   // the average point distance assuming the points are uniformly distributed. The smallest of these
   // two metrics will be used to scale the spiral.
 
-  // Compute shortest edge comming to/from the coincident points.
+  // Compute shortest edge coming to/from the coincident points.
   vtkIdList * coincidentPointsList = coincidentPoints->GetNextCoincidentPointIds();
   while(coincidentPointsList != NULL)
     {
@@ -221,7 +221,7 @@ void vtkPerturbCoincidentVertices::SimpleSpiralPerturbation(vtkGraph *input,
   int numPoints = points->GetNumberOfPoints();
 
   // Temporary abort as this perturbation method
-  // calculates N^2 distances which doesnt scale well.
+  // calculates N^2 distances which doesn't scale well.
   if(numPoints > 1000)
     {
     return;
diff --git a/Infovis/vtkSimple3DCirclesStrategy.cxx b/Infovis/vtkSimple3DCirclesStrategy.cxx
index d63ceb003a45f90d3139fbf1c6632eeedcad3d67..ffebec12f8589a87b2134662268368944cb39b51 100644
--- a/Infovis/vtkSimple3DCirclesStrategy.cxx
+++ b/Infovis/vtkSimple3DCirclesStrategy.cxx
@@ -395,7 +395,7 @@ void vtkSimple3DCirclesStrategy::Layout( void )
 
   if ( order->GetValue( order->GetMaxId() ) == -1 )
     {
-    vtkErrorMacro( << "Not all parts of the graph is accessable. There may be a loop." );
+    vtkErrorMacro( << "Not all parts of the graph is accessible. There may be a loop." );
     return;
     }
 
diff --git a/Infovis/vtkTableToGraph.h b/Infovis/vtkTableToGraph.h
index 305b89c09073a91b1a249e72f4ffc4c23c06f582..4fdb3f3d867f8a46ab6b3c5c6d76bee3a69ad16c 100644
--- a/Infovis/vtkTableToGraph.h
+++ b/Infovis/vtkTableToGraph.h
@@ -30,7 +30,7 @@
 // This vertex table must have one or more domain columns whose values
 // match values in the edge table.  The linked column name is specified in
 // the domain array in the link graph.  The output graph will only contain
-// vertices corresponding to a row in the vertex table.  For heterogenous
+// vertices corresponding to a row in the vertex table.  For heterogeneous
 // graphs, you may want to use vtkMergeTables to create a single vertex table.
 //
 // The link graph contains the following arrays:
diff --git a/Infovis/vtkThresholdTable.h b/Infovis/vtkThresholdTable.h
index 41ec586f02a4cbb713dd3cbb185f85cd794d672f..fb4a4c9bcf26739a99a134c731c035c67d521e9c 100644
--- a/Infovis/vtkThresholdTable.h
+++ b/Infovis/vtkThresholdTable.h
@@ -56,7 +56,7 @@ public:
   vtkGetMacro(Mode, int);
 
   // Description:
-  // The minumum value for the threshold.
+  // The minimum value for the threshold.
   // This may be any data type stored in a vtkVariant.
   virtual void SetMinValue(vtkVariant v)
     {
@@ -87,7 +87,7 @@ public:
   void ThresholdBetween(vtkVariant lower, vtkVariant upper);
 
   // Description:
-  // The minumum value for the threshold as a double.
+  // The minimum value for the threshold as a double.
   void SetMinValue(double v)
   {
     this->SetMinValue(vtkVariant(v));
diff --git a/Infovis/vtkTreeFieldAggregator.cxx b/Infovis/vtkTreeFieldAggregator.cxx
index 6fe5881f606ae7db3a9108c2d28479d96a16f2f2..c1d0ca198041fc4468874cac4a7093491dbe8fa2 100644
--- a/Infovis/vtkTreeFieldAggregator.cxx
+++ b/Infovis/vtkTreeFieldAggregator.cxx
@@ -72,7 +72,7 @@ int vtkTreeFieldAggregator::RequestData(
   // Shallow copy the input
   output->ShallowCopy(input);
 
-  // Check for the existance of the field to be aggregated
+  // Check for the existence of the field to be aggregated
   if (!output->GetVertexData()->HasArray(this->Field))
     {
     this->LeafVertexUnitSize = true;
diff --git a/Infovis/vtkTreeLayoutStrategy.cxx b/Infovis/vtkTreeLayoutStrategy.cxx
index 637ba6c38c442ee9660bf33961ebd6a00ca2747e..6647456caa64cc0c6094131066bd812464fea3d6 100644
--- a/Infovis/vtkTreeLayoutStrategy.cxx
+++ b/Infovis/vtkTreeLayoutStrategy.cxx
@@ -229,7 +229,7 @@ void vtkTreeLayoutStrategy::Layout()
       if (tree->IsLeaf(vertex))
         {
         
-        // 1) Compute the postion in the arc
+        // 1) Compute the position in the arc
         // 2) Spin around so that the tree leaves are at 
         //    the bottom and centered
         // 3) Convert to radians
diff --git a/Infovis/vtkXGMLReader.cxx b/Infovis/vtkXGMLReader.cxx
index 736c9fb34acd3a47e781dd4b745db2d4743a965f..16304dc08bc8c0fefaf95051b352a4be782dd4f2 100644
--- a/Infovis/vtkXGMLReader.cxx
+++ b/Infovis/vtkXGMLReader.cxx
@@ -347,7 +347,7 @@ int vtkXGMLReader::RequestData(
     vtkXGMLReaderNextToken(fin, tok);
     while (tok.Type == vtkXGMLReaderToken::KEYWORD)
       {
-      // Assume that all edge groups will list id, source, and dest fiels
+      // Assume that all edge groups will list id, source, and dest fields
       // before any edge property.
       if (tok.StringValue == "id")
         {