Grammatical Inference: Algorithms and Applications [electronic resource] : 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings / edited by Yasibumi Sakaibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita.
Contributor(s): Sakaibara, Yasibumi [editor.] | Kobayashi, Satoshi [editor.] | Sato, Kengo [editor.] | Nishino, Tetsuro [editor.] | Tomita, Etsuji [editor.] | SpringerLink (Online service).
Material type: BookSeries: Lecture Notes in Artificial Intelligence: 4201Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Edition: 1st ed. 2006.Description: XII, 359 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540452652.Subject(s): Compilers (Computer programs) | Artificial intelligence | Machine theory | Computer science | Compilers and Interpreters | Artificial Intelligence | Formal Languages and Automata Theory | Computer Science Logic and Foundations of ProgrammingAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.45 Online resources: Click here to access onlineInvited 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.
There are no comments for this item.