The following pages link to Tree adjunct grammars (Q1225947):
Displayed 50 items.
- The grammar of mammalian brain capacity (Q290555) (← links)
- Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- The equivalence of tree adjoining grammars and monadic linear context-free tree grammars (Q438589) (← links)
- Lexicalized non-local MCTAG with dominance links is NP-complete (Q438591) (← links)
- Grammatical verification for mathematical formula recognition based on context-free tree grammar (Q626924) (← links)
- Linear time parsers for classes of non context free languages (Q671525) (← links)
- Parallel parsing of tree adjoining grammars on the connection machine (Q685085) (← links)
- An NC algorithm for recognizing tree adjoining languages (Q685232) (← links)
- Associative grammar combination operators for tree-based grammars (Q735406) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- Linearity and nondeletion on monadic context-free tree grammars (Q835003) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- On the complexity of 2-monotone restarting automata (Q927391) (← links)
- On the membership problem for non-linear abstract categorial grammars (Q972435) (← links)
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction (Q1004085) (← links)
- Highly constrained unification grammars (Q1024820) (← links)
- On multiple context-free grammars (Q1177161) (← links)
- A geometric hierarchy beyond context-free languages (Q1200806) (← links)
- Augmented transition networks and their relation to tree transducers (Q1238432) (← links)
- TAL recognition in \(O(M(n^2))\) time (Q1267714) (← links)
- Tree adjoining grammars for RNA structure prediction (Q1274602) (← links)
- Characterizations of recursively enumerable languages by means of insertion grammars (Q1275078) (← links)
- On parsing coupled-context-free languages (Q1351955) (← links)
- LR(k)-coupled-context-free grammars (Q1352135) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- wMSO theories as grammar formalisms (Q1870569) (← links)
- Boolean grammars (Q1886037) (← links)
- Context-free grammars with lookahead (Q2232284) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Geometric representations for minimalist grammars (Q2255202) (← links)
- A principled approach to grammars for controlled natural languages and predictive editors (Q2255208) (← links)
- Categorial dependency grammars (Q2344756) (← links)
- Fully generated scripted dialogue for embodied agents (Q2389657) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Learning Tree Languages (Q2963598) (← links)
- Natural Language Processing, Moving from Rules to Data (Q2988808) (← links)
- Sample Selection for Statistical Parsing (Q3225416) (← links)
- Discriminative Reranking for Natural Language Parsing (Q3225425) (← links)
- Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes (Q3225430) (← links)
- CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS (Q3401474) (← links)
- Two Equivalent Regularizations for Tree Adjoining Grammars (Q3618604) (← links)
- Tree adjunct languages as integer set recognizers† (Q4199554) (← links)
- The equivalence of four extensions of context-free grammars (Q4311636) (← links)
- Fast uniform analysis of Coupled-Context-Free languages (Q4632444) (← links)
- Pumping lemmas for the control language hierarchy (Q4835863) (← links)
- A Model-Theoretic Description of Tree Adjoining Grammars1 1The research presented in this paper was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 441, TP A2. The authors wish to thank Jens Michaelis and Stephan Kepser (Q4923565) (← links)
- On Tree Substitution Grammars (Q5041264) (← links)