|
|
|
|
| LEADER |
03591nmm a2200373 u 4500 |
| 001 |
EB000652508 |
| 003 |
EBX01000000000000000505590 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540301950
|
| 100 |
1 |
|
|a Paliouras, Georgios
|e [editor]
|
| 245 |
0 |
0 |
|a Grammatical Inference: Algorithms and Applications
|h Elektronische Ressource
|b 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004. Proceedings
|c edited by Georgios Paliouras, Yasubumi Sakakibara
|
| 250 |
|
|
|a 1st ed. 2004
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2004, 2004
|
| 300 |
|
|
|a XII, 296 p
|b online resource
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 DistinguishableLinear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse --
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 700 |
1 |
|
|a Sakakibara, Yasubumi
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
| 028 |
5 |
0 |
|a 10.1007/b101520
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b101520?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.45
|