1749-818X/asset/olbannerleft.jpg?v=1&s=0edfbd2e17ed9e42724131a7af63c93c12a64411)
1749-818X/asset/olbannerright.jpg?v=1&s=0e9c148378d2cf06eb08813be816b8e26bc8cdf8)
Linear Context-Free Rewriting Systems
Article first published online: 24 JAN 2013
DOI: 10.1002/lnc3.359
© 2008 The Authors Language and Linguistics Compass © 2008 Blackwell Publishing Ltd
Additional Information
How to Cite
Kallmeyer, L. (2013), Linear Context-Free Rewriting Systems. Language and Linguistics Compass, 7: 22–38. doi: 10.1002/lnc3.359
Publication History
- Issue published online: 24 JAN 2013
- Article first published online: 24 JAN 2013
- Abstract
- Article
- References
- Cited By
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.