Grammatical Inference: Theoretical Results and Applications

The ?rst edition of the International Colloquium on Grammatical Inference (ICGI) was held in Essex (United Kingdom) in 1993. After the success of this meeting there have been eight more editions that have been hosted by di- rent academic institutions across the world: Alicante (Spain, 1994), Montpellier (France, 1996), Ames, Iowa (USA, 1998), Lisbon (Portugal, 2000), Amsterdam (TheNetherlands,2002),Athens(Greece,2004),Tokyo(Japan,2006)andSaint- Malo (France, 2008). ICGI 2010 was held in Valencia (Spain) during September 13 16. It was organized by the Research Group on Formal Language Theory, Computability and Complexity from the Technical University of Valencia. This was the tenth edition of ICGI, which is a nice number for celebrations. Ten e- tions is a sign of good health for any conference. In the case of Grammatical Inference, it means that the topics, problems and applications of this research areaarealiveand serveasa goodframeworkto study relatedaspectsof arti?cial intelligence, natural language processing, formal language theory, computability and complexity, bioinformatics, pattern recognition, etc. There were two reviews and local discussions among the members of the Program Committee (PC) in order to evaluate every work proposed to the c- ference. This volume contains the texts of 32 papers presented at ICGI 2010. They are divided into two groups of works. There are 18 regular papers (out of 25)and14shortpapers(11outof15,andthreeregularpapersproposedasshort ones). The topics of the papers range from theoretical results about the learning of di?erentformallanguageclasses(regular,context-free,context-sensitive,etc. ) to application papers on bioinformatics, language modelling, software engine- ing, etc.

Unique visibility State-of-the-art survey Fast-track conference proceedings

Klappentext

This book constitutes the refereed proceedings of the 10th International Colloquium on Grammatical Inference, ICGI 2010, held in Valencia, Spain, in September 2010. The 18 revised full papers and 14 revised short papers presented were carefully reviewed and selected from numerous submissions. The topics of the papers presented vary from theoretical results about the learning of different formal language classes (regular, context-free, context-sensitive, etc.) to application papers on bioinformatics, language modelling or software engineering. Furthermore there are two invited papers on the topics grammatical inference and games and molecules, languages, and automata.

Inhalt
Invited Talks.- Grammatical Inference and Games: Extended Abstract.- Molecules, Languages and Automata.- Regular Papers.- Inferring Regular Trace Languages from Positive and Negative Samples.- Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher.- Learning Context Free Grammars with the Syntactic Concept Lattice.- Learning Automata Teams.- Exact DFA Identification Using SAT Solvers.- Learning Deterministic Finite Automata from Interleaved Strings.- Learning Regular Expressions from Representative Examples and Membership Queries.- Splitting of Learnable Classes.- PAC-Learning Unambiguous k,l-NTS??? Languages.- Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars.- CGE: A Sequential Learning Algorithm for Mealy Automata.- Using Grammar Induction to Model Adaptive Behavior of Networks of Collaborative Agents.- Transducer Inference by Assembling Specific Languages.- Sequences Classification by Least General Generalisations.- A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data.- A Local Search Algorithm for Grammatical Inference.- Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries.- Grammatical Inference as Class Discrimination.- Short Papers.- MDL in the Limit.- Grammatical Inference Algorithms in MATLAB.- A Non-deterministic Grammar Inference Algorithm Applied to the Cleavage Site Prediction Problem in Bioinformatics.- Learning PDFA with Asynchronous Transitions.- Grammar Inference Technology Applications in Software Engineering.- Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG.- Learning of Church-Rosser Tree Rewriting Systems.- Generalizing over Several Learning Settings.-Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us.- Extracting Shallow Paraphrasing Schemata from Modern Greek Text Using Statistical Significance Testing and Supervised Learning.- Learning Subclasses of Parallel Communicating Grammar Systems.- Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages.- Learning Fuzzy Context-Free GrammarA Preliminary Report.- Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers.