Asian Journal of Information Technology

121
Views

0
Downloads

Transformation of Dawgs into Word Lattices

Kyriakos N. Sgarbas , Nikos D. Fakotakis and George K. Kokkinakis
Page: 245-249 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

Abstract

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.

How to cite this article:

Kyriakos N. Sgarbas , Nikos D. Fakotakis and George K. Kokkinakis . Transformation of Dawgs into Word Lattices.
DOI: https://doi.org/10.36478/ajit.2004.245.249
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2004.245.249