Book reviews: Tree adjoining grammars: formalisms, linguistic analysis and processing
Computational Linguistics
An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
Structural similarity within and among languages
Theoretical Computer Science - Algebraic methods in language processing
Tabular parsing and algebraic transformations
Theoretical Computer Science - Algebraic methods in language processing
A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Parsing some constrained grammar formalisms
Computational Linguistics
Review of "The syntactic process" by Mark Steedman. The MIT Press 2000.
Computational Linguistics
Tree Adjoining Grammars in a fragment of the Lambek calculus
Computational Linguistics
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
The use of shared forests in tree adjoining grammar parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A tractable extension of Linear Indexed Grammars
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Generative power of CCGs with generalized type-raised categories
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Lexicalized context-free grammars
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Efficient normal-form parsing for combinatory categorial grammar
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Information and Computation
The Syntactic Process: Language, Speech, and Communication, Mark Steedman
Journal of Logic, Language and Information
Linearity and nondeletion on monadic context-free tree grammars
Information Processing Letters
Highly constrained unification grammars
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Restrictions on monadic context-free tree grammars
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Mild Context-Sensitivity, After Twenty Years
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Highly Constrained Unification Grammars
Journal of Logic, Language and Information
Conjunctive Grammars and Alternating Pushdown Automata
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Consensual Definition of Languages by Regular Sets
Language and Automata Theory and Applications
Spatially Constrained Grammars for Mobile Intention Recognition
Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space
Dependency trees and the strong generative capacity of CCG
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop
Single-Path Restarting Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Charts, interaction-free grammars, and the compact representation of ambiguity
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Information and Computation
Linearity and nondeletion on monadic context-free tree grammars
Information Processing Letters
A finite-state functional grammar architecture
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Restarting tree automata and linear context-free tree languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Accurate context-free parsing with combinatory categorial grammar
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
The importance of rule restrictions in CCG
ACL '10 Proceedings of the 48th Annual Meeting 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
Mildly context-sensitive languages via buffer augmented pregroup grammars
Time for verification
Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
FG'09 Proceedings of the 14th international conference on Formal grammar
Top-down recognizers for MCFGs and MGs
CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
Formal language constrained reachability and model checking propositional dynamic logics
RP'11 Proceedings of the 5th international conference on Reachability problems
A $${\mathcal{O}(|G|n^6)}$$ time extension of inversion transduction grammars
Machine Translation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Modular natural language processing using declarative attribute grammars
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
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
Two models of learning iterated dependencies
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Iterated dependencies and Kleene iteration
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Mild Context-Sensitivity, After Twenty Years
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Efficient parsing with linear context-free rewriting systems
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
MIX is not a tree-adjoining language
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Hi-index | 0.00 |