Mildly context-sensitive grammars
From MaRDI portal
It is generally agreed that context-free grammars are too weak for representing certain aspects of natural languages. On the other hand, context-sensitive grammars are problematic from the algorithmic point of view. Hence the quest for suitable intermediate formalisms. After stating his criteria for a family of grammars to be mildly context-sensitive, the author notes that tree-adjoining grammars as well as a couple of other grammar types considered in the literature form such families. For the entire collection see [Zbl 1051.68020].
Recommendations
Cited in
(14)- Underlying principles and recurring ideas of formal grammars
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
- An attempt to define a class of mildly context-sensitive languages
- Minimalist Grammar Transition-Based Parsing
- Mildly context-sensitive languages via buffer augmented pregroup grammars
- scientific article; zbMATH DE number 569754 (Why is no real title available?)
- scientific article; zbMATH DE number 569755 (Why is no real title available?)
- Semilinearity as a syntactic invariant
- scientific article; zbMATH DE number 1836412 (Why is no real title available?)
- On weak growing context-sensitive grammars
- On IO-copying and mildly-context sensitive formalisms
- Context-sensitive immediate constituent analysis -- context-free languages revisited
- Context-sensitive node admissibility
- Commutation-augmented pregroup grammars and push-down automata with cancellation
This page was built for publication: Mildly context-sensitive grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4662828)