Minimal Recursion Semantics

Minimal Recursion Semantics is a formal framework for representing semantic structures in natural language processing that distinguishes itself by enabling efficient, compositionally grounded mappings between syntactic derivations and underspecified meaning representations through minimal recursive templates.

24

Publications

1.7K

Citations

50

Authors

26

Institutions

Publications per year

2017–2026

1

Authors

50

  1. AC
    Ann Copestake

    University of Cambridge, United Kingdom

    5 publications · 1.2K citations

    5

    h-index

  2. DF
    Dan Flickinger

    Stanford University, United States

    4 publications · 1.1K citations

    4

    h-index

  3. FB
    Francis Bond

    NTT (Japan), Japan

    4 publications · 100 citations

    4

    h-index

  4. EN
    Eric Nichols

    Honda (Japan), Japan

    3 publications · 69 citations

    3

    h-index

  5. DS
    David Schlangen

    Bielefeld University, Germany

    2 publications · 22 citations

    2

    h-index

1–5 of 50

Venues

  1. 2

    h-index

  2. Research on Language and Computation

    1 publications · 1K citations

    1

    h-index

  3. Dialogue & Discourse

    1 publications · 44 citations

    1

    h-index

  4. arXiv (Cornell University)

    Repository · 1 publications · 19 citations

    1

    h-index

  5. International Conference on Computational Linguistics

    Conference · 1 publications · 11 citations

    1

    h-index

1–5