Synchronous Context-Free Grammars and Optimal Parsing Strategies

The complexity of parsing with synchronous context-free grammars is polynomial in the sentence length for a fixed grammar, but the degree of the polynomial depends on the grammar. Specifically, the degree depends on the length of rules, the permutations represented by the rules, and the parsing strategy adopted to decompose the recognition of a rule into smaller steps. We address the problem of finding the best parsing strategy for a rule, in terms of space and time complexity. We show that it is NP-hard to find the binary strategy with the lowest space complexity. We also show that any algorithm for finding the strategy with the lowest time complexity would imply improved approximation algorithms for finding the treewidth of general graphs.

[1]  Richard Edwin Stearns,et al.  Syntax-Directed Transduction , 1966, JACM.

[2]  Daniel Gildea,et al.  Optimal Parsing Strategies for Linear Context-Free Rewriting Systems , 2010, NAACL.

[3]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[4]  Daniel Götzmann.  Multiple Context-Free Grammars , 2007 .

[5]  Stuart M. Shieber,et al.  An Alternative Conception of Tree-Adjoining Derivation , 1992, ACL.

[6]  Rudolf Ahlswede,et al.  Edge isoperimetric theorems for integer point arrays , 1995 .

[7]  Daniel Gildea,et al.  Grammar Factorization by Tree Decomposition , 2011, Computational Linguistics.

[8]  Giorgio Satta,et al.  Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems , 2011, ACL.

[9]  Giorgio Satta,et al.  Some Computational Complexity Results for Synchronous Context-Free Grammars , 2005, HLT/EMNLP.

[10]  Samir Khuller,et al.  Designing Multi-Commodity Flow Trees , 1994, Inf. Process. Lett..

[11]  David Chiang,et al.  Hierarchical Phrase-Based Translation , 2007, CL.

[12]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[13]  Daniel Marcu,et al.  What’s in a translation rule? , 2004, NAACL.

[14]  Daniel Marcu,et al.  Statistical Phrase-Based Translation , 2003, NAACL.

[15]  Maria J. Serna,et al.  Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width , 2000, ISAAC.

[16]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[17]  David J. Weir,et al.  Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.

[18]  Giorgio Satta,et al.  Synchronous context-free grammars and optimal linear parsing strategies , 2013, J. Comput. Syst. Sci..

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[21]  Vibhav Gogate,et al.  A Complete Anytime Algorithm for Treewidth , 2004, UAI.

[22]  Fillia Makedon,et al.  Topological Bandwidth , 1983, CAAP.

[23]  Barbara J. Grosz,et al.  Natural-Language Processing , 1982, Artificial Intelligence.

[24]  Giorgio Satta,et al.  Optimal Reduction of Rule Length in Linear Context-Free Rewriting Systems , 2009, NAACL.

[25]  Robert L. Mercer,et al.  The Mathematics of Statistical Machine Translation: Parameter Estimation , 1993, CL.

[26]  Daniel Gildea,et al.  Binarization of Synchronous Context-Free Grammars , 2009, CL.

[27]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[28]  Stuart M. Shieber,et al.  Synchronous Tree-Adjoining Grammars , 1990, COLING.

[29]  José D. P. Rolim,et al.  Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes , 1995, WG.

[30]  Daniel Gildea,et al.  Worst-Case Synchronous Grammar Rules , 2007, HLT-NAACL.

[31]  Giorgio Satta,et al.  Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems , 2010, HLT-NAACL.

[32]  Alfred V. Aho,et al.  Syntax Directed Translations and the Pushdown Assembler , 1969, J. Comput. Syst. Sci..

[33]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[34]  Aravind K. Joshi,et al.  Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis , 2004 .

[35]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[36]  Martin Kay,et al.  Algorithm schemata and data structures in syntactic processing , 1986 .

[37]  Giorgio Satta,et al.  Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two , 2010, ACL.

[38]  Robin Thomas,et al.  Call routing and the ratcatcher , 1994, Comb..

[39]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1984, Comb..

[40]  Yota Otachi,et al.  The carving-width of generalized hypercubes , 2010, Discret. Math..