Grammatical Inference: Algorithms and Applications

8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings

Yasibumi Sakaibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita (Herausgeber)

Buch | Softcover

XII, 359 Seiten

2006 | 2006
Springer Berlin (Verlag)
978-3-540-45264-5 (ISBN)

Artikel merken

lt;p>This book constitutes the refereed proceedings of the 8th International Colloquium on Grammatical Inference, ICGI 2006. The book presents 25 revised full papers and 8 revised short papers together with 2 invited contributions, carefully reviewed and selected. The topics discussed range 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.

Invited Papers.- Parsing Without Grammar Rules.- Classification of Biological Sequences with Kernel Methods.- Regular Papers.- Identification in the Limit of Systematic-Noisy Languages.- Ten Open Problems in Grammatical Inference.- Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data.- PAC-Learning Unambiguous NTS Languages.- Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets.- Variational Bayesian Grammar Induction for Natural Language.- Stochastic Analysis of Lexical and Semantic Enhanced Structural Language Model.- Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference.- Learning Analysis by Reduction from Positive Data.- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time.- Planar Languages and Learnability.- A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data.- Protein Motif Prediction by Grammatical Inference.- Grammatical Inference in Practice: A Case Study in the Biomedical Domain.- Inferring Grammar Rules of Programming Language Dialects.- The Tenjinno Machine Translation Competition.- Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1.- A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer.- Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.- Learning Multiplicity Tree Automata.- Learning DFA from Correction and Equivalence Queries.- Using MDL for Grammar Induction.- Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses.- Learning Deterministic DEC Grammars Is Learning Rational Numbers.- Iso-array Acceptors and Learning.- Poster Papers.- A Merging States Algorithm for Inference of RFSAs.- Query-Based Learning of XPath Expressions.- Learning Finite-State Machines from Inexperienced Teachers.- Suprasymbolic Grammar Induction by Recurrent Self-Organizing Maps.- Graph-Based Structural Data Mining in Cognitive Pattern Interpretation.- Constructing Song Syntax by Automata Induction.- Learning Reversible Languages with Terminal Distinguishability.- Grammatical Inference for Syntax-Based Statistical Machine Translation.

Erscheint lt. Verlag	18.9.2006
Reihe/Serie	Lecture Notes in Artificial Intelligence
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	XII, 359 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	526 g
Themenwelt	Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
	Informatik ► Theorie / Studium ► Compilerbau
	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	algorithm • Algorithmic Learning • algorithms • Automata • Computational Linguistics • context-free grammars • context-free languages • grammar learning • Grammatical Inference • Learning Algorithms • machine learning • NATURAL • neural learning • pattern recognition • probabilistic grammars • programming • statistical learn • Statistical Learning • Syntax
ISBN-10	3-540-45264-8 / 3540452648
ISBN-13	978-3-540-45264-5 / 9783540452645
Zustand	Neuware