Dominik Heckmann


2000

pdf
Parsing Mildly Context-sensitive RMS
Tilman Becker | Dominik Heckmann
Proceedings of the Sixth International Workshop on Parsing Technologies

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 𝒪(n2h + 1), and 𝒪(n3h) 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.

1998

pdf
Recursive Matrix Systems (RMS) and TAG
Tilman Becker | Dominik Heckmann
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)

Search
Co-authors
Venues