Proceedings of FGVienna: The 8th conference on Formal Grammar

The article is concerned with learning link grammars in the model of Gold. We show that rigid and k-valued link grammars are learnable from strings. In fact, we prove that the languages of link structured lists of words associated to rigid link grammars have finite elasticity and we show a learning algorithm. As a standard corollary, this result leads to the learnability of rigid or k-valued link grammars learned from strings.

[1]  Jean Berstel,et al.  XML Grammars , 2000, MFCS.

[2]  L. T. F. Gamut.  Intensional logic and logical grammar , 1991 .

[3]  Tadao Kasami,et al.  On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[4]  Clemens Lautemann,et al.  Decomposition Trees: Structured Graph Representation and Efficient Algorithms , 1988, CAAP.

[5]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[6]  Mark Steedman,et al.  Acquiring Compact Lexicalized Grammars from a Cleaner Treebank , 2002, LREC.

[7]  Christer Lindqvist,et al.  Zur Entstehung von Präpositionen im Deutschen und Schwedischen , 1994 .

[8]  Edward P. Stabler,et al.  Remnant movement and complexity , 2000 .

[9]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[10]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[11]  A. Dikovsky.  Discourse Plan Meaning , 2003 .

[12]  John T. Maxwell,et al.  Formal issues in lexical-functional grammar , 1998 .

[13]  David Lebeaux,et al.  Relative Clauses, Licensing, and the Nature of the Derivation , 1991 .

[14]  Shûichi Yatabe,et al.  A linearization-based theory of summative agreement in peripheral-node raising constructions , 2003, Proceedings of the International Conference on Head-Driven Phrase Structure Grammar.

[15]  Ted Pedersen,et al.  Lexical Acquisition via Constraint Solving , 1995, ArXiv.

[16]  Chris Collins.  Economy of derivation and the generalized proper binding condition , 1994 .

[17]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[18]  William C. Rounds,et al.  Mappings and grammars on trees , 1970, Mathematical systems theory.

[19]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[20]  Noam Chomsky,et al.  Minimalist inquiries : the framework , 1998 .

[21]  Ivan A. Sag,et al.  Information-Based Syntax and Semantics: Volume 1, Fundamentals , 1987 .

[22]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[23]  Robert McNaughton,et al.  Parenthesis Grammars , 1967, JACM.

[24]  Noam Chomsky,et al.  Lectures on Government and Binding , 1981 .

[25]  Wolfgang Fleischer,et al.  Phraseologie der deutschen Gegenwartssprache , 1997 .

[26]  David Milward,et al.  Non-Constituent Coordination: Theory and Practice , 1994, COLING.

[27]  Alexandra Kinyon,et al.  Generating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar , 2003, ACL.

[28]  Erwin K. Welsch,et al.  A Closer Look at…: Accessing Information through Networks , 1991 .

[29]  J. Schröder.  Lexikon deutscher Präpositionen , 1986 .

[30]  Mark-Jan Nederhof,et al.  Regular Approximations of CFLs: A Grammatical View , 1997, IWPT.

[31]  B. Partee,et al.  Mathematical Methods in Linguistics , 1990 .

[32]  Josef van Genabith,et al.  Experiments in Structure-Preserving Grammar Compaction , 2000 .

[33]  Edward P. Stabler,et al.  Recognizing Head Movement , 2001, LACL.

[34]  Pierre Boullier.  A Proposal for a Natural Lan-guage Processing Syntactic Backbone , 1997 .

[35]  Henk Harkema.  A Recognizer for Minimalist Grammars , 2000, IWPT.

[36]  Michael W. Daniels.  On a Type-Based Analysis of Feature Neutrality and the Coordination of Unlikes , 2002 .

[37]  Gerald Gazdar,et al.  Coordination and how to distinguish categories , 1985 .

[38]  Bertrand Gaiffe,et al.  A new metagrammar compiler , 2002, TAG+.

[39]  D. Flickinger.  Lexical rules in the hierarchical lexicon , 1989 .

[40]  Stuart M. Shieber,et al.  An Alternative Conception of Tree-Adjoining Derivation , 1992, ACL.

[41]  Mark-Jan Nederhof,et al.  Regular Approximation of Context-Free Grammars through Transformation , 2001 .

[42]  金沢 誠.  Learnable classes of categorial grammars , 1994 .

[43]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[44]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[45]  Aravind K. Joshi,et al.  A study of tree adjoining grammars , 1987 .

[46]  Rebecca N. Wright,et al.  Finite-State Approximation of Phrase Structure Grammars , 1991, ACL.

[47]  Sam Bayer,et al.  The Coordination of Unlike Categories. , 1996 .

[48]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[49]  Edward P. Stabler,et al.  Derivational Minimalism , 1996, LACL.

[50]  STEVEN KRAUWER,et al.  TRANSDUCERS AND GRAMMARS AS THEORIES OF LANGUAGE , 1981 .

[51]  M. de Rijke,et al.  Encoding Two-Valued Nonclassical Logics in Classical Logic , 2001, Handbook of Automated Reasoning.

[52]  Kimmo Koskenniemi,et al.  A General Computational Model for Word-Form Recognition and Production , 1984, ACL.

[53]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[54]  Mark Johnson,et al.  Features and Agreement , 1995, ACL.

[55]  Anne Abeillé,et al.  FTAG : current status and parsing scheme , 1999 .

[56]  Adam L. Berger,et al.  A Maximum Entropy Approach to Natural Language Processing , 1996, CL.

[57]  Mehryar Mohri,et al.  Dynamic compilation of weighted context-free grammars , 1998, COLING.

[58]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

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

[60]  Robin Cooper,et al.  The NP-S analysis of relative clauses and compositional semantics , 1978 .

[61]  Stephen Pulman,et al.  Grammars, parsers, and memory limitations , 1986 .

[62]  Manfred Sailer,et al.  Combinatorial Semantics and Idiomatic Expressions in Head-Driven Phrase Structure Grammar , 2000 .

[63]  Jens Michaelis,et al.  Derivational Minimalism Is Mildly Context-Sensitive , 1998, LACL.

[64]  Steve Young,et al.  Applications of stochastic context-free grammars using the Inside-Outside algorithm , 1990 .

[65]  James Rogers,et al.  A descriptive approach to language-theoretic complexity , 1998 .

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

[67]  Hans-Martin Gärtner,et al.  On the Treatment of Scrambling and Adjunction in Minimalist Grammars 1 , 2002 .

[68]  Anssi Yli-Jyrä,et al.  Multiplanarity - a model for dependency structures in treebanks , 2003 .

[69]  Frank Richter,et al.  Cranberry Words in Formal Grammar , 2002 .

[70]  Dekai Wu,et al.  Learning restricted probabilistic link grammars , 1995, Learning for Natural Language Processing.

[71]  Mark-Jan Nederhof,et al.  Practical Experiments with Regular Approximation of Context-Free Languages , 1999, CL.

[72]  John D. Lafferty,et al.  Inference and Estimation of a Long-Range Trigram Model , 1994, ICGI.

[73]  Aravind K. Joshi.  A note on the strong and weak generative powers of formal systems , 2003, Theor. Comput. Sci..

[74]  Christophe Costa Florêncio.  Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard , 2002, ICGI.

[75]  Yasubumi Sakakibara,et al.  Efficient Learning of Context-Free Grammars from Positive Structural Examples , 1992, Inf. Comput..

[76]  Steven P. Abney.  Stochastic Attribute-Value Grammars , 1996, CL.

[77]  Marcus Kracht,et al.  Is there a genuine modal perspective on feature structures? , 1995 .

[79]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[80]  A. Frank.  Automatic F-Structure Annotation of Treebank Trees and CFGs extracted from Treebanks , 2003 .

[81]  Alan W. Black.  Finite State Machines from Feature Grammars , 1989, IWPT.

[82]  Anssi Yli-Jyrä,et al.  Describing Syntax with Star-Free Regular Expressions , 2003, EACL.

[83]  Berthold Crysmann,et al.  Clitics and coordination in linear structure , 2001 .

[84]  Joost Engelfriet,et al.  Context-Free Graph Grammars , 1997, Handbook of Formal Languages.

[85]  David Chiang,et al.  Statistical Parsing with an Automatically-Extracted Tree Adjoining Grammar , 2000, ACL.

[86]  Gerald Penn,et al.  Categorial grammars determined from linguistic data by unification , 1990, Stud Logica.

[87]  Andreas Kathol,et al.  Linearization-based German syntax , 1995 .

[88]  Dekai Wu,et al.  An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words , 1995, ACL.

[89]  Celia Wrathall,et al.  Characterizations of the Dyck Sets , 1977, RAIRO Theor. Informatics Appl..

[90]  Jean-Éric Pin,et al.  Algebraic tools for the concatenation product , 2003, Theor. Comput. Sci..

[91]  C. Fillmore,et al.  Regularity and Idiomaticity in Grammatical Constructions: The Case of Let Alone , 1988 .

[92]  Ivan A. Sag,et al.  Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.

[93]  Michael Collins,et al.  Head-Driven Statistical Models for Natural Language Parsing , 2003, CL.

[94]  Sandra Kübler.  Learning a Lexicalized Grammar for German , 1998, CoNLL.

[95]  Kordula De Kuthy,et al.  Discontinuous NPs in German: A Case Study of the Interaction of Syntax, Semantics, and Pragmatics , 2002 .

[96]  Philip Neal Whitman,et al.  Category Neutrality: A Type-Logical Investigation , 2004 .

[97]  Bruno Courcelle,et al.  Graph expressions and graph rewritings , 1987, Mathematical systems theory.

[98]  Yves Schabes,et al.  Parsing with Finite-State Transducers , 1997 .

[99]  Christophe Costa Florêncio.  Consistent Identification in the Limit of Any of the Classes k -Valued Is NP-hard , 2001, LACL.

[100]  Frederick N. Springsteel,et al.  Language Recognition by Marking Automata , 1972, Inf. Control..

[101]  Richard C. Waters,et al.  Tree Insertion Grammar: A Cubic-Time, Parsable Formalism that Lexicalizes Context-Free Grammar without Changing the Trees Produced , 1995, CL.

[102]  Dmitrij Dobrovol’skij,et al.  Sprachliche Unikalia im Deutschen: Zum Phänomen phraseologisch gebundener Formative , 1994 .

[103]  Randolph Quirk,et al.  Complex prepositions and related sequences , 1964 .

[104]  Yves Schabes,et al.  Applying a Finite-State Intersection Grammar , 1997 .

[105]  I. Sag.  English relative clause constructions , 1997, Journal of Linguistics.

[106]  Pasi Tapanainen.  Applying a finite-state intersection grammar , 1997 .

[107]  Joshua Goodman,et al.  Semiring Parsing , 1999, CL.

[108]  Geoffrey K. Pullum,et al.  On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks , 2001, LACL.

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

[110]  Martin Kappes.  On the Generative Capacity of Bracketed Contextual Grammars , 1998, Grammars.

[111]  Bruno Courcelle,et al.  The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues , 1992, RAIRO Theor. Informatics Appl..

[112]  Mati Pentus,et al.  Lambek grammars are context free , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[113]  James Rogers.  Capturing CFLs with Tree Adjoining Grammars , 1994, ACL.

[114]  Daniel Dominic Sleator,et al.  Parsing English with a Link Grammar , 1995, IWPT.

[115]  Noam Chomsky,et al.  The Minimalist Program , 1992 .

[116]  Walt Detmar Meurers,et al.  Lexical Generalizations in the Syntax of German Non-Finite Constructions , 1999 .

[117]  Wojciech Buszkowski,et al.  Mathematical Linguistics and Proof Theory , 1997, Handbook of Logic and Language.

[118]  Eugene Galanter,et al.  Handbook of mathematical psychology: I. , 1963 .

[119]  Michael Collins,et al.  Discriminative Reranking for Natural Language Parsing , 2000, CL.

[120]  Ivan A. Sag,et al.  French Clitic Movement Without Clitics or Movement , 1997 .

[121]  Aravind K. Joshi,et al.  Treatment of Long Distance Dependencies in LFG and TAG: Functional Uncertainty in LFG is a Corollary in TAG , 1989, ACL.

[122]  Susanne Z. Riehemann,et al.  A constructional approach to idioms and word formation , 2001 .

[123]  Miriam Butt,et al.  The Parallel Grammar Project , 2002, COLING 2002.

[124]  Alexandra Kinyon,et al.  XLFG-an LFG parsing scheme for French , 2001 .

[125]  Igor Mel’čuk,et al.  Dependency Syntax: Theory and Practice , 1987 .

[126]  D. Terence Langendoen,et al.  On the Design of Finite Transducers for Parsing Phrase-Structure Languages , 1987 .

[127]  Jeroen Groenendijk,et al.  Formal methods in the study of language , 1983 .

[128]  M. Dalrymple,et al.  Feature Indeterminacy and Feature Resolution. , 2000 .

[129]  Tsujii Jun'ichi,et al.  Maximum entropy estimation for feature forests , 2002 .

[130]  Mark Johnson,et al.  Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms , 1998, ACL.

[131]  Michael Moortgat,et al.  Categorial Type Logics , 1997, Handbook of Logic and Language.

[132]  Edith Hemaspaandra,et al.  A modal perspective on the computational complexity of attribute value grammar , 1993, J. Log. Lang. Inf..

[133]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

[134]  Jörg Meibauer.  Komplexe Präpositionen – Grammatikalisierung, Metapher, Implikatur und division of pragmatic labour , 1995 .

[135]  Takeshi Shinohara.  Inductive inference from positive data is powerful , 1990, COLT '90.

[136]  Norbert Fries.  Präpositionen und Präpositionalphrasen im Deutschen und im Neugriechischen: Aspekte einer kontrastiven Analyse Deutsch - Neugriechisch , 1988 .

[137]  Keith Wright.  Identification of unions of languages drawn from an identifiable class , 1989, COLT '89.

[138]  Mark Steedman,et al.  Gapping as constituent coordination , 1990 .

[139]  Marie-Hélène Candito,et al.  A principle-based hierarchical representation of LTAGs , 1996, COLING.

[140]  Walt Detmar Meurers.  Using lexical principles in HPSG to generalize over valence properties , 1997 .

[141]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[142]  David Chiang,et al.  Putting Some Weakly Context-Free Formalisms in Order , 2002, TAG+.

[143]  David Chiang,et al.  Constraints on Strong Generative Power , 2001, ACL.

[144]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[145]  Annie Foret,et al.  On Limit Points for Some Variants of Rigid Lambek Grammars , 2002, ICGI.

[146]  Shûichi Yatabe.  syntax and semantics of left-node raising in Japanese , 2001, Proceedings of the International Conference on Head-Driven Phrase Structure Grammar.

[147]  Andrew McCallum,et al.  Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.

[148]  Mary Dalrymple,et al.  Linear Logic for Meaning Assembly , 1995, ArXiv.

[149]  David I. Beaver,et al.  The Handbook of Logic and Language , 1997 .

[150]  Janusz A. Brzozowski,et al.  The Dot-Depth Hierarchy of Star-Free Languages is Infinite , 1978, J. Comput. Syst. Sci..

[151]  Adwait Ratnaparkhi,et al.  A Linear Observed Time Statistical Parser Based on Maximum Entropy Models , 1997, EMNLP.

[152]  William C. Rounds,et al.  Feature Logics , 1997, Handbook of Logic and Language.

[153]  Aravind K. Joshi,et al.  Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.

[154]  A Classification of Grammar Development Strategies , 2002, COLING 2002.

[155]  John F. Sowa,et al.  Principles of semantic networks , 1991 .

[156]  Pierre Boullier,et al.  Range Concatenation Grammars , 2000, IWPT.

[157]  Seymour Ginsburg,et al.  Bracketed Context-Free Languages , 1967, J. Comput. Syst. Sci..

[158]  Takeshi Shinohara,et al.  The correct definition of finite elasticity: corrigendum to identification of unions , 1991, COLT '91.

[159]  Manfred Sailer.  Distributionsidiosynkrasien: Korpuslinguistische Erfassung und grammatiktheoretische Deutung , 2004 .

[160]  N. Cocchiarella,et al.  Situations and Attitudes. , 1986 .

[161]  Robert Ingria,et al.  The Limits of Unification , 1990, ACL.

[162]  Roger Levy,et al.  Coordination and neutralization in HPSG , 2002, Proceedings of the International Conference on Head-Driven Phrase Structure Grammar.

[163]  Alexandra Kinyon.  Hypertags , 2000, COLING.

[164]  Frank Richter,et al.  A Mathematical Formalism for Linguistic Theories with an Application in Head-Driven Phrase Structure Grammar , 2000 .

[165]  Seymour Ginsburg,et al.  Uniformly Erasable AFL , 1975, J. Comput. Syst. Sci..

[166]  Alan Ryan,et al.  From left to right , 1997 .

[167]  Masako Takahashi,et al.  Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages , 1975, Inf. Control..

[168]  Mark-Jan Nederhof,et al.  On the Complexity of Some Extensions of RCG Parsing , 2001, IWPT.

[169]  李幼升,et al.  Ph , 1989 .

[170]  Jesse Tseng,et al.  The representation and selection of prepositions , 2000 .

[171]  Philip H. Miller,et al.  Clitics and constituents in phrase structure grammar , 1992 .

[172]  Ivan A. Sag,et al.  Information-based syntax and semantics , 1987 .