Linear Context‐Free Rewriting Systems
Laura Kallmeyer · Language and Linguistics Compass · 2013
Abstract This paper introduces Linear Context‐Free Rewriting Systems, a mildly context‐sensitive grammar formalism that displays a range of interesting formal properties and that has attracted a lot of interest in the context of natural language parsing recently because of its capacity to describe discontinuous constituents and non‐projective dependencies. Besides a presentation of the formalism, the paper includes a discussion of recent LCFRS applications in parsing and dependency grammar.