Semantic Composition with (Robust) Minimal Recursion Semantics

What it is about

The paper looks at semantic composition in Minimal Recursion Semantics (MRS) and in its robust variant (RMRS), which suits shallow analysers. It shows that an earlier algebra for composition applies to grammars with no full lexicon, and it implements the algebra for the RASP parser. Each grammar rule carries a composition rule that fills holes and equates variables. If a tree uses a rule with no composition rule, its relations are simply appended, so composition is robust to gaps in the semantic component. The paper reports no case where the algebra blocks a composition that the English Resource Grammar produces. It gives no coverage figures.

Ideas

• I1. en/src/expert.rs: attach a small composition step to each expert rule. Rules without one append their relations by default. Count the EWT test trees that use a rule without a composition step.
• I2. world/src/frames.rs: build frames from en trees with the same append-by-default fallback. Hand-check 50 sentences of our own text and report the share of frames with an appended, unexplained relation.
• I3. Order check: compose the frames of each tree in a fixed bottom-up order and in a shuffled sibling order. The outputs must match. Negative control: a broken composition rule must fail this check.

For Mova

The code is en/src/expert.rs and world/src/frames.rs; the chapter is 21. The simple clause. The paper has no numbers, and its formalism (MRS, RASP, ERG) is not Mova's. Measure on EWT only.

Cite

The paper itself, not this card. BibTeX from the library's record of the work. DOI 10.3115/1608912.1608925

@inproceedings{copestake2007semantic,
  title = {{Semantic Composition with (Robust) Minimal Recursion Semantics}},
  author = {Copestake, Ann},
  booktitle = {ACL 2007 Workshop on Deep Linguistic Processing},
  year = {2007},
  doi = {10.3115/1608912.1608925},
  url = {https://doi.org/10.3115/1608912.1608925}
}

References

15 references, 2 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Johan Bos, Stephen Clark, Mark Steedman, James R. Curran and Julia Hockenmaier 2004. Wide-Coverage Semantic Representations from a CCG Parser. COL-ING ’04, Geneva. find
2. Johan Bos. 2005. Towards Wide-Coverage Semantic Interpretation. Sixth International Workshop on Computational Semantics IWCS-6. 42–53. find
3. Ted Briscoe and John Carroll. 2002. Robust accurate statistical annotation of general text. LREC-2002, Las Palmas, Gran Canaria. find
4. Ann Copestake, Alex Lascarides, and Dan Flickinger. 2001. An Algebra for Semantic Construction in Constraint-based Grammars. ACL-01, Toulouse. find our card
5. Ann Copestake. 2003. Report on the design of RMRS . DeepThought project deliverable. find
6. Ann Copestake, Dan Flickinger, Ivan Sag, and Carl Pollard. 2005. Minimal Recursion Semantics: An introduction. Research in Language and Computation 3(2–3), 281–332. find
7. Dan Flickinger 2000. On building a more efficient grammar by exploiting types. Natural Language Engineering,6:1,15–28. find our card
8. Ruth Fuchss, Alexander Koller, Joachim Niehren, and Stefan Thater 2004. Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. Proceedings of the 42nd ACL, Barcelona. find
9. Gerald Gazdar, Ewan Klein, Geoffrey Pullum and Ivan Sag 1985. find
10. Generalized Phrase Structure Grammar. Basil Blackwell, Oxford Petter Haugereid 2004. Linking in Constructions. HPSG2004, Leuven. find
11. Aurelie Herbelot and Ann Copestake 2006. Acquiring Ontological Relationships from Wikipedia Using RMRS . ISWC 2006 Workshop on Web Content Mining with Human Language Technologies, Athens, Georgia. find
12. Kathrin Spreyer and Anette Frank. 2005 Projecting RMRS from TIGER Dependencies. find
13. Hans Uszkoreit, Ulrich Callmeier, Andreas Eisele, Ulrich Schfer, Melanie Siegel, Jakob Uszkoreit. 2004. Hybrid Robust Deep and Shallow Semantic Processing for Creativity Support in Document Production. find
14. KONVENS 2004, Vienna, Austria, 209–216. find
15. Rebecca Watson, Judita Preiss and EJ Briscoe. 2003. The Contribution of Domain-independent Robust Pronominal Anaphora Resolution to Open-Domain Question-Answering. Int. Symposium on Reference Resolution and its Application to Question-Answering and Summarisation, Venice. find

This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/aclbulk-2007-copestake-semantic-composition-robust-minimal-recursion/