Abstract
The class of mildly context-sensitive languages is commonly regarded as sufficiently rich to capture most aspects of the syntax of natural languages. Many formalisms are known to generate families of languages which belong to this class. Among them are tree-adjoining grammars, multiple context-free grammars and abstract categorial grammars. All these formalisms have in common that they are based on operations which do not copy already derived material in the course of a derivation. We propose an extension of the class of languages captured by these formalisms that is arguably mildly context-sensitive. This extension is based on a mild use of a copying operation we call IO-substitution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bourreau, P., Salvati, S.: A Datalog recognizer for almost affine λ-CFGs. In: Kanazawa, M., Kornai, A., Kracht, M., Seki, H. (eds.) MOL 12. LNCS, vol. 6878, pp. 21–38. Springer, Heidelberg (2011)
de Groote, P.: Towards abstract categorial grammars. In: Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pp. 148–155 (2001)
de Groote, P., Pogodalla, S.: On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information 13(4), 421–438 (2004)
Fischer, M.J.: Grammars with macro-like productions. In: IEEE Conference Record of 9th Annual Symposium on Switching and Automata Theory, pp. 131–142. IEEE (1968)
Fischer, M.J.: Grammars with macro-like productions. PhD thesis, Harvard University (1968)
Joshi, A.K.: Tree-adjoining grammars: How much context-sensitivity is required to provide reasonable strucutral descriptions? In: Natural Language Parsing: Psychological, Computational and Theoretical Perspectives, pp. 206–250 (1985)
Joshi, A.K., Shanker, V.K., Weir, D.J.: The converence of mildly context-sensitive grammar formalisms. In: Sells, P., Shieber, S.M., Wasow, T. (eds.) Foundational Issues in Natural Language Processing, pp. 31–81. The MIT Press (1991)
Kallmeyer, L.: On mildly context-sensitive non-linear rewriting. Research on Language and Computation 8(2), 341–363 (2010)
Kanazawa, M.: Abstract families of abstract categorial grammars. In: Proceedings of WoLLIC, Stanford University CSLI (2006)
Kanazawa, M.: Parsing and generation as Datalog queries. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, Prague, pp. 176–183. Association for Computational Linguistics (2007)
Kanazawa, M.: Second-order abstract categorial grammars as hyperedge replacement grammars. Journal of Logic, Language and Information 19(2), 137–161 (2010)
Muskens, R.: Lambda Grammars and the Syntax-Semantics Interface. In: van Rooy, R., Stokhof, M. (eds.) Proceedings of the Thirteenth Amsterdam Colloquium, Amsterdam, pp. 150–155 (2001)
Salvati, S.: Encoding second-order ACGs with deterministic tree walking transducers. In: Proceedings of Formal Grammar, Malaga, Spain (2006)
Salvati, S.: MIX is a 2-MCFL and the word problem in ℤ2 is captured by the IO and the OI hierarchies. Technical report, INRIA (2011)
Seki, H., Matsamura, T., Mamoru, F., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)
Stabler, E.P.: Derivational minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68–95. Springer, Heidelberg (1997)
Venkateswaran, H.: Properties that characterize LOGCFL. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 141–150. ACM (1987)
Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, Stanford (1987)
Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania (1988)
Yoshinaka, R.: Linearization of affine abstract categorial grammars. In: Proceedings of the 11th Conference on Formal Grammar, Malaga, Spain, pp. 185–199 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bourreau, P., Kallmeyer, L., Salvati, S. (2013). On IO-Copying and Mildly-Context Sensitive Formalisms. In: Morrill, G., Nederhof, MJ. (eds) Formal Grammar. FG FG 2013 2012. Lecture Notes in Computer Science, vol 8036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39998-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-39998-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39997-8
Online ISBN: 978-3-642-39998-5
eBook Packages: Computer ScienceComputer Science (R0)