Treatment of Epsilon-Moves in Subset Construction
| dc.creator | van Noord, Gertjan | |
| dc.date | 1998-04-28 | |
| dc.date.accessioned | 2026-07-07T02:36:13Z | |
| dc.date.available | 2026-07-07T02:36:13Z | |
| dc.description | The paper discusses the problem of determinising finite-state automata containing large numbers of epsilon-moves. Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very large number of epsilon-moves. The paper identifies three subset construction algorithms which treat epsilon-moves. A number of experiments has been performed which indicate that the algorithms differ considerably in practice. Furthermore, the experiments suggest that the average number of epsilon-moves per state can be used to predict which algorithm is likely to perform best for a given input automaton. | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9804003 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9804003 | |
| dc.identifier | Proceedings of FSMNLP'98. International Workshop on Finite-State Methods in Natural Language Processing, pages 1-12, June 29 - July 1, 1998. Bilkent University. Ankara, Turkey. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/15833 | |
| dc.subject | Computation and Language | |
| dc.title | Treatment of Epsilon-Moves in Subset Construction | |
| dc.type | text |