Abstract
We propose some extensions of mildly context-sensitive formalisms whose aim is to model free word orders in natural languages. We give a detailed analysis of the complexity of the formalisms we propose.
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
Araki, T., Tokura, N.: Flow languages equal recursively enumerable languages. Acta Informatica 15(3), 209–217 (1981)
Becker, T., Rambow, O., Niv, M.: The derivational generative power of formal systems or scrambling is beyond LCFRS. Technical Report IRCS-92-38, UPENN (1992)
Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. JACM 28(1), 114–133 (1981)
Dassow, J.: Grammars with regulated rewriting. In: Formal Languages and Applications, pp. 249–273. Springer (2004)
de Groote, P.: Towards abstract categorial grammars. In: ACL (ed.). Proceedings 39th Annual Meeting and 10th Conference of the European Chapter, pp. 148–155 (2001)
Gerdes, K., Kahane, S.: Word order in German: A formal dependency grammar using a topological hierarchy. In: ACL, pp. 220–227 (2001)
Jedrzejowicz, J., Szepietowski, A.: On the expressive power of the shuffle operator matched with intersection by regular sets. RAIRO 35(4), 379–388 (2001)
Joshi, A.K.: Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions? In: Natural Language Parsing, pp. 206–250. CUP (1985)
Kaji, Y., Nakanishi, R., Seki, H., Kasmi, T.: The universal recognition problems for multiple context-free grammars and for linear context-free rewriting systems. IEICE Trans. Inf. & Syst. E 75-D(1), 78–88 (1992)
Kanazawa, M.: Abstract families of abstract categorial languages. In: 13th WoLLIC, ENTCS, pp. 65–80 (2006)
Kanazawa, M.: Second-order abstract categorial grammars as hyperedge replacement grammars. Journal of Logic, Language and Information 19(2), 137–161 (2010)
Kanazawa, M., Salvati, S.: MIX is not a tree-adjoining language. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers, vol. 1, pp. 666–674. ACL (2012)
Kuhlmann, M., Möhl, M.: Mildly context-sensitive dependency languages. In: ACL (2007)
Lopatková, M., Plátek, M., Kuboň, V.: Modeling syntax of free word-order languages: Dependency analysis by reduction. In: Matoušek, V., Mautner, P., Pavelka, T. (eds.) TSD 2005. LNCS (LNAI), vol. 3658, pp. 140–147. Springer, Heidelberg (2005)
Muskens, R.: Separating syntax and combinatorics in categorial grammar. Research on Language and Computation 5(3), 267–285 (2007)
Parikh, R.: On context-free languages. JACM 13(4), 570–581 (1966)
Rambow, O.: Multiset-valued linear index grammars: imposing dominance constraints on derivations. In: Proceedings of the 32nd Annual Meeting on Association for Computational Linguistics, pp. 263–270. ACL (1994)
Ruzzo, W.L.: Tree-size bounded alternation. JCSS 21(2), 218–235 (1980)
Salvati, S.: Problèmes de filtrage et problème d’analyse pour les grammaires catégorielles abstraites. PhD thesis, INPL (2005)
Salvati, S.: Mix is a 2-MCFL and the word problem in ℤ2 is solved by a third-order collapsible pushdown automaton. Technical report, INRIA (2011)
Shaw, A.: Software descriptions with flow expressions. IEEE Transactions on Software Engineering 4(3), 242–254 (1978)
Shieber, S.: Direct parsing of ID/LP grammars. Linguistics and Philosophy 2(7), 135–154 (1984)
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
Kirman, J., Salvati, S. (2013). On the Complexity of Free Word Orders. 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_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-39998-5_13
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)