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.
Algorithmic Learning Theory [[electronic resource] ] : 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014, Proceedings / / edited by Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles
| Algorithmic Learning Theory [[electronic resource] ] : 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014, Proceedings / / edited by Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 351 p. 22 illus.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Data mining Pattern recognition Artificial Intelligence Theory of Computation Data Mining and Knowledge Discovery Pattern Recognition |
| ISBN | 3-319-11662-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Inductive Inference -- Exact Learning from Queries -- Reinforcement Learning -- Online Learning and Learning with Bandit Information -- Statistical Learning Theory -- Privacy, Clustering, MDL, and Kolmogorov Complexity. |
| Record Nr. | UNISA-996213650903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014, Proceedings / / edited by Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles
| Algorithmic Learning Theory : 25th International Conference, ALT 2014, Bled, Slovenia, October 8-10, 2014, Proceedings / / edited by Peter Auer, Alexander Clark, Thomas Zeugmann, Sandra Zilles |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 351 p. 22 illus.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computers Data mining Pattern perception Artificial Intelligence Theory of Computation Data Mining and Knowledge Discovery Pattern Recognition |
| ISBN | 3-319-11662-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Inductive Inference -- Exact Learning from Queries -- Reinforcement Learning -- Online Learning and Learning with Bandit Information -- Statistical Learning Theory -- Privacy, Clustering, MDL, and Kolmogorov Complexity. |
| Record Nr. | UNINA-9910482964503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Comparison of past, present, and future volume estimation methods for Tennessee [[electronic resource] /] / Stanley J. Zarnoch, Alexander Clark III, and Ray A. Souter
| Comparison of past, present, and future volume estimation methods for Tennessee [[electronic resource] /] / Stanley J. Zarnoch, Alexander Clark III, and Ray A. Souter |
| Autore | Zarnoch Stanley J |
| Pubbl/distr/stampa | Asheville, NC : , : U.S. Dept. of Agriculture, Forest Service, Southern Research Station, , [2003] |
| Descrizione fisica | 6 pages : digital, PDF file |
| Altri autori (Persone) |
ClarkAlexander
SouterRay A <1953-> (Ray Albert) |
| Collana | Research note SRS |
| Soggetto topico | Forests and forestry - Tennessee - Measurement |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910695858703321 |
Zarnoch Stanley J
|
||
| Asheville, NC : , : U.S. Dept. of Agriculture, Forest Service, Southern Research Station, , [2003] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / / edited by Alexander Clark, François Coste, Laurent Miclet
| Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / / edited by Alexander Clark, François Coste, Laurent Miclet |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XI, 305 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Artificial intelligence Computer programming Mathematical logic Computer logic Programming Languages, Compilers, Interpreters Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-88009-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Papers -- Learning Meaning Before Syntax -- Schema-Guided Induction of Monadic Queries -- A Polynomial Algorithm for the Inference of Context Free Languages -- Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings -- Relevant Representations for the Inference of Rational Stochastic Tree Languages -- Learning Commutative Regular Languages -- Learning Left-to-Right and Right-to-Left Iterative Languages -- Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets -- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness -- On Learning Regular Expressions and Patterns Via Membership and Correction Queries -- State-Merging DFA Induction Algorithms with Mandatory Merge Constraints -- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries -- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata -- Learning Context-Sensitive Languages from Linear Structural Information -- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries -- How to Split Recursive Automata -- A Note on the Relationship between Different Types of Correction Queries -- Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering -- Polynomial Distinguishability of Timed Automata -- Evaluation and Comparison of Inferred Regular Grammars -- Identification in the Limit of k,l-Substitutable Context-Free Languages -- Poster Papers -- Learning Subclasses of Pure Pattern Languages -- Which Came First, the Grammar or the Lexicon? -- Learning Node Label Controlled Graph Grammars (Extended Abstract) -- Inference of Uniquely Terminating EML -- Estimating Graph Parameters Using Graph Grammars -- Learning of Regular ?-Tree Languages -- Inducing Regular Languages Using Grammar-Based Classifier System -- Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems. |
| Record Nr. | UNISA-996465776503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Grammatical Inference: Algorithms and Applications : 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / / edited by Alexander Clark, François Coste, Laurent Miclet
| Grammatical Inference: Algorithms and Applications : 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings / / edited by Alexander Clark, François Coste, Laurent Miclet |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XI, 305 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Artificial intelligence Computer programming Logic, Symbolic and mathematical Computer logic Programming Languages, Compilers, Interpreters Artificial Intelligence Programming Techniques Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-88009-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Papers -- Learning Meaning Before Syntax -- Schema-Guided Induction of Monadic Queries -- A Polynomial Algorithm for the Inference of Context Free Languages -- Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings -- Relevant Representations for the Inference of Rational Stochastic Tree Languages -- Learning Commutative Regular Languages -- Learning Left-to-Right and Right-to-Left Iterative Languages -- Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets -- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness -- On Learning Regular Expressions and Patterns Via Membership and Correction Queries -- State-Merging DFA Induction Algorithms with Mandatory Merge Constraints -- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries -- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata -- Learning Context-Sensitive Languages from Linear Structural Information -- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries -- How to Split Recursive Automata -- A Note on the Relationship between Different Types of Correction Queries -- Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering -- Polynomial Distinguishability of Timed Automata -- Evaluation and Comparison of Inferred Regular Grammars -- Identification in the Limit of k,l-Substitutable Context-Free Languages -- Poster Papers -- Learning Subclasses of Pure Pattern Languages -- Which Came First, the Grammar or the Lexicon? -- Learning Node Label Controlled Graph Grammars (Extended Abstract) -- Inference of Uniquely Terminating EML -- Estimating Graph Parameters Using Graph Grammars -- Learning of Regular ?-Tree Languages -- Inducing Regular Languages Using Grammar-Based Classifier System -- Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems. |
| Record Nr. | UNINA-9910483737003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The handbook of computational linguistics and natural language processing / / edited by Alexander Clark, Chris Fox, and Shalom Lappin
| The handbook of computational linguistics and natural language processing / / edited by Alexander Clark, Chris Fox, and Shalom Lappin |
| Pubbl/distr/stampa | West Sussex, England : , : Wiley-Blackwell, , 2013 |
| Descrizione fisica | 1 online resource (801 p.) |
| Disciplina | 410/.285 |
| Collana | Blackwell Handbooks in Linguistics |
| Soggetto topico |
Computational linguistics
Natural language processing (Computer science) |
| ISBN |
1-118-44867-7
1-282-65431-4 1-78034-233-0 9786612654312 1-118-44866-9 1-4443-3160-4 1-4443-2404-7 1-4443-2405-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
The Handbook of Computational Linguistics and Natural Language Processing; Contents; List of Figures; List of Tables; Notes on Contributors; Preface; Introduction; Part I Formal Foundations; 1 Formal Language Theory; 1 Introduction; 2 Basic Notions; 3 Language Classes and Linguistic Formalisms; 4 Regular Languages; 5 Context-Free Languages; 6 The Chomsky Hierarchy; 7 Mildly Context-Sensitive Languages; 8 Further Reading; 2 Computational Complexity in Natural Language; 1 A Brief Review of Complexity Theory; 2 Parsing and Recognition; 3 Complexity and Semantics
4 Determining Logical Relationships between Sentences3 Statistical Language Modeling; 1 Introduction to Statistical Language Modeling; 2 Structured Language Model; 3 Speech Recognition Lattice Rescoring Using the Structured Language Model; 4 Richer Syntactic Dependencies; 5 Comparison with Other Approaches; 6 Conclusion; 4 Theory of Parsing; 1 Introduction; 2 Context-Free Grammars and Recognition; 3 Context-Free Parsing; 4 Probabilistic Parsing; 5 Lexicalized Context-Free Grammars; 6 Dependency Grammars; 7 Tree Adjoining Grammars; 8 Translation; 9 Further Reading; Part II Current Methods 5 Maximum Entropy Models1 Introduction; 2 Maximum Entropy and Exponential Distributions; 3 Parameter Estimation; 4 Regularization; 5 Model Applications; 6 Prospects; 6 Memory-Based Learning; 1 Introduction; 2 Memory-Based Language Processing; 3 NLP Applications; 4 Exemplar-Based Computational Psycholinguistics; 5 Generalization and Abstraction; 6 Generalizing Examples; 7 Further Reading; 7 Decision Trees; 1 NLP and Classification; 2 Induction of Decision Trees; 3 NLP Applications; 4 Advantages and Disadvantages of Decision Trees; 5 Further Reading 8 Unsupervised Learning and Grammar Induction1 Overview; 2 Computational Learning Theory; 3 Empirical Learning; 4 Unsupervised Grammar Induction and Human Language Acquisition; 5 Conclusion; 9 Artificial Neural Networks; 1 Introduction; 2 Background; 3 Contemporary Research; 4 Further Reading; 10 Linguistic Annotation; 1 Introduction; 2 Review of Selected Annotation Schemes; 3 The Annotation Process; 4 Conclusion; 11 Evaluation of NLP Systems; 1 Introduction; 2 Fundamental Concepts; 3 Evaluation Paradigms in Common Evaluation Settings; 4 Case Study: Evaluation of Word-Sense Disambiguation 5 Case Study: Evaluation of Question Answering Systems6 Summary; Part III Domains of Application; 12 Speech Recognition; 1 Introduction; 2 Acoustic Modeling; 3 Search; 4 Case Study: The AMI System; 5 Current Topics; 6 Conclusions; 13 Statistical Parsing; 1 Introduction; 2 History; 3 Generative Parsing Models; 4 Discriminative Parsing Models; 5 Transition-Based Approaches; 6 Statistical Parsing with CCG; 7 Other Work; 8 Conclusion; 14 Segmentation and Morphology; 1 Introduction; 2 Unsupervised Learning of Words; 3 Unsupervised Learning of Morphology; 4 Implementing Computational Morphologies 5 Conclusions |
| Record Nr. | UNINA-9910140553503321 |
| West Sussex, England : , : Wiley-Blackwell, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The handbook of computational linguistics and natural language processing / / edited by Alexander Clark, Chris Fox, and Shalom Lappin
| The handbook of computational linguistics and natural language processing / / edited by Alexander Clark, Chris Fox, and Shalom Lappin |
| Pubbl/distr/stampa | West Sussex, England : , : Wiley-Blackwell, , 2013 |
| Descrizione fisica | 1 online resource (801 p.) |
| Disciplina | 410/.285 |
| Collana | Blackwell Handbooks in Linguistics |
| Soggetto topico |
Computational linguistics
Natural language processing (Computer science) |
| ISBN |
1-118-44867-7
1-282-65431-4 1-78034-233-0 9786612654312 1-118-44866-9 1-4443-3160-4 1-4443-2404-7 1-4443-2405-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
The Handbook of Computational Linguistics and Natural Language Processing; Contents; List of Figures; List of Tables; Notes on Contributors; Preface; Introduction; Part I Formal Foundations; 1 Formal Language Theory; 1 Introduction; 2 Basic Notions; 3 Language Classes and Linguistic Formalisms; 4 Regular Languages; 5 Context-Free Languages; 6 The Chomsky Hierarchy; 7 Mildly Context-Sensitive Languages; 8 Further Reading; 2 Computational Complexity in Natural Language; 1 A Brief Review of Complexity Theory; 2 Parsing and Recognition; 3 Complexity and Semantics
4 Determining Logical Relationships between Sentences3 Statistical Language Modeling; 1 Introduction to Statistical Language Modeling; 2 Structured Language Model; 3 Speech Recognition Lattice Rescoring Using the Structured Language Model; 4 Richer Syntactic Dependencies; 5 Comparison with Other Approaches; 6 Conclusion; 4 Theory of Parsing; 1 Introduction; 2 Context-Free Grammars and Recognition; 3 Context-Free Parsing; 4 Probabilistic Parsing; 5 Lexicalized Context-Free Grammars; 6 Dependency Grammars; 7 Tree Adjoining Grammars; 8 Translation; 9 Further Reading; Part II Current Methods 5 Maximum Entropy Models1 Introduction; 2 Maximum Entropy and Exponential Distributions; 3 Parameter Estimation; 4 Regularization; 5 Model Applications; 6 Prospects; 6 Memory-Based Learning; 1 Introduction; 2 Memory-Based Language Processing; 3 NLP Applications; 4 Exemplar-Based Computational Psycholinguistics; 5 Generalization and Abstraction; 6 Generalizing Examples; 7 Further Reading; 7 Decision Trees; 1 NLP and Classification; 2 Induction of Decision Trees; 3 NLP Applications; 4 Advantages and Disadvantages of Decision Trees; 5 Further Reading 8 Unsupervised Learning and Grammar Induction1 Overview; 2 Computational Learning Theory; 3 Empirical Learning; 4 Unsupervised Grammar Induction and Human Language Acquisition; 5 Conclusion; 9 Artificial Neural Networks; 1 Introduction; 2 Background; 3 Contemporary Research; 4 Further Reading; 10 Linguistic Annotation; 1 Introduction; 2 Review of Selected Annotation Schemes; 3 The Annotation Process; 4 Conclusion; 11 Evaluation of NLP Systems; 1 Introduction; 2 Fundamental Concepts; 3 Evaluation Paradigms in Common Evaluation Settings; 4 Case Study: Evaluation of Word-Sense Disambiguation 5 Case Study: Evaluation of Question Answering Systems6 Summary; Part III Domains of Application; 12 Speech Recognition; 1 Introduction; 2 Acoustic Modeling; 3 Search; 4 Case Study: The AMI System; 5 Current Topics; 6 Conclusions; 13 Statistical Parsing; 1 Introduction; 2 History; 3 Generative Parsing Models; 4 Discriminative Parsing Models; 5 Transition-Based Approaches; 6 Statistical Parsing with CCG; 7 Other Work; 8 Conclusion; 14 Segmentation and Morphology; 1 Introduction; 2 Unsupervised Learning of Words; 3 Unsupervised Learning of Morphology; 4 Implementing Computational Morphologies 5 Conclusions |
| Record Nr. | UNINA-9910819116303321 |
| West Sussex, England : , : Wiley-Blackwell, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||