Skip to Main content Skip to Navigation
Conference papers

Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints

Joachim Niehren 1 Stefan Thater 2 
1 LIFL - Laboratoire d'Informatique Fondamentale de Lille
2 Allgemeine Linguistik - Allgemeine Linguistik Computational Linguistics and phonetics
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
https://hal.inria.fr/inria-00536543
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Saturday, February 5, 2011 - 12:55:13 PM
Last modification on : Thursday, February 21, 2019 - 10:52:45 AM
Long-term archiving on: : Friday, May 6, 2011 - 2:21:11 AM

File

Vignette du document
mrs-dom.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00536543, version 1

Collections

UNIV-LILLE3 | CNRS | INRIA | LIFL

Citation

Joachim Niehren, Stefan Thater. Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. 41st Meeting of the Association of Computational Linguistics (ACL), 2003, Saporo, Japan. pp.367-374. ⟨inria-00536543⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

81

Files downloads

85

 

Contact                    Legal Notice                    Personal Data