Please use this identifier to cite or link to this item:
doi:10.22028/D291-25102
Title: | Anytime algorithms for speech parsing? |
Author(s): | Görz, Günther Kesseler, Marcus |
Language: | English |
Year of Publication: | 1994 |
OPUS Source: | Saarbrücken, 1994 |
SWD key words: | Künstliche Intelligenz |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | 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 argue 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. |
Link to this record: | urn:nbn:de:bsz:291-scidok-40042 hdl:20.500.11880/25158 http://dx.doi.org/10.22028/D291-25102 |
Series name: | Vm-Report / Verbmobil, Verbundvorhaben, [Deutsches Forschungszentrum für Künstliche Intelligenz] |
Series volume: | 13 |
Date of registration: | 22-Jul-2011 |
Faculty: | SE - Sonstige Einrichtungen |
Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
report_13_94.pdf | 164,78 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.