Anytime Algorithms for Speech Parsing?

Details Anytime Algorithms for Speech Parsing? Anytime Algorithms for Speech Parsing?

1994-06-21

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

COLING-94

Computer Science

Computation and Language

5 pages, 2 figures

Scientific paper

This paper discusses to which extent the concept of ``anytime algorithms'' can be applied to parsing algorithms with feature unification. We first try to give a more precise definition of what an anytime algorithm is. We arque that parsing algorithms have to be classified as contract algorithms as opposed to (truly) interruptible algorithms. With the restriction that the transaction being active at the time an interrupt is issued has to be completed before the interrupt can be executed, it is possible to provide a parser with limited anytime behavior, which is in fact being realized in our research prototype.

Affiliated with

Also associated with

No associations

Rating

Anytime Algorithms for Speech Parsing? 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 Anytime Algorithms for Speech Parsing?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Anytime Algorithms for Speech Parsing? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303682