Practical unification-based parsing of Natural Language

[1]  Rod Johnson,et al.  Evaluating complex constraints in linguistic formalisms , 1993 .

[2]  David M. Magerman,et al.  Efficiency, Robustness and Accuracy in Picky Chart Parsing , 1992, ACL.

[3]  Rémi Zajac,et al.  Inheritance and Constraint-Based Grammar Formalisms , 1992, Comput. Linguistics.

[4]  Ann A. Copestake,et al.  The ACQUILEX LKB: representation issues in semi-automatic acquisition of large lexicons , 1992, ANLP.

[5]  Fernando Pereira,et al.  Inside-Outside Reestimation From Partially Bracketed Corpora , 1992, HLT.

[6]  Yves Schabes,et al.  Polynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars , 1991, ACL.

[7]  Mats Rooth,et al.  Structural Ambiguity and Lexical Relations , 1991, ACL.

[8]  M. Brent.  Automatic Acquisition of Subcategorization Frames from Untagged Text , 1991, ACL.

[9]  Robert C. Moore,et al.  Efficient Bottom-Up Parsing , 1991, HLT.

[10]  Jerry Wright,et al.  Adaptive Probabilistic Generalized LR Parsing , 1991, IWPT.

[11]  Geoffrey Leech,et al.  Running a grammar factory: The production of syntactically analysed corpora or “treebanks” , 1991 .

[12]  Marc Lankhorst,et al.  An imperial comparison of generalized LR tables , 1991 .

[13]  Josef Grosch,et al.  Lalr - A Generator for Efficient Parsers , 1990, Softw. Pract. Exp..

[14]  J. H. Wright,et al.  LR parsing of probabilistic grammars with input uncertainty for speech recognition , 1990 .

[15]  Kiyoshi Kogure,et al.  Strategic Lazy Incremental Copy Graph Unification , 1990, COLING.

[16]  Hans Brunner,et al.  Empirical Study of Predictive Powers of Simple Attachment Schemes for Post-modifier Prepositional Phrases , 1990, ACL.

[17]  Kurt Godden,et al.  Lazy Unification , 1990, ACL.

[18]  Geoffrey Sampson,et al.  Natural language analysis by stochastic optimization: a progress report on Project APRIL , 1990, J. Exp. Theor. Artif. Intell..

[19]  Stylianos D. Pezaris,et al.  Shift-reduce conflicts in LR parsers , 1989, SIGP.

[20]  M. Martin,et al.  The parser generating system PGS , 1989, Softw. Pract. Exp..

[21]  James R. Kipps,et al.  Analysis of Tomita’s Algorithm for General Context-Free Parsing , 1989, IWPT.

[22]  Jeremy H. Wright,et al.  Probabilistic LR Parsing for Speech Recognition , 1989, IWPT.

[23]  Bernard Lang,et al.  The Structure of Shared Forests in Ambiguous Parsing , 1989, ACL.

[24]  Kenneth Ward Church,et al.  Word Association Norms, Mutual Information, and Lexicography , 1989, ACL.

[25]  René Leermakers,et al.  How to Cover a Grammar , 1989, ACL.

[26]  Ted Briscoe,et al.  The Syntactic Regularity of English Noun Phrases , 1989, EACL.

[27]  Mark Johnson,et al.  The Computational Complexity of Tomita’s Algorithm , 1989, IWPT.

[28]  Martin Kay,et al.  Head-Driven Parsing , 1989, IWPT.

[29]  Manuel E. Bermudez,et al.  A unifying model for lookahead LR parsing , 1988, Proceedings. 1988 International Conference on Computer Languages.

[30]  Christa Hauenschild,et al.  A Constructive View of GPSG or How to Make It Work , 1988, COLING.

[31]  Steven J. DeRose,et al.  Grammatical Category Disambiguation by Statistical Optimization , 1988, CL.

[32]  David A. Wroblewski,et al.  Nondestructive Graph Unification , 1987, AAAI.

[33]  Douglas E. Appelt,et al.  TEAM: An Experiment in the Design of Transportable Natural-Language Interfaces , 1987, Artif. Intell..

[34]  Masaru Tomita,et al.  An Efficient Augmented-Context-Free Parsing Algorithm , 1987, Comput. Linguistics.

[35]  Lauri Karttunen,et al.  D-PATR: A Development Environment for Unification-Based Grammars , 1986, COLING.

[36]  Stuart M. Shieber,et al.  A Simple Reconstruction of GPSG , 1986, COLING.

[37]  Lenhart K. Schubert.  Are There Preference Trade-offs in Attachment Decisions? , 1986, AAAI.

[38]  Martin Kay,et al.  Parsing in functional unification grammar , 1986 .

[39]  Yorick Wilks,et al.  Syntax, Preference, and Right Attachment , 1985, IJCAI.

[40]  Masaru Tomita,et al.  An Efficient Context-Free Parsing Algorithm for Natural Languages , 1985, IJCAI.

[41]  Stuart M. Shieber,et al.  Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms , 1985, ACL.

[42]  Fernando Pereira,et al.  A Structure-Sharing Representation for Unification-Based Grammar Formalisms , 1985, ACL.

[43]  J. D. Phillips,et al.  GPSGP — a parser for generalized phrase structure grammars , 1985 .

[44]  David Spector,et al.  Lexing and parsing Modula-2 , 1983, SIGP.

[45]  Kimmo Koskenniemi,et al.  Two-Level Model for Morphological Analysis , 1983, IJCAI.

[46]  Lance A. Miller,et al.  Parse Fitting and Prose Fixing: Getting a Hold on III-Formedness , 1983, Am. J. Comput. Linguistics.

[47]  Jane J. Robinson.  DIAGRAM: a grammar for dialogues , 1986, CACM.

[48]  Kenneth Ward Church,et al.  Coping with Syntactic Ambiguity or How to Put the Block in the Box on the Table , 1982, CL.

[49]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[50]  Walter L. Ruzzo,et al.  An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[51]  J. Baker.  Trainable grammars for speech recognition , 1979 .

[52]  V. Prati,et al.  LINGOL-A Progress Report , 1975, IJCAI.

[53]  Paul Walton Purdom,et al.  The size of LALR (1) parsers , 1974 .

[54]  B. Lang.  Deterministic Techniques for Efficient Non-Deterministic Parsers , 1974, ICALP.

[55]  J. Kimball.  Seven principles of surface structure parsing in natural language , 1973 .

[56]  L. Baum,et al.  An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process , 1972 .

[57]  Karel Culik,et al.  LR-Regular Grammars - an Extension of LR(k) Grammars , 1971, J. Comput. Syst. Sci..

[58]  William A. Woods,et al.  Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

[59]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[60]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

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

[62]  Susumu Kuno,et al.  The predictive analyzer and a path elimination technique , 1965, CACM.

[63]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..