Grammatical Inference: Learning Syntax from Sentences
Springer Berlin (Verlag)
978-3-540-61778-5 (ISBN)
The 25 revised full papers contained in the book together with two invited key papers by Magerman and Knuutila were carefully selected for presentation at the conference. The papers are organized in sections on algebraic methods and algorithms, natural language and pattern recognition, inference and stochastic models, incremental methods and inductive logic programming, and operational issues.
Learning grammatical structure using statistical decision-trees.- Inductive inference from positive data: from heuristic to characterizing methods.- Unions of identifiable families of languages.- Characteristic sets for polynomial grammatical inference.- Query learning of subsequential transducers.- Lexical categorization: Fitting template grammars by incremental MDL optimization.- Selection criteria for word trigger pairs in language modeling.- Clustering of sequences using a minimum grammar complexity criterion.- A note on grammatical inference of slender context-free languages.- Learning linear grammars from structural information.- Learning of context-sensitive language acceptors through regular inference and constraint induction.- Inducing constraint grammars.- Introducing statistical dependencies and structural constraints in variable-length sequence models.- A disagreement count scheme for inference of constrained Markov networks.- Using knowledge to improve N-Gram language modelling through the MGGI methodology.- Discrete sequence prediction with commented Markov models.- Learning k-piecewise testable languages from positive data.- Learning code regular and code linear languages.- Incremental regular inference.- An incremental interactive algorithm for regular grammar inference.- Inductive logic programming for discrete event systems.- Stochastic simple recurrent neural networks.- Inferring stochastic regular grammars with recurrent neural networks.- Maximum mutual information and conditional maximum likelihood estimations of stochastic regular syntax-directed translation schemes.- Grammatical inference using Tabu Search.- Using domain information during the learning of a subsequential transducer.- Identification of DFA: Data-dependent versus data-independent algorithms.
| Erscheint lt. Verlag | 16.9.1996 |
|---|---|
| Reihe/Serie | Lecture Notes in Artificial Intelligence | Lecture Notes in Computer Science |
| Zusatzinfo | X, 334 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 447 g |
| Themenwelt | Informatik ► Theorie / Studium ► Compilerbau |
| Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik | |
| Schlagworte | Algorithmisches Lernen • algorithms • Automatische Spracherkennung • Automatische Übersetzung • Computational Learning • Computerlinguistik • Formale Grammatik • formale Sprachen • Formal Languages • Grammatical Inference • Grammatik • Grammatische Inferenz • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • learning • Logic • Machine Translation • Maschinelles Übersetzen • NATURAL • natural language • programming • Speech Recognition • Spracherkennung • Syntax |
| ISBN-10 | 3-540-61778-7 / 3540617787 |
| ISBN-13 | 978-3-540-61778-5 / 9783540617785 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
