Eingang zum Volltext in SciDok
Lizenz
Report (Bericht) zugänglich unter
Anytime algorithms for speech parsing?
URN: urn:nbn:de:bsz:291-scidok-40042
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/4004/
Quelle:
(1994) Saarbrücken, 1994
pdf-Format:
Dokument 1.pdf (165 KB)
SWD-Schlagwörter:
Künstliche Intelligenz
Institut:
DDC-Sachgruppe:
Informatik
Dokumentart:
Report (Bericht)
Schriftenreihe:
Vm-Report / Verbmobil, Verbundvorhaben, [Deutsches Forschungszentrum für Künstliche Intelligenz]
Bandnummer:
13
Sprache:
Englisch
Erstellungsjahr:
1994
Publikationsdatum:
22.07.2011
Kurzfassung auf Englisch:
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.
Lizenz:
Standard-Veröffentlichungsvertrag