@inproceedings{becker-heckmann-2000-parsing,
    title = "Parsing Mildly Context-sensitive {RMS}",
    author = "Becker, Tilman  and
      Heckmann, Dominik",
    editor = "Lavelli, Alberto  and
      Carroll, John  and
      Berwick, Robert C.  and
      Bunt, Harry C.  and
      Carpenter, Bob  and
      Carroll, John  and
      Church, Ken  and
      Johnson, Mark  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Lang, Bernard  and
      Lavie, Alon  and
      Nijholt, Anton  and
      Samuelsson, Christer  and
      Steedman, Mark  and
      Stock, Oliviero  and
      Tanaka, Hozumi  and
      Tomita, Masaru  and
      Uszkoreit, Hans  and
      Vijay-Shanker, K.  and
      Weir, David  and
      Wiren, Mats",
    booktitle = "Proceedings of the Sixth International Workshop on Parsing Technologies",
    month = feb # " 23-25",
    year = "2000",
    address = "Trento, Italy",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/fix-sig-urls/2000.iwpt-1.29/",
    pages = "293--294",
    abstract = "We introduce Recursive Matrix Systems (RMS) which encompass mildly context-sensitive formalisms and present efficient parsing algorithms for linear and context-free variants of RMS. The time complexities are $\mathcal{O}(n^{2h + 1})$, and $\mathcal{O}(n^{3h})$ respectively, where $h$ is the height of the matrix. It is possible to represent Tree Adjoining Grammars (TAG [1], MC-TAG [2], and R-TAG [3]) as RMS uniformly."
}