Distributed Incremental Construction Method of Delaunay Overlay Network Using Detour Paths

Author(s):  
Masaaki Ohnishi ◽  
Masugi Inoue
1989 ◽  
Vol 20 (8) ◽  
pp. 59-69
Author(s):  
Shinji Araya ◽  
Taketoshi Momohara ◽  
Tuneo Tamati

2013 ◽  
Vol 21 (2) ◽  
pp. 216-224 ◽  
Author(s):  
Masaaki Ohnishi ◽  
Masugi Inoue ◽  
Hiroaki Harai

1995 ◽  
Vol 04 (03) ◽  
pp. 369-381 ◽  
Author(s):  
KYRIAKOS N. SGARBAS ◽  
NIKOS D. FAKOTAKIS ◽  
GEORGE K. KOKKINAKIS

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.


Sign in / Sign up

Export Citation Format

Share Document