Talk:Tree-adjoining grammar
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
[Untitled][edit]
"Weakly context-sensitive" and "mildly context-sensitive" mean different things -- the former means that a grammar has the same weak generative capacity as a context-sensitive grammar, the latter means that a grammar formalism has three properties: (1) limited cross-serial dependencies; (2) constant growth; (3) polynomial parsing. So the latter (even if it is less frequent) is the appropriate term here. David Chiang
Examples?[edit]
| This topic is in need of attention from an expert on the subject. The section or sections that need attention may be noted in a message below. |
This article would greatly benefit from some concrete examples. -- Beland 13:48, 10 May 2005 (UTC)
Details[edit]
I would be very grateful for an explanation in some detail, why Tree-adjoining grammars are mildly context-sensitive, and not just context free and not fully context sensitive. I definetly support the cry for examples. graphic ones were especially great. Phelixxx 11:53, 25 May 2006 (UTC)
Definition?[edit]
Same thing as with Indexed Grammars: I'd like a formal definition, or several for the different flavors. Could someone who is familiar with the formalism provide one/some? UKoch (talk) 16:31, 26 December 2010 (UTC)