TY  - JOUR
T1  - Transformation of Dawgs into Word Lattices
AU - , Kyriakos N. Sgarbas AU - , Nikos D. Fakotakis AU - , George K. Kokkinakis 
JO  - Asian Journal of Information Technology
VL  - 3
IS  - 4
SP  - 245
EP  - 249
PY  - 2004
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2004.245.249
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2004.245.249
KW  - 
AB  - This study presents an algorithm for the transformation of DAWGs (Directed Acyclic Word Graphs) into equivalent Word Lattices (WLs). WLs are used in several applications (e.g. speech processing, language modeling etc.), whereas DAWGs as special cases of FSA (Finite State Automata) have a rich theoretical background. Although these two data structures have a resemblance, the transformation between the two forms is not at all trivial. The presented algorithm works for both deterministic and non-deterministic DAWGs.
ER  -