Grammatical Inference: Algorithms and Applications : 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / edited by Alexander Clark, François Coste, Laurent Miclet.

Format:

Book

Contributor:

Clark, Alexander, editor.

Coste, François, editor.

Miclet, Laurent, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science. Lecture notes in artificial intelligence ; 5278.

Lecture Notes in Artificial Intelligence ; 5278

Language:

English

Subjects (All):

Programming languages (Electronic computers).

Artificial intelligence.

Computer programming.

Logic, Symbolic and mathematical.

Computer logic.

Programming Languages, Compilers, Interpreters.

Artificial Intelligence.

Programming Techniques.

Mathematical Logic and Formal Languages.

Logics and Meanings of Programs.

Local Subjects:

Programming Languages, Compilers, Interpreters.

Artificial Intelligence.

Programming Techniques.

Mathematical Logic and Formal Languages.

Logics and Meanings of Programs.

Physical Description:

1 online resource (XI, 305 pages).

Edition:

First edition 2008.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.

System Details:

text file PDF

Summary:

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.

Contents:

Regular Papers

Learning Meaning Before Syntax

Schema-Guided Induction of Monadic Queries

A Polynomial Algorithm for the Inference of Context Free Languages

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

Relevant Representations for the Inference of Rational Stochastic Tree Languages

Learning Commutative Regular Languages

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

Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets

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

On Learning Regular Expressions and Patterns Via Membership and Correction Queries

State-Merging DFA Induction Algorithms with Mandatory Merge Constraints

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

Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata

Learning Context-Sensitive Languages from Linear Structural Information

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

How to Split Recursive Automata

A Note on the Relationship between Different Types of Correction Queries

Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering

Polynomial Distinguishability of Timed Automata

Evaluation and Comparison of Inferred Regular Grammars

Identification in the Limit of k,l-Substitutable Context-Free Languages

Poster Papers

Learning Subclasses of Pure Pattern Languages

Which Came First, the Grammar or the Lexicon?

Learning Node Label Controlled Graph Grammars (Extended Abstract)

Inference of Uniquely Terminating EML

Estimating Graph Parameters Using Graph Grammars

Learning of Regular ?-Tree Languages

Inducing Regular Languages Using Grammar-Based Classifier System

Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems.

Other Format:

Printed edition:

ISBN:

978-3-540-88009-7

9783540880097

Access Restriction:

Restricted for use by site license.