Bilexical Grammars and their Cubic-Time Parsing Algorithms
暂无分享,去创建一个
[1] Joshua Goodman,et al. Parsing Inside-Out , 1998, ArXiv.
[2] Joshua Goodman,et al. Probabilistic Feature Grammars , 1997, IWPT.
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] Ivan A. Sag,et al. Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.
[5] Walter L. Ruzzo,et al. An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..
[6] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, CACM.
[7] Dekai Wu,et al. An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words , 1995, ACL.
[8] David J. Weir,et al. The convergence of mildly context-sensitive grammar formalisms , 1990 .
[9] Haim Gaifman,et al. Dependency Systems and Phrase-Structure Systems , 1965, Inf. Control..
[10] Aravind K. Joshi,et al. Parsing Strategies with ‘Lexicalized’ Grammars: Application to Tree Adjoining Grammars , 1988, COLING.
[11] Jason Eisner,et al. An Empirical Comparison of Probability Models for Dependency Grammar , 1997, ArXiv.
[12] Eugene Charniak,et al. Parsing with Context-Free Grammars and Word Statistics , 1995 .
[13] David A. McAllester. On the complexity analysis of static analyses , 1999, JACM.
[14] William A. Woods,et al. Augmented Transition Networks for Natural Language Analysis. , 1969 .
[15] Igor Mel’čuk,et al. Dependency Syntax: Theory and Practice , 1987 .
[16] Michael Collins,et al. A New Statistical Parser Based on Bigram Lexical Dependencies , 1996, ACL.
[17] Daniel Dominic Sleator,et al. Parsing English with a Link Grammar , 1995, IWPT.
[18] Joseph D. Becker. The Phrasal Lexicon , 1975, TINLAP.
[19] P. Resnik. Selection and information: a class-based approach to lexical relationships , 1993 .
[20] Giorgio Satta,et al. Efficient Parsing for Bilexical Context-Free Grammars and Head Automaton Grammars , 1999, ACL.
[21] Jason Eisner,et al. Three New Probabilistic Models for Dependency Parsing: An Exploration , 1996, COLING.
[22] Martin Kay,et al. Algorithm schemata and data structures in syntactic processing , 1986 .
[23] Kenneth Ward Church. A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text , 1988, ANLP.
[24] Eugene Charniak,et al. Figures of Merit for Best-First Probabilistic Chart Parsing , 1998, Comput. Linguistics.
[25] Giorgio Satta,et al. A faster parsing algorithm for Lexicalized Tree-Adjoining Grammars , 2000, TAG+.
[26] David Milward,et al. Dynamic dependency grammar , 1994 .
[27] Jay Earley,et al. An efficient context-free parsing algorithm , 1970, Commun. ACM.
[28] Hiyan Alshawi,et al. Head Automata and Bilingual Tiling: Translation with Minimal Representations , 1996, ACL.
[29] Andreas Stolcke,et al. An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities , 1994, CL.
[30] John Lafferty,et al. Grammatical Trigrams: A Probabilistic Model of Link Grammar , 1992 .
[31] Michael Collins,et al. Three Generative, Lexicalised Models for Statistical Parsing , 1997, ACL.
[32] Eugene Charniak,et al. Statistical Parsing with a Context-Free Grammar and Word Statistics , 1997, AAAI/IAAI.
[33] Martin Kay,et al. Regular Models of Phonological Rule Systems , 1994, CL.
[34] Jason Eisner. Bilexical Grammars and a Cubic-time Probabilistic Parser , 1997, IWPT.
[35] Kimmo Koskenniemi,et al. A General Computational Model for Word-Form Recognition and Production , 1984, ACL.