Please use this identifier to cite or link to this item:
doi:10.22028/D291-24970
Title: | Efficient parameterizable type expansion for typed feature formalisms |
Author(s): | Krieger, Hans-Ulrich Schäfer, Ulrich |
Language: | English |
Year of Publication: | 1995 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1995 |
SWD key words: | Künstliche Intelligenz |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | Over the last few years, constraint-based grammar formalisms have become the predominant paradigm in natural language processing and computational linguistics. From the viewpoint of computer science, typed feature structures can be seen as a record-like data structure that allow the representation of linguistic knowledge in a uniform fashion. Type expansion is an operation that makes the idiosyncratic and inherited constraints defined on a typed feature structure explicit and thus determines its satisfiability. We describe an efficient expansion algorithm that takes care of recursive type definitions and permits the exploration of different expansion strategies through the use of control knowledge. This knowledge is specified on a separate layer, independent of grammatical information. The algorithm, as presented in the paper, has been fully implemented in COMMON LISP and is an integrated part of the typed feature formalism TDL that is employed in several large NL projects. |
Link to this record: | urn:nbn:de:bsz:291-scidok-37599 hdl:20.500.11880/25026 http://dx.doi.org/10.22028/D291-24970 |
Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
Series volume: | 95-18 |
Date of registration: | 30-Jun-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 | |
---|---|---|---|---|
RR_95_18.pdf | 376,7 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.