Skip to main content
SpringerLink
Log in

Grammatical Inference: Algorithms and Applications

9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Alexander Clark
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. François Coste
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Laurent Miclet
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5278)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: ICGI 2008.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 99.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the refereed proceedings of the 9th International Colloquium on Grammatical Inference, ICGI 2008, held in Saint-Malo, France, in September 2008. The 21 revised full papers and 8 revised short papers presented were carefully reviewed and selected from 36 submissions. The topics of the papers presented vary from theoretical results of learning algorithms to innovative applications of grammatical inference, and from learning several interesting classes of formal grammars to applications to natural language processing.

Similar content being viewed by others

Keywords

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Regular Papers

    1. Learning Meaning Before Syntax

      • Dana Angluin, Leonor Becerra-Bonache
      Pages 1-14

    2. Schema-Guided Induction of Monadic Queries

      • Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
      Pages 15-28

    3. A Polynomial Algorithm for the Inference of Context Free Languages

      • Alexander Clark, Rémi Eyraud, Amaury Habrard
      Pages 29-42

    4. Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings

      • Colin de la Higuera, Jean-Christophe Janodet, Frédéric Tantini
      Pages 43-56

    5. Relevant Representations for the Inference of Rational Stochastic Tree Languages

      • François Denis, Édouard Gilbert, Amaury Habrard, Faïssal Ouardi, Marc Tommasi
      Pages 57-70

    6. Learning Commutative Regular Languages

      • Antonio Cano Gómez, Gloria I. Álvarez
      Pages 71-83

    7. Learning Left-to-Right and Right-to-Left Iterative Languages

      • Jeffrey Heinz
      Pages 84-97

    8. Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets

      • Yuuichi Kameda, Hiroo Tokunaga, Akihiro Yamamoto
      Pages 98-110

    9. A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness

      • Anna Kasprzik
      Pages 111-124

    10. On Learning Regular Expressions and Patterns Via Membership and Correction Queries

      • Efim Kinber
      Pages 125-138

    11. State-Merging DFA Induction Algorithms with Mandatory Merge Constraints

      • Bernard Lambeau, Christophe Damas, Pierre Dupont
      Pages 139-153

    12. Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries

      • Jose Oncina
      Pages 154-162

    13. Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata

      • Jorge Castro, Ricard Gavaldà
      Pages 163-174

    14. Learning Context-Sensitive Languages from Linear Structural Information

      • José M. Sempere
      Pages 175-186

    15. Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries

      • Yasuhiro Tajima, Yoshiyuki Kotani
      Pages 187-199

    16. How to Split Recursive Automata

      • Isabelle Tellier
      Pages 200-212

    17. A Note on the Relationship between Different Types of Correction Queries

      • Cristina Tîrnăucă
      Pages 213-223

    18. Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering

      • Kewei Tu, Vasant Honavar
      Pages 224-237

    19. Polynomial Distinguishability of Timed Automata

      • Sicco Verwer, Mathijs de Weerdt, Cees Witteveen
      Pages 238-251
Back to top

Other volumes

  1. Grammatical Inference: Algorithms and Applications

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation