From: Mart Lubbers <mart@martlubbers.net>
Date: Tue, 26 May 2015 12:44:50 +0000 (+0200)
Subject: all corrections applied
X-Git-Url: https://git.martlubbers.net/?a=commitdiff_plain;h=5c3a0ed119da1e318d4aedbb72614486d8f510ab;p=bsc-thesis1415.git

all corrections applied
---

diff --git a/thesis2/1.introduction.tex b/thesis2/1.introduction.tex
index cc4160f..895de35 100644
--- a/thesis2/1.introduction.tex
+++ b/thesis2/1.introduction.tex
@@ -393,6 +393,5 @@ This means that it grows linearly with the length of the word.
 	\label{exampledawg}
 	\centering
 	\includegraphics[scale=0.7]{dawgexample.pdf}
-	\strut\\\strut\\
 	\caption{Example DAWG}
 \end{figure}
diff --git a/thesis2/3.methods.tex b/thesis2/3.methods.tex
index 2d47484..a30dcbe 100644
--- a/thesis2/3.methods.tex
+++ b/thesis2/3.methods.tex
@@ -10,7 +10,6 @@ between these steps. The Figure is a detailed explanation of the
 	\label{appinternals}
 	\centering
 	\includegraphics[width=\linewidth]{backend.pdf}
-	\strut\\
 	\caption{Main module internals}
 \end{figure}
 
@@ -163,7 +162,7 @@ word[length(commonprefix)\ldots length(word)]\;
 	\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}.
@@ -214,8 +213,7 @@ Figure}~\ref{dawg1} that builds a DAWG with the following entries:
 \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}
 
@@ -237,13 +235,15 @@ In this graph the word \texttt{abdc} will be accepted and the user pattern
 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}