Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002. Proceedings / / edited by Pieter Adriaans, Henning Fernau, Menno van Zaanen
| Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002. Proceedings / / edited by Pieter Adriaans, Henning Fernau, Menno van Zaanen |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 318 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Natural language processing (Computer science)
Programming languages (Electronic computers) Artificial intelligence Mathematical logic Computer logic Natural Language Processing (NLP) Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-45790-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributions -- Inference of Sequential Association Rules Guided by Context-Free Grammars -- PCFG Learning by Nonterminal Partition Search -- Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations -- Beyond EDSM -- Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard -- Some Classes of Regular Languages Identifiable in the Limit from Positive Data -- Learning Probabilistic Residual Finite State Automata -- Fragmentation: Enhancing Identifiability -- On Limit Points for Some Variants of Rigid Lambek Grammars -- Generalized Stochastic Tree Automata for Multi-relational Data Mining -- On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data -- Stochastic Grammatical Inference with Multinomial Tests -- Learning Languages with Help -- Incremental Learning of Context Free Grammars -- Estimating Grammar Parameters Using Bounded Memory -- Stochastic k-testable Tree Languages and Applications -- Fast Learning from Strings of 2-Letter Rigid Grammars -- Learning Locally Testable Even Linear Languages from Positive Data -- Inferring Attribute Grammars with Structured Data for Natural Language Processing -- A PAC Learnability of Simple Deterministic Languages -- On the Learnability of Hidden Markov Models -- Shallow Parsing Using Probabilistic Grammatical Inference -- Learning of Regular Bi-? Languages -- Software Descriptions -- The EMILE 4.1 Grammar Induction Toolbox -- Software for Analysing Recurrent Neural Nets That Learn to Predict Non-regular Languages -- A Framework for Inductive Learning of Typed-Unification Grammars -- A Tool for Language Learning Based on Categorial Grammars and Semantic Information -- ‘NAIL’: Artificial Intelligence Software for Learning Natural Language -- Lyrebird™: Developing Spoken Dialog Systems Using Examples -- Implementing Alignment-Based Learning. |
| Record Nr. | UNISA-996465421403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Grammatical Inference: Algorithms and Applications : 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002. Proceedings / / edited by Pieter Adriaans, Henning Fernau, Menno van Zaanen
| Grammatical Inference: Algorithms and Applications : 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002. Proceedings / / edited by Pieter Adriaans, Henning Fernau, Menno van Zaanen |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 318 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Natural language processing (Computer science)
Programming languages (Electronic computers) Artificial intelligence Mathematical logic Computer logic Natural Language Processing (NLP) Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-45790-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributions -- Inference of Sequential Association Rules Guided by Context-Free Grammars -- PCFG Learning by Nonterminal Partition Search -- Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations -- Beyond EDSM -- Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard -- Some Classes of Regular Languages Identifiable in the Limit from Positive Data -- Learning Probabilistic Residual Finite State Automata -- Fragmentation: Enhancing Identifiability -- On Limit Points for Some Variants of Rigid Lambek Grammars -- Generalized Stochastic Tree Automata for Multi-relational Data Mining -- On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data -- Stochastic Grammatical Inference with Multinomial Tests -- Learning Languages with Help -- Incremental Learning of Context Free Grammars -- Estimating Grammar Parameters Using Bounded Memory -- Stochastic k-testable Tree Languages and Applications -- Fast Learning from Strings of 2-Letter Rigid Grammars -- Learning Locally Testable Even Linear Languages from Positive Data -- Inferring Attribute Grammars with Structured Data for Natural Language Processing -- A PAC Learnability of Simple Deterministic Languages -- On the Learnability of Hidden Markov Models -- Shallow Parsing Using Probabilistic Grammatical Inference -- Learning of Regular Bi-? Languages -- Software Descriptions -- The EMILE 4.1 Grammar Induction Toolbox -- Software for Analysing Recurrent Neural Nets That Learn to Predict Non-regular Languages -- A Framework for Inductive Learning of Typed-Unification Grammars -- A Tool for Language Learning Based on Categorial Grammars and Semantic Information -- ‘NAIL’: Artificial Intelligence Software for Learning Natural Language -- Lyrebird™: Developing Spoken Dialog Systems Using Examples -- Implementing Alignment-Based Learning. |
| Record Nr. | UNINA-9910143898703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||