Practical experiments with regular approximation of context-free languages

Details Practical experiments with regular approximation of context-free languages Practical experiments with regular approximation of context-free languages

1999-10-25

arxiv.org/abs/cs/9910022v1

Computer Science

Computation and Language

28 pages. To appear in Computational Linguistics 26(1), March 2000

Scientific paper

Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of regular approximation are new, and some others are presented here in a more refined form with respect to existing literature. Practical experiments with the different methods of regular approximation are performed for spoken-language input: hypotheses from a speech recognizer are filtered through a finite automaton.

Affiliated with

Also associated with

No associations

Rating

Practical experiments with regular approximation of context-free languages 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 Practical experiments with regular approximation of context-free languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Practical experiments with regular approximation of context-free languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2433