Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy
暂无分享,去创建一个
[1] David J. Weir,et al. Grammar Compaction and Computation Sharing in Automata-based Parsing , 1998, TAPD.
[2] Yves Schabes,et al. LEFT TO RIGHT PARSING OF LEXICALIZED TREE‐ADJOINING GRAMMARS 1 , 1994, Comput. Intell..
[3] Éric Villemonte de la Clergerie. Building factorized TAGs with meta-grammars , 2010, TAG.
[4] Jakub Waszczuk,et al. Towards a MWE-driven A* parsing with LTAGs [WG2,WG3] , 2016 .
[5] Miguel A. Alonso,et al. Tabular Algorithms for TAG Parsing , 1999, EACL.
[6] Laura Kallmeyer,et al. Parsing Beyond Context-Free Grammars , 2010, Cognitive Technologies.
[7] Dan Klein,et al. Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank , 2001, ACL.
[8] Giorgio Gallo,et al. Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..
[9] S. Shieber,et al. 40 40 08 v 1 2 6 A pr 1 99 4 Principles and Implementation of Deductive Parsing , .
[10] Aravind K. Joshi,et al. Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.
[11] Dan Klein,et al. Parsing and Hypergraphs , 2001, IWPT.
[12] Carlos A. Prolo,et al. Fast LR parsing Using Rich (Tree Adjoining) Grammars , 2002, EMNLP.
[13] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.
[14] David J. Weir,et al. Automaton-based Parsing for Lexicalised Grammars , 1997, IWPT.
[15] Miguel A. Alonso,et al. Relating tabular parsing algorithms for LIG and TAG , 2004 .