Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Semi-thue systems and representations of trees
SWAT '69 Proceedings of the 10th Annual Symposium on Switching and Automata Theory (swat 1969)
Journal of Computer and System Sciences
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Lexicalized Proof-Nets and TAGs
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Polarized Non-projective Dependency Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Some Experimental Results with Tree Adjunct Grammar Guided Genetic Programming
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
DNA evolutionary linguistics and RNA structure modeling: a computational approach
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Fully generated scripted dialogue for embodied agents
Artificial Intelligence
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Learning General Solutions through Multiple Evaluations during Development
ICES '08 Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware
Spatially Constrained Grammars for Mobile Intention Recognition
Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space
Pseudoknot Identification through Learning TAGRNA
PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science
The Non-associativity of Polarized Tree-Based Grammars
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Two Equivalent Regularizations for Tree Adjoining Grammars
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
RNA Pseudoknot Folding through Inference and Identification Using TAGRNA
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Information and Computation
Linearity and nondeletion on monadic context-free tree grammars
Information Processing Letters
On the Membership Problem for Non-Linear Abstract Categorial Grammars
Journal of Logic, Language and Information
Grammar-based Genetic Programming: a survey
Genetic Programming and Evolvable Machines
Efficient parsing of well-nested linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
A decoder for probabilistic synchronous tree insertion grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Uncertainty learning using SVMs and CRFs
CoNLL '10: Shared Task Proceedings of the Fourteenth Conference on Computational Natural Language Learning --- Shared Task
The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
String-to-dependency statistical machine translation
Computational Linguistics
Evolving stories: tree adjoining grammar guided genetic programming for complex plot generation
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar
Computational Linguistics
An unsupervised approach for linking automatically extracted and manually crafted LTAGs
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
Towards modular development of typed unification grammars
Computational Linguistics
Multi-component tree insertion grammars
FG'09 Proceedings of the 14th international conference on Formal grammar
The generative capacity of the lambek-grishin calculus: a new lower bound
FG'09 Proceedings of the 14th international conference on Formal grammar
A probabilistic model for sequence alignment with context-sensitive indels
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
A comparison of GE and TAGE in dynamic environments
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Metagrammar engineering: towards systematic exploration of implemented grammars
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Adjoining tree-to-string translation
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Examining mutation landscapes in grammar based genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Operator self-adaptation in genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete
Journal of Logic, Language and Information
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars
Journal of Logic, Language and Information
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
A computational grammar for Persian based on GPSG
Language Resources and Evaluation
Developmental evaluation in genetic programming: the preliminary results
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
A parallel approach to syllabification
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Genetic transposition in tree-adjoining grammar guided genetic programming: the duplication operator
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Relaxed cross-lingual projection of constituent syntax
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Two-dimensional visual language grammar
TSD'06 Proceedings of the 9th international conference on Text, Speech and Dialogue
The XDG grammar development kit
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
Deterministic recognition of trees accepted by a linear pushdown tree automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Evolving the best known approximation to the Q function
Proceedings of the 14th annual conference on Genetic and evolutionary computation
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
Codeco: a practical notation for controlled english grammars in predictive editors
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
On Characterizing Recursively Enumerable Languages by Insertion Grammars
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Multi-Bracketed Contextual Rewriting Grammars
Fundamenta Informaticae
An Efficient Parser for a Class of Contextual Languages
Fundamenta Informaticae
On Using Semi-Dyck Sets To Analyse Coupled-Context-Free Languages
Fundamenta Informaticae
Managing Multiple Knowledge Sources In Constraint-Based Parsing Of Spoken Language
Fundamenta Informaticae
Geometric Representations for Minimalist Grammars
Journal of Logic, Language and Information
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Estimating compact yet rich tree insertion grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
Analysing the effects of diverse operators in a genetic programming system
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
A Principled Approach to Grammars for Controlled Natural Languages and Predictive Editors
Journal of Logic, Language and Information
Bridge the gap between statistical and hand-crafted grammars
Computer Speech and Language
Incremental, predictive parsing with psycholinguistically motivated tree-adjoining grammar
Computational Linguistics
| Hi-index | 0.00 |
In this paper, a tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd (Information and Control14 (1969), 217-231) and Rounds (Mathematical Systems Theory 4 (1970), 257-287) and to the recognizable sets and local sets discussed by Thatcher (Journal of Computer and System Sciences1 (1967), 317-322; 4 (1970), 339-367) and Rounds. Linguistic relevance of these systems has been briefly discussed also.