Please use this identifier to cite or link to this item: doi:10.22028/D291-25127
Title: Incremental natural-language processing with schema-tree adjoining grammars
Author(s): Harbusch, Karin
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: Schema-Tree Adjoining Grammars are proposed for compressing natural-language grammars. Their rules allow for regular expressions associated with inner nodes of elementary trees referring to individual sons of inner nodes in order to describe their occurrences and repetitions in the set of elementary trees specified. In the following, the adequacy of representing a possibly infinite set of trees by one scheme is discussed for incremental natural-language processing where the input is consumed and processed piecemeal. The basic idea is to avoid decisions for which not enough information is available at the moment by the condensed representation of all currently valid alternatives in terms of semi-instantiated schemata. We present an extended Early processing which allows for mixing partially instantiated trees and uninstantiated schemata.
Link to this record: urn:nbn:de:bsz:291-scidok-40792
Series name: Vm-Report / Verbmobil, Verbundvorhaben, [Deutsches Forschungszentrum für Künstliche Intelligenz]
Series volume: 41
Date of registration: 3-Aug-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 SizeFormat 
report_41_94.pdf266,65 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.