Grammatical Inference: Algorithms and Applications 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Sakaibara, Yasibumi (Editor ), Kobayashi, Satoshi (Editor ), Sato, Kengo (Editor ), Nishino, Tetsuro (Editor ), Tomita, Etsuji (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Lecture Notes in Artificial Intelligence, 4201
Temas:
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 Programming.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares