Please use this identifier to cite or link to this item:
doi:10.22028/D291-23464 | Title: | Bridging the gap between underspecification formalisms : minimal recursion semantics as dominance constraints |
| Author(s): | Niehren, Joachim Thater, Stefan |
| Language: | English |
| Year of Publication: | 2003 |
| OPUS Source: | Proceedings of the 41st Meeting of the Association of Computational Linguistics, Sapporo, Japan, 5-13 July 2003, pp. 367-374 |
| SWD key words: | Formalismus <Mathematik> |
| Free key words: | Formalisms |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Conference Paper |
| Abstract: | Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-2767 hdl:20.500.11880/23520 http://dx.doi.org/10.22028/D291-23464 |
| Date of registration: | 29-Jun-2004 |
| Faculty: | P - Philosophische Fakultät |
| Department: | P - Sprachwissenschaft und Sprachtechnologie |
| Former Department: | bis SS 2016: Fachrichtung 4.7 - Allgemeine Linguistik |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| mrs_dom.pdf | 95,79 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.