Mildly context-sensitive grammars (Q4662828)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2150279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mildly context-sensitive grammars |
scientific article; zbMATH DE number 2150279 |
Statements
30 March 2005
0 references
natural languages
0 references
tree-adjoining grammars
0 references
mildly context-free grammars
0 references
0.79754638671875
0 references
0.7898542881011963
0 references
0.7851788401603699
0 references
0.7776219844818115
0 references
Mildly context-sensitive grammars (English)
0 references
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].
0 references