Grammatikalische Schlussfolgerung: Theoretische Ergebnisse und Anwendung - Taschenbuch NEU Jos?? - Taschenbuch

EAN (ISBN-13): 9783642154874
ISBN (ISBN-10): 3642154875
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer Berlin
316 Seiten
Gewicht: 0,508 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-07-17T17:29:51+02:00 (Berlin)
Buch zuletzt gefunden am 2025-12-22T11:09:03+01:00 (Berlin)
ISBN/EAN: 9783642154874

ISBN - alternative Schreibweisen:
3-642-15487-5, 978-3-642-15487-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: sempere, sempe, sempé, jose garcia, semper, von pedro, josé garcía
Titel des Buches: grammatica, international colloquium, results, valencia, grammatical

---

Daten vom Verlag:

Autor/in: José Sempere; Pedro García
Titel: Lecture Notes in Artificial Intelligence; Lecture Notes in Computer Science; Grammatical Inference: Theoretical Results and Applications - 10th International Colloquium, ICGI 2010, Valencia, Spain, September 13-16, 2010. Proceedings
Verlag: Springer; Springer Berlin
317 Seiten
Erscheinungsjahr: 2010-09-03
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XI, 317 p. 47 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Natürliche Sprachen und maschinelle Übersetzung; Verstehen; Informatik; Ada; MDL; Software Engineering; algorithms; bioinformatics; classification; complexity; computational linguistics; dna computing; grammar induction; graph languages; learning algorithms; multidimensional languages; neural networks; quantum computing; algorithm analysis and problem complexity; Natural Language Processing (NLP); Artificial Intelligence; Theory of Computation; Automated Pattern Recognition; Algorithms; Computer Vision; Künstliche Intelligenz; Theoretische Informatik; Mustererkennung; Algorithmen und Datenstrukturen; Maschinelles Sehen, Bildverstehen; EA

Invited Talks.- Grammatical Inference and Games: Extended Abstract.- Molecules, Languages and Automata.- Regular Papers.- Inferring Regular Trace Languages from Positive and Negative Samples.- Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher.- Learning Context Free Grammars with the Syntactic Concept Lattice.- Learning Automata Teams.- Exact DFA Identification Using SAT Solvers.- Learning Deterministic Finite Automata from Interleaved Strings.- Learning Regular Expressions from Representative Examples and Membership Queries.- Splitting of Learnable Classes.- PAC-Learning Unambiguous k,l-NTS??? Languages.- Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars.- CGE: A Sequential Learning Algorithm for Mealy Automata.- Using Grammar Induction to Model Adaptive Behavior of Networks of Collaborative Agents.- Transducer Inference by Assembling Specific Languages.- Sequences Classification by Least General Generalisations.- A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data.- A Local Search Algorithm for Grammatical Inference.- Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries.- Grammatical Inference as Class Discrimination.- Short Papers.- MDL in the Limit.- Grammatical Inference Algorithms in MATLAB.- A Non-deterministic Grammar Inference Algorithm Applied to the Cleavage Site Prediction Problem in Bioinformatics.- Learning PDFA with Asynchronous Transitions.- Grammar Inference Technology Applications in Software Engineering.- Hölder Norms and a Hierarchy Theorem for Parameterized Classes of CCG.- Learning of Church-Rosser Tree Rewriting Systems.- Generalizing over Several Learning Settings.-Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us.- Extracting Shallow Paraphrasing Schemata from Modern Greek Text Using Statistical Significance Testing and Supervised Learning.- Learning Subclasses of Parallel Communicating Grammar Systems.- Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages.- Learning Fuzzy Context-Free Grammar—A Preliminary Report.- Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers.
Unique visibility State-of-the-art survey Fast-track conference proceedings