Anytime Algorithms for Speech Parsing?
| dc.creator | Goerz, Guenther | |
| dc.creator | Kesseler, Marcus | |
| dc.date | 1994-06-21 | |
| dc.date.accessioned | 2026-07-07T09:09:22Z | |
| dc.date.available | 2026-07-07T09:09:22Z | |
| dc.description | 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. | |
| dc.description | 5 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9406032 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9406032 | |
| dc.identifier | COLING-94 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151011 | |
| dc.subject | Computation and Language | |
| dc.title | Anytime Algorithms for Speech Parsing? | |
| dc.type | text |