04414nam 2200589 a 450 991076845680332120200520144314.03-540-45265-610.1007/11872436(CKB)1000000000283862(SSID)ssj0000317972(PQKBManifestationID)11230727(PQKBTitleCode)TC0000317972(PQKBWorkID)10308263(PQKB)10331263(DE-He213)978-3-540-45265-2(MiAaPQ)EBC3068059(PPN)123138558(EXLCZ)99100000000028386220060810d2006 uy 0engurnn#008mamaatxtccrGrammatical inference algorithms and applications : 8th international colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006 : proceedings /Yasubumi Sakakibara ... [et al.] (eds.)1st ed. 2006.Berlin ;New York Springer20061 online resource (XII, 359 p.)LNCS sublibrary. SL 7, Artificial intelligenceLecture notes in computer science. Lecture notes in artificial intelligence,0302-9743 ;4201Bibliographic Level Mode of Issuance: Monograph3-540-45264-8 Includes bibliographical references and index.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.LNCS sublibrary.SL 7,Artificial intelligence.Lecture notes in computer science.Lecture notes in artificial intelligence ;4201.ICGI 2006Formal languagesCongressesLogic, Symbolic and mathematicalCongressesFormal languagesLogic, Symbolic and mathematical005.13/1Sakakibara Yasubumi919566International Colloquium on Grammatical InferenceMiAaPQMiAaPQMiAaPQBOOK9910768456803321Grammatical inference4203352UNINA