Treatment of Epsilon-Moves in Subset Construction

Details Treatment of Epsilon-Moves in Subset Construction Treatment of Epsilon-Moves in Subset Construction

1998-04-28

arxiv.org/abs/cmp-lg/9804003v1

Proceedings of FSMNLP'98. International Workshop on Finite-State Methods in Natural Language Processing, pages 1-12, June 29 -

Computer Science

Computation and Language

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Treatment of Epsilon-Moves in Subset Construction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Treatment of Epsilon-Moves in Subset Construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Treatment of Epsilon-Moves in Subset Construction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-679765