-Every entry from the datastructure is processed to convert them to node-lists.
-A node-list can be seen as a path graph of every character and marking. A path
-graph $G$ is defined as $G=(V,n_1,E,n_i)$ where $V=\{n_1, n_2, \cdots, n_{i-1},
-n_i\}$ and $E=\{(n_1, n_2), (n_2, n_3), ... (n_{i-1}, n_{i})\}$. A path graph
-is basically a graph that is a path of nodes where every node is connected to
-the next on and the last on being final. The transitions between two nodes is
-either a character or a marking. As an example we take the entry \texttt{19:00,
-2014-11-12 - Foobar} and create the corresponding node-lists and make it
-visible in Figure~\ref{nodelistexample}. Characters are denoted with single
-quotes, spaces with an underscore and markers with angle brackets.
+Every entry gotten from the previous step are going to be processing into so
+called node-lists. A node-list can be seen as a path graph of every character
+and marking. A path graph $G$ is defined as $G=(V,n_1,E,n_i)$ where $V=\{n_1,
+n_2, \cdots, n_{i-1}, n_i\}$ and $E=\{(n_1, n_2), (n_2, n_3), ... (n_{i-1},
+n_{i})\}$. A path graph is basically a graph that is a path of nodes where
+every node is connected to the next on and the last on being final. The
+transitions between two nodes is either a character or a marking. As an example
+we take the entry \texttt{19:00, 2014-11-12 - Foobar} and create the
+corresponding node-lists and make it visible in Figure~\ref{nodelistexample}.
+Characters are denoted with single quotes, spaces with an underscore and
+markers with angle brackets. Node-lists are the basic elements from which the
+DAWG will be generated. These node-lists will also be available in the final
+aggregating dictionary to ensure consistency of data and possibility of
+regenerating the data.