From: Mart Lubbers <mart@martlubbers.net>
Date: Mon, 2 Feb 2015 20:42:28 +0000 (+0100)
Subject: update
X-Git-Url: https://git.martlubbers.net/?a=commitdiff_plain;h=38ab48a7f69ee9ef5553c9e1ddfa2ad79d287d7a;p=bsc-thesis1415.git

update
---

diff --git a/thesis2/3.methods.tex b/thesis2/3.methods.tex
index 17a180d..91834cb 100644
--- a/thesis2/3.methods.tex
+++ b/thesis2/3.methods.tex
@@ -123,7 +123,6 @@ the route of the common prefix. Tracking the route back we do not encounter any
 other confluence states and therefore we can merge in the suffix which results
 in the final DAWG visible in subgraph SG4. No new words are added.
 
-\texttt{abcd}, \texttt{aecd} and \texttt{aecf}. In SG0 we begin with the null
 \begin{figure}[H]
 	\caption{Step 1}
 	\label{dawg1}
@@ -196,3 +195,11 @@ in the final DAWG visible in subgraph SG4. No new words are added.
 		n -> q0[label="SG0"];
 	}
 \end{figure}
+
+\subsection{Appliance on extraction of patterns}
+The algorithm for minimizing DAWGs can not be applied directly on the user
+generated pattern. This is mainly because there is no conclusive information
+about the contents of the pattern and therefore non deterministic choices have
+to be made. Because of this there can be multiple matches and the best match
+has to be determined. There are several possible criteria for determining the
+best match. The method we use is ... TODO