Grammatical Inference: Algorithms and Applications: 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / Edition 1

Grammatical Inference: Algorithms and Applications: 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / Edition 1

by Alexander Clark, Francois Coste, Laurent Miclet
     
 

The 9th International Colloquium on Grammatical Inference (ICGI 2008) was held at the Palaisdu Grand Large, Saint Malo, France during September 22–24, 2006. ICGI 2008 was the ninth in a series of successful biennial international conferences in the area of grammatical inference. Previous meetings were held in Essex, UK; Alicante, Spain; Montpellier, France;

See more details below

Overview

The 9th International Colloquium on Grammatical Inference (ICGI 2008) was held at the Palaisdu Grand Large, Saint Malo, France during September 22–24, 2006. ICGI 2008 was the ninth in a series of successful biennial international conferences in the area of grammatical inference. Previous meetings were held in Essex, UK; Alicante, Spain; Montpellier, France; Ames, Iowa, USA; Lisbon, Portugal; Amsterdam, The Netherlands; Athens, Greece; Tokyo, Japan. This series of conferences seeks to provide a forum for presentation and discussion of original research papers on all aspects of grammatical inference. Grammatical inference, the study of learning grammars from data, is an - tablished research field in artificialintelligence,dating backto the 1960sandhas been extensively addressed by researchersin automata theory, language acqui- tion, computational linguistics, machine learning, pattern recognition,compu- tional learning theory and neural networks. ICGI 2008 particularly emphasized themulti-disciplinarynatureoftheresearch fieldandthediversedomainsinwhich grammaticalinferenceisbeingapplied,suchasnaturallanguageacquisition,c- putationalbiology,structuralpatternrecognition,informationretrieval,Webm- ing,text processing,data compressionandadaptiveintelligentagents. We received 36 high-quality papers from 15 countries around the world. The papers were reviewed by three reviewers. Based on the positive comments of the reviewers, 21 full papers were accepted. In addition, we decided to accept eight short papers for poster presentation. Short papers appear as extended abstracts in a separate section of this volume. The topics of the accepted papers 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.

Read More

Product Details

ISBN-13:
9783540880080
Publisher:
Springer Berlin Heidelberg
Publication date:
09/28/2008
Series:
Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence, #5278
Edition description:
2008
Pages:
305
Product dimensions:
6.00(w) x 9.30(h) x 0.80(d)

Table of 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 Shastic 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.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >