On the computational complexity of dominance links in grammatical formalisms

ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2010, Pages 514-524

  Schmitz, Sylvain ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY BOUNDS; COMPLEXITY RESULTS; EMPTINESS PROBLEM;

COMPUTATIONAL LINGUISTICS;

EID: 84859974013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (55)

1. Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel. 2003. An efficient graph algorithm for dominance constraints. Journal of Algorithms, 48(1):194-219.
2. Yehoshua Bar-Hillel, Micha Perles, and Eliahu Shamir. 1961. On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung, 14:143-172.
3. G. Edward Barton. 1985. The computational difficulty of ID/LP parsing. In ACL'85, pages 76-81. ACL Press.
4. Tilman Becker, Aravind K. Joshi, and Owen Rambow. 1991. Long-distance scrambling and tree adjoining grammars. In EACL'91, pages 21-26. ACL Press.
5. Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick, and Luc Segoufin. 2009. Twovariable logic on data trees and XML reasoning. Journal of the ACM, 56(3):1-48.
6. Marie-Hélène Candito and Sylvain Kahane. 1998. Defining DTG derivations to get semantic graphs. In TAG+4, pages 25-28.
7. E. Cardoza, Richard J. Lipton, and Albert R. Meyer. 1976. Exponential space complete problems for Petri nets and commutative semigroups: Preliminary report. In STOC'76, pages 50-54. ACM Press.
8. Lucas Champollion. 2007. Lexicalized non-local MCTAG with dominance links is NP-complete. In MOL 10.
9. Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. 1981. Alternation. Journal of the ACM, 28(1):114-133.
10. David Chiang and Tatjana Scheffler. 2008. Flexible composition and delayed tree-locality. In TAG+9.
11. Armin B. Cremers and Otto Mayer. 1974. On vector languages. Journal of Computer and System Sciences, 8(2):158-166.
12. Philippe de Groote, Bruno Guillaume, and Sylvain Salvati. 2004. Vector addition tree automata. In LICS'04, pages 64-73. IEEE Computer Society.
13. Stéphane Demri, Marcin Jurdziński, Oded Lachish, and Ranko Lazić. 2009. The covering and boundedness problems for branching vector addition systems. In Ravi Kannan and K. Narayan Kumar, editors, FSTTCS'09, volume 4 of Leibniz International Proceedings in Informatics, pages 181-192. Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
14. Catherine Dufourd and Alain Finkel. 1999. A polynomial λ-bisimilar normalization for reset Petri nets. Theoretical Computer Science, 222(1-2):187-194.
15. Javier Esparza. 1995. Petri nets, commutative contextfree grammars, and basic parallel processes. In Horst Reichel, editor, FCT'95, volume 965 of Lecture Notes in Computer Science, pages 221-232. Springer.
16. Bruno Guillaume and Guy Perrier. 2010. Interaction grammars. Research on Language and Computation. To appear.
17. Serge Haddad and Denis Poitrenaud. 2007. Recursive Petri nets. Acta Informatica, 44(7-8):463-508.
18. John Hopcroft and Jean-Jacques Pansiot. 1979. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8(2):135-159.
19. Dung T. Huynh. 1983. Commutative grammars: the complexity of uniform word problems. Information and Control, 57(1):21-39.
20. Matthias Jantzen. 1979. On the hierarchy of Petri net languages. RAIRO Theoretical Informatics and Applications, 13(1):19-30.
21. Neil D. Jones and William T. Laaser. 1976. Complete problems for deterministic polynomial time. Theoretical Computer Science, 3(1):105-117.
22. Neil D. Jones, Lawrence H. Landweber, and Y. Edmund Lien. 1977. Complexity of some problems in Petri nets. Theoretical Computer Science, 4(3):277-299.
23. Aravind K. Joshi, Tilman Becker, and Owen Rambow. 2000. Complexity of scrambling: A new twist to the competence-performance distinction. In Anne Abeillé and Owen Rambow, editors, Tree Adjoining Grammars. Formalisms, Linguistic Analysis and Processing, chapter 6, pages 167-181. CSLI Publications.
24. Aravind K. Joshi. 1985. Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions? In David R. Dowty, Lauri Karttunen, and Arnold M. Zwicky, editors, Natural Language Parsing: Psychological, Computational, and Theoretical Perspectives, chapter 6, pages 206-250. Cambridge University Press.
25. Laura Kallmeyer and Yannick Parmentier. 2008. On the relation between multicomponent tree adjoining grammars with tree tuples (TT-MCTAG) and range concatenation grammars (RCG). In Carlos Martín- Vide, Friedrich Otto, and Henning Fernau, editors, LATA'08, volume 5196 of Lecture Notes in Computer Science, pages 263-274. Springer.
26. Laura Kallmeyer. 2001. Local tree description grammars. Grammars, 4(2):85-137.
27. Richard M. Karp and Raymond E. Miller. 1969. Parallel program schemata. Journal of Computer and System Sciences, 3(2):147-195.
28. Alexander Koller and Owen Rambow. 2007. Relating dominance formalisms. In FG'07.
29. S. Rao Kosaraju. 1982. Decidability of reachability in vector addition systems. In STOC'82, pages 267-281. ACM Press.
30. Anthony S. Kroch and Beatrice Santorini. 1991. The derived constituent structure of the West Germanic verb-raising construction. In Robert Freidin, editor, Principles and Parameters in Comparative Grammar, chapter 10, pages 269-338. MIT Press.
31. Jean-Luc Lambert. 1992. A structure to decide reachability in Petri nets. Theoretical Computer Science, 99(1):79-104.
32. Bernard Lang. 1994. Recognition can be harder than parsing. Computational Intelligence, 10(4):486-494.
33. Ranko Lazić. 2010. The reachability problem for branching vector addition systems requires doublyexponential space. Manuscript.
34. Timm Lichte. 2007. An MCTAG with tuples for coherent constructions in German. In FG'07.
35. Richard Lipton. 1976. The reachability problem requires exponential space. Technical Report 62, Yale University.
36. Anna Maclachlan and Owen Rambow. 2002. Crossserial dependencies in Tagalog. In TAG+6, pages 100-107.
37. Mitchell P. Marcus, Donald Hindle, and Margaret M. Fleck. 1983. D-theory: talking about talking about trees. In ACL'83, pages 129-136. ACL Press.
38. Ernst W. Mayr. 1981. An algorithm for the general Petri net reachability problem. In STOC'81, pages 238-246. ACM Press.
39. Richard Mayr. 1999. Process rewrite systems. Information and Computation, 156(1-2):264-286.
40. Christos H. Papadimitriou. 1994. Computational Complexity. Addison-Wesley.
41. Rohit J. Parikh. 1966. On context-free languages. Journal of the ACM, 13(4):570-581.
42. James L. Peterson. 1981. Petri Net Theory and the Modeling of Systems. Prentice Hall.
43. Carl A. Petri. 1962. Kommunikation mit Automaten. Ph.D. thesis, University of Bonn.
44. Charles Rackoff. 1978. The covering and boundedness problems for vector addition systems. Theoretical Computer Science, 6(2):223-231.
45. Owen Rambow, K. Vijay-Shanker, and David Weir. 1995. D-tree grammars. In ACL'95, pages 151-158. ACL Press.
46. Owen Rambow, David Weir, and K. Vijay-Shanker. 2001. D-tree substitution grammars. Computational Linguistics, 27(1):89-121.
47. Owen Rambow. 1994a. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, University of Pennsylvania.
48. Owen Rambow. 1994b. Multiset-valued linear index grammars: imposing dominance constraints on derivations. In ACL'94, pages 263-270. ACL Press.
49. Sylvain Salvati. 2010. Minimalist grammars in the light of logic. Manuscript.
50. Stuart M. Shieber. 1985. Evidence against the contextfreeness of natural language. Linguistics and Philosophy, 8(3):333-343.
51. Anders Søgaard, Timm Lichte, and Wolfgang Maier. 2007. The complexity of linguistically motivated extensions of tree-adjoining grammar. In RANLP'07, pages 548-553.
52. Edward P. Stabler. 1997. Derivational minimalism. In Christian Retoré, editor, LACL'96, volume 1328 of Lecture Notes in Computer Science, pages 68-95. Springer.
53. Kumar Neeraj Verma and Jean Goubault-Larrecq. 2005. Karp-Miller trees for a branching extension of VASS. Discrete Mathematics and Theoretical Computer Science, 7(1):217-230.
54. K. Vijay-Shanker. 1992. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18(4):481-517.
55. Ryo Yoshinaka and Makoto Kanazawa. 2005. The complexity and generative capacity of lexicalized abstract categorial grammars. In Philippe Blache, Edward Stabler, Joan Busquets, and Richard Moot, editors, LACL'05, volume 3492 of Lecture Notes in Computer Science, pages 330-346. Springer.