Linguistic parsing and program transformations

[1]  Helmuth Partsch.  Structuring Transformational Developments: A Case Study Based on Earley's Recognizer , 1984, Sci. Comput. Program..

[2]  David Pager.  A Solution to an Open Problem by Knuth , 1970, Inf. Control..

[3]  Michael Dixon,et al.  Compose-Reduce Parsing , 1991, ACL.

[4]  Mark-Jan Nederhof,et al.  Generalized Left-Corner Parsing , 1993, EACL.

[5]  P.H.W.M. Oude Luttighuis.  Parallel algorithms for parsing and attribute evaluation , 1993 .

[6]  W. A. Martin,et al.  Parsing , 1980, ACL.

[7]  Warren Teitelman,et al.  A Display Oriented Programmer's Assistant , 1977, IJCAI.

[8]  Richard A. Frost.  Guarded attribute grammars: top down parsing and left recursive productions , 1992, SIGP.

[9]  Patrick Shann.  Experiments with GLR and Chart Parsing , 1991 .

[10]  Dennis de Champeaux,et al.  About the Paterson-Wegman Linear Unification Algorithm , 1986, J. Comput. Syst. Sci..

[11]  Eric K. Jones,et al.  L* Parsing: A General Framework for Syntactic Analysis of Natural Language , 1994, AAAI.

[12]  David Maier,et al.  Computing with logic , 1988 .

[13]  Lothar Schmitz,et al.  An Efficient Recognizer for the Boolean Closure of Context-Free Languages , 1991, Theor. Comput. Sci..

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

[15]  Ian Lancashire.  Review of Linguistic exploitation of syntactic databases: the use of the nijmegen linguistic database program by Hans van Halteren, Theo van den Heuvel. Editions Rodopi 1990. , 1991 .

[16]  Jonathan Slocum.  A Practical Comparison of Parsing Strategies , 1981, ACL.

[17]  Rohman Nozohoor-Farshi,et al.  Handling of Ill-Designed Grammars in Tomita’s Parsing Algorithm , 1989, IWPT.

[18]  J. Hallebeek,et al.  Een Grammatica voor Automatische Analyse van het Spaans. , 1992, Exploraciones semánticas y pragmáticas del Español.

[19]  Mark-Jan Nederhof,et al.  Efficient decoration of parse forests , 1993 .

[20]  Anne N. De Roeck,et al.  Bidirectional chart parsing , 1987 .

[21]  Jorma Tarhio,et al.  Looping LR Parsers , 1988, Inf. Process. Lett..

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

[23]  Nelleke Oostdijk,et al.  Corpus Linguistics and the Automatic Analysis of English , 1991 .

[24]  Branimir Boguraev.  A Natural Language Toolkit: Reconciling Theory with Practice , 1988 .

[25]  Manfred Gehrke,et al.  A User Friendly A T N Programming Environment (APE) , 1986, COLING.

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

[27]  Mark-Jan Nederhof,et al.  An Optimal Tabular Parsing Algorithm , 1994, ACL.

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

[29]  Mark-Jan Nederhof,et al.  Efficient generation of random sentences , 1996, Natural Language Engineering.

[30]  Wojciech Rytter.  Time Complexity of Unambiguous Path Systems , 1982, Inf. Process. Lett..

[31]  M. Tomita.  Generalized LR Parsing , 1991, Springer US.

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

[33]  Alfred V. Aho,et al.  Deterministic parsing of ambiguous grammars , 1975, Commun. ACM.

[34]  Hozumi Tanaka,et al.  Parallel GLR Parsing Based on Logic Programming , 1991 .

[35]  Klaas Sikkel,et al.  The Primordial Soup Algorithm: A Systematic Approach to the Specification of Parallel Parsers , 1992, COLING.

[36]  Marco Piastra,et al.  An Efficient Context-Free Parsing Algorithm with Semantic Actions , 1991, AI*IA.

[37]  Mats Wirén,et al.  A Comparison of Rule-Invocation Strategies in Context-Free Chart Parsing , 1987, EACL.

[38]  Gertjan van Noord,et al.  Head-driven Parsing for Lexicalist Grammars: Experimental Results , 1993, EACL.

[39]  Masaru Tomita,et al.  Efficient parsing for natural language , 1985 .

[40]  F. E. J. Kruseman.  On a Recursive Ascent Parser , 1988, Inf. Process. Lett..

[41]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[42]  L. Vielle,et al.  Recursive query processing: the power of logic , 1989 .

[43]  Wojciech Rytter,et al.  Fast Recognition of Pushdown Automaton and Context-free Languages , 1986, Inf. Control..

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

[45]  Marko C. J. D. van Eekelen,et al.  Functional Programming and Parallel Graph Rewriting , 1993 .

[46]  John A. Carroll.  Relating Complexity to Practical Performance in Parsing With Wide-Coverage Unification Grammars , 1994, ACL.

[47]  François Andry,et al.  Interleaving Syntax and Semantics in an Effecient Bottom-Up Parser , 1994, ACL.

[48]  Frédéric Voisin,et al.  CIGALE: A Tool for Interactive Grammar Construction and Expression Parsing , 1986, Sci. Comput. Program..

[49]  Hirohisa Seki,et al.  On the power of Alexander templates , 1989, PODS.

[50]  Hans Leiß.  On Kilbury's modification of Earley's algorithm , 1990, TOPL.

[51]  Alan J. Demers,et al.  Generalized left corner parsing , 1977, POPL.

[52]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[53]  Terry Winograd,et al.  Breaking the complexity barrier again , 1973, SIGPLAN '73.

[54]  Philip N. Klein,et al.  Parallel Time O(log n) Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM , 1988, SIAM J. Comput..

[55]  Andreas Eisele,et al.  Unification of Disjunctive Feature Descriptions , 1988, ACL.

[56]  Rémi Zajac Gril,et al.  Towards computer-aided linguistic engineering , 1992, COLING 1992.

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

[58]  Ted Briscoe,et al.  Software Support for Practical Grammar Development , 1988, COLING.

[59]  Lex Augusteijn,et al.  A Functional LR Parser , 1992, Theor. Comput. Sci..

[60]  K. Fuchi,et al.  Concurrent Prolog , 1988 .

[61]  Alfred V. Aho,et al.  Time and Tape Complexity of Pushdown Automaton Languages , 1968, Inf. Control..

[62]  K. Vijay-Shanker,et al.  The Use of Shared Forests in Tree Adjoining Grammar Parsing , 1993, EACL.

[63]  Georges Gardarin,et al.  Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs , 1987, VLDB.

[64]  I. Kenzo,et al.  On LLC(k) Parsing Method of LR(k) Grammars , 1983 .

[65]  Lisette Appelo,et al.  Subgrammars, Rule Classes and Control in the Rosetta Translation System , 1987, EACL.

[66]  F. Kenneth Zadeck,et al.  Incremental data flow analysis in a structured program editor , 1984, SIGPLAN '84.

[67]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[68]  Ronald M. Kaplan,et al.  The Interface between Phrasal and Functional Constraints , 1993, CL.

[69]  Alon Lavie,et al.  An Integrated Heuristic Scheme for Partial Parse Evaluation , 1994, ACL.

[70]  Mark Johnson,et al.  Computing with Features as Formulae , 1994, Comput. Linguistics.

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

[72]  Martin Kay,et al.  The MIND System , 1970 .

[73]  Klaas Sikkel,et al.  A Parallel Bottom-up Tomita Parser , 1992, KONVENS.

[74]  Masaru Tomita,et al.  The Generalized LR Parsing Algorithm , 1991 .

[75]  Bernard Lang,et al.  Parsing Incomplete Sentences , 1988, COLING.

[76]  J. Rekers,et al.  Parser Generation for Interactive Environments , 1992 .

[77]  René Leermakers,et al.  A Recursive Ascent Earley Parser , 1992, Inf. Process. Lett..

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

[79]  Stephan Heilbrunner,et al.  A Parsing Automata Approach to LR Theory , 1981, Theor. Comput. Sci..

[80]  Mikkel Thorup,et al.  Controlled grammatic ambiguity , 1994, TOPL.

[81]  Klaas Sikkel,et al.  Natural Language Parsing - Methods and Formalisms , 1993 .

[82]  Jacques Cohen,et al.  Parsing and compiling using Prolog , 1987, TOPL.

[83]  Joop M. I. M. Leo.  A General Context-Free Parsing Algorithm Running in Linear Time on Every LR (k) Grammar Without Using Lookahead , 1991, Theor. Comput. Sci..

[84]  Mark W. Perlin,et al.  LR Recursive Transition Networks for Earley and Tomita Parsing , 1991, ACL.

[85]  Rene Leermakers,et al.  The Functional Treatment of Parsing , 1993 .

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

[87]  Andreas Eisele,et al.  Feature Logic with Disjunctive Unification , 1990, COLING.

[88]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[89]  Yuji Matsumoto,et al.  A Parsing System Based on Logic Programming , 1987, IJCAI.

[90]  Bernard Lang,et al.  Towards a Uniform Formal Framework for Parsing , 1991 .

[91]  Laurent Vieille,et al.  Recursive Query Processing: The Power of Logic , 1989, Theor. Comput. Sci..

[92]  Giorgio Satta,et al.  Bidirectional Context-Free Grammar Parsing for Natural Language Processing , 1994, Artif. Intell..

[93]  Pedro Rangel Henriques.  A Semantic Evaluator Generating System in Prolog , 1988, PLILP.

[94]  Jesús A. López,et al.  Generalized LR parsing , 2004, Machine Translation.

[95]  A. Augusteijn,et al.  Functional programming, program transformations and compiler construction , 1993 .

[96]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

[97]  Hozumi Tanaka,et al.  Predictive Control Parser: Extended LINGOL , 1979, IJCAI.

[98]  Christian Boitet,et al.  Automated Translation at Grenoble University , 1985, Comput. Linguistics.

[99]  George H. Roberts.  Another Note on Recursive Ascent , 1989, Inf. Process. Lett..

[100]  Giorgio Satta,et al.  A Tabular Method for Island-Driven Context-Free Grammar Parsing , 1991, AAAI.

[101]  Nicolaas Sikkel,et al.  Cross-fertilization of Earley and Tomita , 1990 .

[102]  Jean Véronis.  Disjunctive Feature Structures As Hypergraphs , 1992, COLING.

[103]  Giorgio Satta,et al.  An Extended Theory of Head-Driven Parsing , 1994, ACL.

[104]  Marc Dymetman.  A Generalized Greibach Normal Form for Definite Clause Grammars , 1992, COLING.

[105]  J. M. Foster,et al.  A syntax improving program , 1968, Comput. J..

[106]  James R. Cordy,et al.  SL Parses The LR Languages , 1988, Comput. Lang..

[107]  R. Evans.  ProGram — a development tool for GPSG grammars , 1985 .

[108]  Hiroaki Saito.  Bi-directional LR Parsing from an Anchor Word for Speech Recognition , 1990, COLING.

[109]  Katashi Nagao.  A Preferential Constraint Satisfaction Technique for Natural Language Analysis , 1992, ECAI.

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

[111]  René Leermakers.  Recursive Ascent Parsing: From Earley to Marcus , 1992, Theor. Comput. Sci..

[112]  Mark Johnson.  The Computational Complexity of GLR Parsing , 1991 .

[113]  Vaughan R. Pratt,et al.  LINGOL: a progress repor , 1975, IJCAI 1975.

[114]  Wojciech Rytter,et al.  Analysis of algorithms and data structures , 1991, International computer science series.

[115]  Laks V. S. Lakshmanan,et al.  Can Filters do Magic for Deductive Databases? , 1991, ALPUK.

[116]  Anton Nijholt,et al.  Context-free grammars: Covers, normal forms, and parsing , 1980, Lecture Notes in Computer Science.

[117]  Klaas Sikkel,et al.  Parsing Schemata , 1997, Texts in Theoretical Computer Science An EATCS Series.

[118]  Helmuth Partsch,et al.  Specification and Transformation of Programs - A Formal Approach to Software Development , 1990, Texts and Monographs in Computer Science.

[119]  Lauri Karttunen,et al.  Natural language parsing: Parsing in a free word order language , 1985 .

[120]  José Fortes Gálvez,et al.  Generating LR(1) Parsers of Small Size , 1992, CC.

[121]  Mike Rosner,et al.  A rich environment for experimentation with unification grammars , 1989, EACL.

[122]  Ehud Shapiro,et al.  Concurrent PROLOG: Collected Papers , 1987 .

[123]  René Leermakers,et al.  Non-deterministic Recursive Ascent Parsing , 1991, EACL.

[124]  Mark-Jan Nederhof,et al.  A Customized Grammar Workbench , 1992 .

[125]  Helmuth Partsch,et al.  Transformational Program Development in a Particular Program Domain , 1986, Sci. Comput. Program..

[126]  Peter Norvig,et al.  Techniques for Automatic Memoization with Applications to Context-Free Parsing , 1991, CL.

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

[128]  Suzanne W. Dietrich,et al.  Extension Tables: Memo Relations in Logic Programming , 1987, SLP.

[129]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[130]  Hidenori Itoh,et al.  A Query Evaluation Method for Stratified Programs Under the Extended CWA , 1988, ICLP/SLP.

[131]  Eljas Soisalon-Soininen,et al.  Parsing Theory: Volume II Lr(k) and Ll(k) Parsing , 1990 .

[132]  Bernard Lang.  A Generative View of Ill-Formed Input Processing , 1989 .

[133]  Mark-Jan Nederhof,et al.  Increasing the Applicability of LR Parsing , 1993, IWPT.

[134]  Ralf D. Brown.  Human-Computer Interaction for Semantic Disambiguation , 1990, COLING.

[135]  Mark-Jan Nederhof.  A New Top-Down Parsing Algorithm for Left-Recursive DCGs , 1993, PLILP.

[136]  Eric Villemonte de la Clergerie.  Automates a piles et programmation dynamique dyalog : une application a la programmation en logique , 1993 .

[137]  Masaru Tomita,et al.  Graph-Structured Stack and Natural Language Parsing , 1988, ACL.

[138]  Jan van Bakel.  Automatic Semantic Interpretation: A Computer Model of Understanding Natural Language , 1985 .

[139]  Stan Szpakowicz.  Logic grammars , 1987 .

[140]  W. E. Ditters.  A formal approach to Arabic syntax: the noun phrase and the verb phrase , 1992 .

[141]  Dietmar Seipel.  An Efficient Computation of Extended Generalized Closed World Assumption by Support-for-Negation Sets , 1994, LPAR.

[142]  Masaaki Nagata,et al.  An Empirical Study on Rule Granularity and Unification Interleaving Toward an Efficient Unification-Based Parsing System , 1992, COLING.

[143]  Ted Briscoe,et al.  A Formalism and Environment for the Development of a Large Grammar of English , 1987, IJCAI.

[144]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[145]  Giorgio Satta,et al.  Head-Driven Bidirectional Parsing: A Tabular Method , 1989, IWPT.

[146]  David Scott Warren,et al.  Memoing for logic programs , 1992, CACM.

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

[148]  Frédéric Voisin.  A Bottom-Up Adaption of Earley's Parsing Algorithm , 1988, PLILP.

[149]  Richard S. Bird,et al.  Tabulation Techniques for Recursive Programs , 1980, CSUR.

[150]  Hans Ulrich Block,et al.  Using Disjunctive Constraints in a Bottom-Up Parser , 1992, KONVENS.

[151]  Wojciech Rytter,et al.  On the Parallel Recognition of Unambiguous Context-Free Languages , 1991, Theor. Comput. Sci..

[152]  Daniel J. Rosenkrantz,et al.  Compiler design theory , 1976 .

[153]  Wim H. Hesselink,et al.  LR-Parsing Derived , 1992, Sci. Comput. Program..

[154]  Bernard Lang,et al.  RECOGNITION CAN BE HARDER THAN PARSING , 1994, Comput. Intell..

[155]  Cornelis H. A. Koster.  A Technique for Parsing Ambiguous Languages , 1974 .

[156]  Kuniaki Uehara,et al.  A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and its Implementation Technique , 1984, SLP.

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

[158]  John Bear,et al.  A Breadth-First Parsing Model , 1983, IJCAI.

[159]  Hisao Tamaki,et al.  OLD Resolution with Tabulation , 1986, ICLP.

[160]  Klaus Schifferer.  TAGDevEnv. Eine Werkbank für TAGs , 1988, Computerlinguistik und ihre theoretischen Grundlagen.

[161]  Verónica Dahl,et al.  Logic Grammars , 1989, Symbolic Computation.

[162]  George H. Roberts.  Recursive ascent: an LR analog to recursive descent , 1988, SIGP.

[163]  Hans Van Halteren.  Efficient Storage of Ambiguous Structures in Textual Databases , 1991 .

[164]  Alain Pirotte,et al.  Efficient parsing algorithms for general context-free parsers , 1975, Inf. Sci..

[165]  Hiroshi Maruyama,et al.  JAUNT: A Constraint Solver for Disjunctive Feature Structures , 1992, COLING.