Grammatical Inference: Algorithms and Applications [electronic resource] : 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004. Proceedings / edited by Georgios Paliouras, Yasubumi Sakakibara.
Material type: TextSeries: Lecture Notes in Computer Science ; 3264Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004Description: XII, 296 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540301950Subject(s): Computer science | Logic design | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Mathematical Logic and Formal Languages | Logics and Meanings of ProgramsAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK3390 |
Invited Papers -- Learning and Mathematics -- Learning Finite-State Models for Machine Translation -- The Omphalos Context-Free Grammar Learning Competition -- Regular Papers -- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA -- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation -- Learning Mild Context-Sensitiveness: Toward Understanding Children’s Language Learning -- Learnability of Pregroup Grammars -- A Markovian Approach to the Induction of Regular String Distributions -- Learning Node Selecting Tree Transducer from Completely Annotated Examples -- Identifying Clusters from Positive Data -- Introducing Domain and Typing Bias in Automata Inference -- Analogical Equations in Sequences: Definition and Resolution -- Representing Languages by Learnable Rewriting Systems -- A Divide-and-Conquer Approach to Acquire Syntactic Categories -- Grammatical Inference Using Suffix Trees -- Learning Stochastic Finite Automata -- Navigation Pattern Discovery Using Grammatical Inference -- A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar -- Partial Learning Using Link Grammars Data -- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search -- The Boisdale Algorithm – An Induction Method for a Subclass of Unification Grammar from Positive Data -- Learning Stochastic Deterministic Regular Languages -- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data -- Poster Papers -- Learning Syntax from Function Words -- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages -- Extracting Minimum Length Document Type Definitions Is NP-Hard -- Learning Distinguishable Linear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse -- Identifying Left-Right Deterministic Linear Languages -- Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples -- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries.
There are no comments on this title.