diff --git a/libgraphtheory/kernel/modules/document/document.xml b/libgraphtheory/kernel/modules/document/document.xml
index f32bb395..3690c003 100644
--- a/libgraphtheory/kernel/modules/document/document.xml
+++ b/libgraphtheory/kernel/modules/document/document.xml
@@ -1,143 +1,143 @@
 <?xml version="1.0"?>
 <object>
 <name>Document</name>
 <id>Document</id>
 <componentType>Document</componentType>
 <description>
 <para>
 The document object provides access to all elements.
 </para>
 </description>
 <syntax>
 </syntax>
 <properties>
 </properties>
 <methods>
 <method>
     <name>node(id)</name>
     <description>
         <para>Return the node with specified ID.</para>
     </description>
     <returnType>Node</returnType>
     <parameters>
         <parameter>
             <name>id</name>
             <type>int</type>
             <info>Identifier of a node.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>nodes()</name>
     <description>
         <para>Return a list of all nodes.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>nodes(type)</name>
     <description>
         <para>Return a list all nodes of specified type.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of a node type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>edges()</name>
     <description>
         <para>Return a list of all edges.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>edges(type)</name>
     <description>
         <para>Return a list all edges of specified type.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of an edge type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>createNode(int x, int y)</name>
     <description>
         <para>Create node at position (x,y).</para>
     </description>
     <returnType>Node</returnType>
     <parameters>
         <parameter>
             <name>x</name>
             <type>int</type>
             <info>X-coordinate of the node.</info>
         </parameter>
         <parameter>
             <name>y</name>
             <type>int</type>
             <info>Y-coordinate of the node.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>createEdge(from, to)</name>
     <description>
         <para>Create edge between the given nodes of default edge type.</para>
     </description>
     <returnType>Edge</returnType>
     <parameters>
         <parameter>
             <name>from</name>
             <type>Node</type>
             <info>Start node of the edge.</info>
         </parameter>
         <parameter>
             <name>to</name>
             <type>Node</type>
             <info>Target node of the edge.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>remove(node)</name>
     <description>
         <para>Delete the given node.</para>
     </description>
     <returnType>void</returnType>
     <parameters>
         <parameter>
             <name>node</name>
             <type>Node</type>
-            <info>The to be deleted node.</info>
+            <info>The node to be deleted.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>remove(edge)</name>
     <description>
         <para>Delete the given edge.</para>
     </description>
     <returnType>void</returnType>
     <parameters>
         <parameter>
             <name>edge</name>
             <type>Edge</type>
-            <info>The to be deleted edge.</info>
+            <info>The edge to be deleted.</info>
         </parameter>
     </parameters>
 </method>
 </methods>
 </object>
diff --git a/libgraphtheory/kernel/modules/document/node.xml b/libgraphtheory/kernel/modules/document/node.xml
index 7aedefa7..085bde34 100644
--- a/libgraphtheory/kernel/modules/document/node.xml
+++ b/libgraphtheory/kernel/modules/document/node.xml
@@ -1,211 +1,211 @@
 <?xml version="1.0"?>
 <object>
 <name>Node</name>
 <id>Node</id>
 <componentType>Node</componentType>
 <description>
 <para>
 A node is the data element of a graph.
 It can have arbitrary dynamic properties that are either set in the editor or simply assigned on run-time.
 Note that dynamic properties are only available after script execution, if they are registered for the node's type.
 </para>
 </description>
 <syntax>
 </syntax>
 <properties>
 <property>
     <name>id</name>
     <description>
         <para>Read and set the unique identifier of this node.</para>
     </description>
     <type>int</type>
 </property>
 <property>
     <name>x</name>
     <description>
         <para>Read and set the x-coordinate of the node.</para>
     </description>
     <type>real</type>
 </property>
 <property>
     <name>y</name>
     <description>
         <para>Read and set the y-coordinate of the node.</para>
     </description>
     <type>real</type>
 </property>
 <property>
     <name>color</name>
     <description>
         <para>Read and set the color string of this node in hex values (e.g., "#ff0000" for red).</para>
     </description>
     <type>string</type>
 </property>
 <property>
     <name>type</name>
     <description>
-        <para>Read at set the identifier of the node's type. If setting, the node type identifier must exist.</para>
+        <para>Read and set the identifier of the node's type. If setting, the node type identifier must exist.</para>
     </description>
     <type>string</type>
 </property>
 </properties>
 <methods>
 <method>
     <name>edges()</name>
     <description>
         <para>Return a list of all edges (incoming and outgoing) of this node.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>edges(type)</name>
     <description>
         <para>Return a list of all edges (incoming and outgoing) of this node of a specified type.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of an edge type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>inEdges()</name>
     <description>
         <para>Return a list of incoming edges of this node.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>inEdges(type)</name>
     <description>
         <para>Return a list of all incoming edges of this node of a specified type.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of an edge type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>outEdges()</name>
     <description>
         <para>Return a list of all outgoing edges of this node.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>outEdges(type)</name>
     <description>
         <para>Return a list of all outgoing edges of this node of a specified type.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of an edge type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>neighbors()</name>
     <description>
         <para>Return list all nodes connected to this node. This method respects if edges are directed.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>neighbors(type)</name>
     <description>
         <para>Return list all nodes connected to this node via an edge of specified type. This method respects if edges are directed.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of an edge type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>predecessors()</name>
     <description>
         <para>Return a list all nodes connected to this node by an incoming edge.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>predecessors(type)</name>
     <description>
         <para>Return a list all nodes connected to this node by an incoming edge of specified type.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of an edge type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>successors()</name>
     <description>
         <para>Return list all nodes connected to this node by an outgoing edge.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
     </parameters>
 </method>
 <method>
     <name>successors(type)</name>
     <description>
         <para>Return list all nodes connected to this node by an outgoing edge of specified type.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>type</name>
             <type>int</type>
             <info>Identifier of an edge type.</info>
         </parameter>
     </parameters>
 </method>
 <method>
     <name>distance(property, targets)</name>
     <description>
         <para>Return list of distances to specified targets in same order.</para>
     </description>
     <returnType>array</returnType>
     <parameters>
         <parameter>
             <name>property</name>
             <type>string</type>
             <info>Name of edge property that holds the edge length.</info>
         </parameter>
         <parameter>
             <name>targets</name>
             <type>array</type>
             <info>List of nodes to that the distances shall be computed.</info>
         </parameter>
     </parameters>
 </method>
 </methods>
 </object>