- Author:
- James Rogers
From the Publisher:
Early formal specifications of natural language syntax were quite closely connected to the notion of abstract machines for computing them. More recently, this approach has been superseded by one in which languages are specified in terms of systems of constraints on the structure of their sentences. This book presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines.
Cited By
- Boral A and Schmitz S Model-Checking Parse Trees Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (153-162)
- Graf T Movement-generalized minimalist grammars Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics, (58-73)
- Graf T Closure properties of minimalist derivation tree languages Proceedings of the 6th international conference on Logical aspects of computational linguistics, (96-111)
- Graf T Reference-Set constraints as linear tree transductions via controlled optimality systems Proceedings of the 15th and 16th international conference on Formal Grammar, (97-113)
- Pullum G Computational linguistics and generative linguistics Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics: Virtuous, Vicious or Vacuous?, (12-21)
- Kobele G Without remnant movement, MGs are context-free Proceedings of the 10th and 11th Biennial conference on The mathematics of language, (160-173)
- Kepser S and Rogers J The equivalence of tree adjoining grammars and monadic linear context-free tree grammars Proceedings of the 10th and 11th Biennial conference on The mathematics of language, (129-144)
- Graf T Some interdefinability results for syntactic constraint classes Proceedings of the 10th and 11th Biennial conference on The mathematics of language, (72-87)
- ten Cate B and Marx M Axiomatizing the logical core of XPath 2.0 Proceedings of the 11th international conference on Database Theory, (134-148)
- Kepser S and Mönnich U (2006). Closure properties of linear context-free tree languages with an application to optimality theory, Theoretical Computer Science, 354:1, (82-97), Online publication date: 21-Mar-2006.
Marx M (2005). Conditional XPath, ACM Transactions on Database Systems (TODS), 30:4, (929-959), Online publication date: 1-Dec-2005.- Sgouros T (2005). What Is Context For? Syntax in a Non-Abstract World, Journal of Logic, Language and Information, 14:2, (235-251), Online publication date: 1-Mar-2005.
- Marx M First order paths in ordered trees Proceedings of the 10th international conference on Database Theory, (114-128)
- Marx M Conditional XPath, the first order complete XPath dialect Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (13-22)
- Moss L and Tiede H (2004). Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001., ACM SIGACT News, 35:1, (8-12), Online publication date: 1-Mar-2004.
- Rogers J A model-theoretic framework for theories of syntax Proceedings of the 34th annual meeting on Association for Computational Linguistics, (10-16)
Recommendations
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell SymposiumProgrammers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...