Integrated Supertagging and Parsing
暂无分享,去创建一个
[1] Taisuke Sato,et al. Inside-Outside Probability Computation for Belief Propagation , 2007, IJCAI.
[2] Alexander M. Rush,et al. On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing , 2010, EMNLP.
[3] Trevor Cohn,et al. Scaling conditional random fields for natural language processing , 2007 .
[4] Noah A. Smith,et al. Novel estimation methods for unsupervised discovery of latent structure in natural language text , 2007 .
[5] Julia Hockenmaier,et al. Data and models for statistical parsing with combinatory categorial grammar , 2003 .
[6] Frederick Jelinek,et al. Exploiting Syntactic Structure for Language Modeling , 1998, ACL.
[7] Anoop Sarkar. Combining Supertagging and Lexicalized Tree-Adjoining Grammar Parsing∗ , 2006 .
[8] Michael Collins,et al. Head-Driven Statistical Models for Natural Language Parsing , 2003, CL.
[9] Yves Schabes,et al. Stochastic Lexicalized Tree-adjoining Grammars , 1992, COLING.
[10] Christopher D. Manning,et al. Efficient, Feature-based, Conditional Random Field Parsing , 2008, ACL.
[11] James R. Curran,et al. Multi-Tagging for Lexicalized-Grammar Parsing , 2006, ACL.
[12] David J. Weir,et al. Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.
[13] Nick Hawes,et al. Incremental , multi-level processing for comprehending situated dialogue in human-robot interaction , 2007 .
[14] Mark Steedman,et al. Lexical Generalization in CCG Grammar Induction for Semantic Parsing , 2011, EMNLP.
[15] Mark Steedman,et al. CCGbank: User's Manual , 2005 .
[16] Sebastian Riedel,et al. Incremental Integer Linear Programming for Non-projective Dependency Parsing , 2006, EMNLP.
[17] Y. Bar-Hillel. A Quasi-Arithmetical Notation for Syntactic Description , 1953 .
[18] David A. McAllester. On the complexity analysis of static analyses , 1999, JACM.
[19] Dan Klein,et al. Hierarchical Search for Parsing , 2009, HLT-NAACL.
[20] James R. Curran,et al. Parsing the WSJ Using CCG and Log-Linear Models , 2004, ACL.
[21] Mark Steedman,et al. Wide-Coverage Semantic Representations from a CCG Parser , 2004, COLING.
[22] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[23] Andrew McCallum,et al. Piecewise Training for Undirected Models , 2005, UAI.
[24] Philipp Koehn,et al. CCG Supertags in Factored Statistical Machine Translation , 2007, WMT@ACL.
[25] Joshua Goodman,et al. Semiring Parsing , 1999, CL.
[26] Mark Steedman,et al. Generative Models for Statistical Parsing with Combinatory Categorial Grammar , 2002, ACL.
[27] Liang Huang,et al. Forest Reranking: Discriminative Parsing with Non-Local Features , 2008, ACL.
[28] Adwait Ratnaparkhi,et al. A Maximum Entropy Model for Part-Of-Speech Tagging , 1996, EMNLP.
[29] Joshua Goodman,et al. Parsing Algorithms and Metrics , 1996, ACL.
[30] Adam Lopez,et al. Efficient CCG Parsing: A* versus Adaptive Supertagging , 2011, ACL.
[31] David A. Smith,et al. Dependency Parsing by Belief Propagation , 2008, EMNLP.
[32] J. Baker. Trainable grammars for speech recognition , 1979 .
[33] Mark Steedman,et al. Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification , 2010, EMNLP.
[34] Smaranda Muresan,et al. Generalizing Word Lattice Translation , 2008, ACL.
[35] Dan Klein,et al. Learning Accurate, Compact, and Interpretable Tree Annotation , 2006, ACL.
[36] Julia Hockenmaier. Parsing with Generative Models of Predicate-Argument Structure , 2003, ACL.
[37] Kim K. Baldridge,et al. Adapting Chart Realization to CCG , 2003, ENLG@EACL.
[38] Donald E. Knuth,et al. A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..
[39] James R. Curran,et al. Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models , 2007, Computational Linguistics.
[40] Dan Klein,et al. Parsing and Hypergraphs , 2001, IWPT.
[41] Adam Lopez,et al. Translation as Weighted Deduction , 2009, EACL.
[42] Gerald Penn,et al. Accurate Context-Free Parsing with Combinatory Categorial Grammar , 2010, ACL.
[43] J. Darroch,et al. Generalized Iterative Scaling for Log-Linear Models , 1972 .
[44] Adam Lopez,et al. A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing , 2011, ACL.
[45] Ben Taskar,et al. Structured Determinantal Point Processes , 2010, NIPS.
[46] Anoop Sarkar. Practical experiments in parsing using Tree Adjoining Grammars , 2000, TAG+.
[47] Daniel Povey,et al. Minimum Phone Error and I-smoothing for improved discriminative training , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[48] Noah A. Smith,et al. Softmax-Margin CRFs: Training Log-Linear Models with Cost Functions , 2010, NAACL.
[49] Eugene Charniak,et al. A Maximum-Entropy-Inspired Parser , 2000, ANLP.
[50] Mark Steedman,et al. Building Deep Dependency Structures using a Wide-Coverage CCG Parser , 2002, ACL.
[51] Andrew McCallum,et al. Joint Parsing and Semantic Role Labeling , 2005, CoNLL.
[52] Joakim Nivre,et al. MaltParser: A Data-Driven Parser-Generator for Dependency Parsing , 2006, LREC.
[53] Adam Lopez,et al. Training a Log-Linear Parser with Loss Functions via Softmax-Margin , 2011, EMNLP.
[54] James R. Curran,et al. Log-Linear Models for Wide-Coverage CCG Parsing , 2003, EMNLP.
[55] Andy Way,et al. Supertagged Phrase-Based Statistical Machine Translation , 2007, ACL.
[56] Martin Kay,et al. Syntactic Process , 1979, ACL.
[57] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.
[58] Julia Hockenmaier,et al. Statistical Parsing for CCG with Simple Generative Models , 2001, ACL.
[59] Nikos Komodakis,et al. MRF Optimization via Dual Decomposition: Message-Passing Revisited , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[60] Qun Liu,et al. A Cascaded Linear Model for Joint Chinese Word Segmentation and Part-of-Speech Tagging , 2008, ACL.
[61] Christopher D. Manning,et al. Joint Parsing and Named Entity Recognition , 2009, NAACL.
[62] John W. Fisher,et al. Loopy Belief Propagation: Convergence and Effects of Message Errors , 2005, J. Mach. Learn. Res..
[63] Alexander M. Rush,et al. A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing , 2012, J. Artif. Intell. Res..
[64] Lawrence K. Saul,et al. Large Margin Hidden Markov Models for Automatic Speech Recognition , 2006, NIPS.
[65] Alexander M. Rush,et al. Exact Decoding of Syntactic Translation Models through Lagrangian Relaxation , 2011, ACL.
[66] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[67] James R. Curran,et al. Faster Parsing by Supertagger Adaptation , 2010, ACL.
[68] Jonathan K. Kummerfeld,et al. Large-Scale Syntactic Processing : Parsing the Web Final Report of the 2009 JHU CLSP Workshop , 2009 .
[69] Fernando Pereira,et al. Discriminative learning and spanning tree algorithms for dependency parsing , 2006 .
[70] John DeNero,et al. Model-Based Aligner Combination Using Dual Decomposition , 2011, ACL.
[71] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[72] Daniel Marcu,et al. What’s in a translation rule? , 2004, NAACL.
[73] Johan Bos. Towards Wide-Coverage Semantic Interpretation , 2005 .
[74] Andrew McCallum,et al. Fast and Robust Joint Models for Biomedical Event Extraction , 2011, EMNLP.
[75] Stephen Clark,et al. Supertagging for Combinatory Categorial Grammar , 2002, TAG+.
[76] Phil Blunsom,et al. Inducing Tree-Substitution Grammars , 2010, J. Mach. Learn. Res..
[77] Daniel Marcu,et al. Scalable Inference and Training of Context-Rich Syntactic Translation Models , 2006, ACL.
[78] Michael I. Jordan,et al. Probabilistic Independence Networks for Hidden Markov Probability Models , 1997, Neural Computation.
[79] Andrew McCallum,et al. Maximum Entropy Markov Models for Information Extraction and Segmentation , 2000, ICML.
[80] Franz Josef Och,et al. Minimum Error Rate Training in Statistical Machine Translation , 2003, ACL.
[81] Dan Klein,et al. A* Parsing: Fast Exact Viterbi Parse Selection , 2003, NAACL.
[82] Eric P. Xing,et al. Turbo Parsers: Dependency Parsing by Approximate Variational Inference , 2010, EMNLP.
[83] Tadao Kasami,et al. An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .
[84] Srinivas Bangalore,et al. The Institute For Research In Cognitive Science Disambiguation of Super Parts of Speech ( or Supertags ) : Almost Parsing by Aravind , 1995 .
[85] Gerth Stølting Brodal,et al. Worst-case efficient priority queues , 1996, SODA '96.
[86] Noah A. Smith,et al. Softmax-Margin Training for Structured Log-Linear Models , 2010 .
[87] Alexander M. Rush,et al. Dual Decomposition for Parsing with Non-Projective Head Automata , 2010, EMNLP.
[88] Fernando Pereira,et al. Case-factor diagrams for structured probabilistic modeling , 2004, J. Comput. Syst. Sci..
[89] Qun Liu,et al. Forest-Based Translation , 2008, ACL.
[90] David A. McAllester,et al. The Generalized A* Architecture , 2007, J. Artif. Intell. Res..
[91] Alexis Nasr,et al. SuperTagging and Full Parsing , 2004, TAG+.
[92] Andrew McCallum,et al. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.
[93] Jason Eisner. Efficient Normal-Form Parsing for Combinatory Categorial Grammar , 1996, ACL.
[94] Luke S. Zettlemoyer,et al. Online Learning of Relaxed CCG Grammars for Parsing to Logical Form , 2007, EMNLP.
[95] Thomas Hofmann,et al. Investigating Loss Functions and Optimization Methods for Discriminative Learning of Label Sequences , 2003, EMNLP.
[96] Stephen Clark,et al. Shift-Reduce CCG Parsing , 2011, ACL.
[97] Stuart M. Shieber,et al. Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..
[98] Michael Collins,et al. Exact Decoding of Phrase-Based Translation Models through Lagrangian Relaxation , 2011, EMNLP.
[99] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.
[100] John D. Lafferty,et al. Inducing Features of Random Fields , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[101] Philip Resnik,et al. Context-free reordering, finite-state translation , 2010, HLT-NAACL.
[102] Stephen Clark,et al. Evaluating a Wide-Coverage CCG Parser , 2013 .
[103] Andrew McCallum,et al. An Introduction to Conditional Random Fields , 2010, Found. Trends Mach. Learn..
[104] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[105] Brian Roark,et al. Linear Complexity Context-Free Parsing Pipelines via Chart Constraints , 2009, NAACL.
[106] Andrew McCallum,et al. Piecewise training for structured prediction , 2009, Machine Learning.
[107] David H. D. Warren,et al. Parsing as Deduction , 1983, ACL.
[108] Srinivas Bangalore,et al. Supertagging: An Approach to Almost Parsing , 1999, CL.
[109] Kenneth Ward Church,et al. Coping with Syntactic Ambiguity or How to Put the Block in the Box on the Table , 1982, CL.
[110] Dan Klein,et al. K-Best A* Parsing , 2009, ACL.
[111] Beatrice Santorini,et al. Building a Large Annotated Corpus of English: The Penn Treebank , 1993, CL.
[112] Andrew Y. Ng,et al. Solving the Problem of Cascading Errors: Approximate Bayesian Inference for Linguistic Annotation Pipelines , 2006, EMNLP.
[113] Markus Dreyer,et al. Graphical Models over Multiple Strings , 2009, EMNLP.
[114] Andrew McCallum,et al. Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data , 2004, J. Mach. Learn. Res..
[115] Ben Taskar,et al. Max-Margin Parsing , 2004, EMNLP.
[116] Michael Auli,et al. CCG-based Models for Statistical Machine Translation , 2009 .
[117] Mark Steedman,et al. CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank , 2007, CL.