On IO-Copying and Mildly-Context Sensitive Formalisms

  • Pierre Bourreau
  • Laura Kallmeyer
  • Sylvain Salvati
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8036)


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.


mildly context-sensitive formalisms abstract categorial grammars semilinear and constant-growth languages IO grammars 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BS11]
    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)CrossRefGoogle Scholar
  2. [dG01]
    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)Google Scholar
  3. [dGP04]
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  4. [Fis68a]
    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)Google Scholar
  5. [Fis68b]
    Fischer, M.J.: Grammars with macro-like productions. PhD thesis, Harvard University (1968)Google Scholar
  6. [Jos85]
    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)Google Scholar
  7. [JSW91]
    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)Google Scholar
  8. [Kal10]
    Kallmeyer, L.: On mildly context-sensitive non-linear rewriting. Research on Language and Computation 8(2), 341–363 (2010)MathSciNetCrossRefGoogle Scholar
  9. [Kan06]
    Kanazawa, M.: Abstract families of abstract categorial grammars. In: Proceedings of WoLLIC, Stanford University CSLI (2006)Google Scholar
  10. [Kan07]
    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)Google Scholar
  11. [Kan10]
    Kanazawa, M.: Second-order abstract categorial grammars as hyperedge replacement grammars. Journal of Logic, Language and Information 19(2), 137–161 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  12. [Mus01]
    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)Google Scholar
  13. [Sal06]
    Salvati, S.: Encoding second-order ACGs with deterministic tree walking transducers. In: Proceedings of Formal Grammar, Malaga, Spain (2006)Google Scholar
  14. [Sal11]
    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)Google Scholar
  15. [SMMK91]
    Seki, H., Matsamura, T., Mamoru, F., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  16. [Sta96]
    Stabler, E.P.: Derivational minimalism. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 68–95. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  17. [Ven87]
    Venkateswaran, H.: Properties that characterize LOGCFL. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 141–150. ACM (1987)Google Scholar
  18. [VSWJ87]
    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)Google Scholar
  19. [Wei88]
    Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania (1988)Google Scholar
  20. [Yos06]
    Yoshinaka, R.: Linearization of affine abstract categorial grammars. In: Proceedings of the 11th Conference on Formal Grammar, Malaga, Spain, pp. 185–199 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Pierre Bourreau
    • 1
  • Laura Kallmeyer
    • 2
  • Sylvain Salvati
    • 1
  1. 1.Université Bordeaux 1Talence CedexFrance
  2. 2.Heine-Heinrich Universität DüsseldorfDüsseldorfGermany

Personalised recommendations