Learning Context-Free Grammars from Positive Data and Membership Queries

In Helle Hvid Hansen, Andre Scedrov & Ruy J. G. B. De Queiroz (eds.), Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023, Proceedings. Springer Nature Switzerland. pp. 3-18 (2023)
  Copy   BIBTEX

Abstract

I review some recent results on learning subclasses of the context-free grammars from positive data and membership queries. I motivate the relevant learning algorithms through comparison with a similar and arguably reasonable learning algorithm for regular languages.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/978-3-031-39784-4_1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the expressive power of abstract categorial grammars: Representing context-free formalisms. [REVIEW]Philippe de Groote & Sylvain Pogodalla - 2004 - Journal of Logic, Language and Information 13 (4):421-438.
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms.Philippe Groote & Sylvain Pogodalla - 2004 - Journal of Logic, Language and Information 13 (4):421-438.
Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
Product-Free Lambek Calculus and Context-Free Grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars.Stephan Kepser & Jim Rogers - 2011 - Journal of Logic, Language and Information 20 (3):361-384.
Learnability of Pregroup Grammars.Denis Béchet, Annie Foret & Isabelle Tellier - 2007 - Studia Logica 87 (2-3):225-252.
On Learnability of Restricted Classes of Categorial Grammars.Barbara Dziemidowicz-Gryz - 2007 - Studia Logica 85 (2):153-169.
Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
Second-order abstract categorial grammars as hyperedge replacement grammars.Makoto Kanazawa - 2010 - Journal of Logic, Language and Information 19 (2):137-161.
The equivalence of Nonassociative Lambek Categorial Grammars and Context‐Free Grammars.Maciej Kandulski - 1988 - Mathematical Logic Quarterly 34 (1):41-52.
The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars.Wojciech Buszkowski - 1985 - Mathematical Logic Quarterly 31 (24):369-384.
The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars.Wojcßch Buszkowski - 1985 - Mathematical Logic Quarterly 31 (24):369-384.
The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars.Maciej Kandulski - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):41-52.
The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars.Wojcßch Buszkowski - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (24):369-384.
Learning correction grammars.Lorenzo Carlucci, John Case & Sanjay Jain - 2009 - Journal of Symbolic Logic 74 (2):489-516.

Analytics

Added to PP
2023-08-31

Downloads
3 (#1,726,395)

6 months
3 (#1,044,897)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references