000 04421nam a22005535i 4500
001 978-3-540-45265-2
003 DE-He213
005 20160624102000.0
007 cr nn 008mamaa
008 100323s2006 gw | s |||| 0|eng d
020 _a9783540452652
_9978-3-540-45265-2
024 7 _a10.1007/11872436
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aGrammatical Inference: Algorithms and Applications
_h[electronic resource] :
_b8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006. Proceedings /
_cedited by Yasubumi Sakakibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
300 _aXII, 359 p. Also available online.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4201
505 0 _aInvited 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.
650 0 _aComputer science.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
700 1 _aSakakibara, Yasubumi.
_eeditor.
700 1 _aKobayashi, Satoshi.
_eeditor.
700 1 _aSato, Kengo.
_eeditor.
700 1 _aNishino, Tetsuro.
_eeditor.
700 1 _aTomita, Etsuji.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540452645
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4201
856 4 0 _uhttp://dx.doi.org/10.1007/11872436
942 _2EBK5288
_cEBK
999 _c34582
_d34582