Anette Frank
ABSTRACT
We present a constraint-based syntax-semantics interface for the construction of RMRS (Robust Minimal Recursion Semantics) representations from shallow grammars. The architecture is designed to allow modular interfaces to existing shallow grammars of various depth - ranging from chunk grammars to context-free stochastic grammars. We define modular semantics construction principles in a typed feature structure formalism that allow flexible adaptation to alternative grammars and different languages.
- A. Copestake, A. Lascarides, and D. Flickinger. 2001. An Algebra for Semantic Construction in Constraint-based Grammars. In Proceedings of the ACL 2001, Toulouse, France. Google Scholar
Digital Library
- A. Copestake, D. Flickinger, I. Sag, and C. Pollard. 2003. Minimal Recursion Semantics. Ms.Google Scholar
- A. Copestake. 2003. Report on the Design of RMRS. Technical Report D1.1a, University of Cambridge, University of Cambridge, UK., October. 23 pages.Google Scholar
- M. Daum, K. A. Foth, and W. Menzel. 2003. Constraint-based Integration of Deep and Shallow Parsing Techniques. In Proceedings of EACL 2003, Budapest, Hungary. Google ScholarDigital Library
- W. Drozdzynski, H.-U. Krieger, J. Piskorski, U. Schäfer, and F. Xu. 2004. Shallow processing with unification and typed feature structures --- foundations and applications. Künstliche Intelligenz, 1:17--23.Google Scholar
- D. Flickinger, E. M. Bender, and S. Oepen. 2003. MRS in the LinGO Grammar Matrix: A Practical User's Guide. Technical report, Deep Thought Project Deliverable 3.5.Google Scholar
- A. Frank, M. Becker, B. Crysmann, B. Kiefer, and U. Schäfer. 2003. Integrated Shallow and Deep Parsing: ToPP meets HPSG. In Proceedings of the ACL 2003, pages 104--111, Sapporo, Japan. Google ScholarDigital Library
- H.-U. Krieger and F. Xu. 2003. A type-driven method for compacting mmorph resources. In Proceedings of RANLP 2003, pages 220--224.Google Scholar
- Constraint-based RMRS construction from shallow grammars
Recommendations
Parsing expression grammars: a recognition-based syntactic foundation
POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languagesFor decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...
Parsing expression grammars: a recognition-based syntactic foundation
POPL '04For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, off-line ...
Comments