A geometric hierarchy beyond context-free languages
Theoretical Computer Science
Handbook of formal languages, vol. 3
Descriptive Approach to Language - Theoretic Complexity
Descriptive Approach to Language - Theoretic Complexity
MOSEL: A FLexible Toolset for Monadic Second-Order Logic
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Hardware Verification using Monadic Second-Order Logic
Proceedings of the 7th International Conference on Computer Aided Verification
Structural and Behavioral Modeling with Monadic Logics
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Representing constraints with automata
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
Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A model-theoretic framework for theories of syntax
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Structure sharing in lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A principle-based hierarchical representation of LTAGs
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Two Equivalent Regularizations for Tree Adjoining Grammars
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Computational linguistics and generative linguistics: the triumph of hope over experience
ILCL '09 Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics: Virtuous, Vicious or Vacuous?
Some interdefinability results for syntactic constraint classes
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
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
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars
Journal of Logic, Language and Information
| Hi-index | 0.00 |
We explore the use of weak monadic second-order languages over structures of varying dimension as specification languages for grammars and automata, focusing, in particular, on the extension of the longstanding results characterizing the regular and context-free languages in terms of definability in wS1S (one-dimensional) and wSnS (two-dimensional), respectively, to a characterization of the Tree-Adjoining Languages in terms of definability in the weak monadic second-order theory of certain three-dimensional tree-like structures. We then explore the application of these results to aspects of an existing large-scale Tree-Adjoining Grammar for English and close with some speculation on the feasibility of this approach as a means of building and maintaining such grammars.