{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:29:54Z","timestamp":1748338194609},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[1995,9]]},"abstract":"<jats:p> In this paper we present two algorithms for building lexicons in Directed Acyclic Word-Graphs (DAWGs). The two algorithms, one for deterministic and the other for non-deterministic DAWGs, can be used instead of the traditional subset construction method. Although the proposed algorithms do not produce the optimal DAWG (i.e., the one with the minimum number of states), they are simple, fast and able to build the DAWG incrementally, as new words are added to the lexicon. Thus, building large lexicons in a DAWG structure becomes an easy task, even for a modest computer. <\/jats:p>","DOI":"10.1142\/s0218213095000188","type":"journal-article","created":{"date-parts":[[2004,11,10]],"date-time":"2004-11-10T06:14:37Z","timestamp":1100067277000},"page":"369-381","source":"Crossref","is-referenced-by-count":11,"title":["TWO ALGORITHMS FOR INCREMENTAL CONSTRUCTION OF DIRECTED ACYCLIC WORD GRAPHS"],"prefix":"10.1142","volume":"04","author":[{"given":"KYRIAKOS N.","family":"SGARBAS","sequence":"first","affiliation":[{"name":"Wire Communications Lab., Electrical Engineering Dept., University of Patras, Patras GR-26500, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"NIKOS D.","family":"FAKOTAKIS","sequence":"additional","affiliation":[{"name":"Wire Communications Lab., Electrical Engineering Dept., University of Patras, Patras GR-26500, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GEORGE K.","family":"KOKKINAKIS","sequence":"additional","affiliation":[{"name":"Wire Communications Lab., Electrical Engineering Dept., University of Patras, Patras GR-26500, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213095000188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:31:19Z","timestamp":1565184679000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213095000188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1995,9]]}},"alternative-id":["10.1142\/S0218213095000188"],"URL":"https:\/\/doi.org\/10.1142\/s0218213095000188","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}