\label{appinternals}
\centering
\includegraphics[width=\linewidth]{backend.pdf}
- \strut\\
\caption{Main module internals}
\end{figure}
\label{pseudodawg}
\end{algorithm}
-\subsection{Example}
+\newpage\subsection{Example}
We visualize this with an example shown in the {Subgraphs in
Figure}~\ref{dawg1} that builds a DAWG with the following entries:
\texttt{abcd}, \texttt{aecd} and \texttt{aecf}.
\begin{figure}[H]
\label{dawg1}
\centering
- \includegraphics[width=0.8\linewidth]{inccons.pdf}
- \strut\\\strut\\
+ \includegraphics[height=20em]{inccons.pdf}
\caption{Incrementally constructing a DAWG}
\end{figure}
word \texttt{abdddbc} both paths can be chosen. In the first case the user
pattern \texttt{<1>} will be filled with \texttt{dddb} and in the second case
with \texttt{bddd}. In such a case we need to choose the hopefully smartest
-choice.
+choice. In the case of no paths matching the system will report a failed
+extraction. The crawling system can be made more forgiving in such a way that
+it will give partial information when no match is possible, however it still
+needs to report the error and the data should be handled with extra care.
\begin{figure}[H]
\label{nddawg}
\centering
\includegraphics[width=\linewidth]{nddawg.pdf}
- \strut\\
\caption{Example non determinism}
\end{figure}