Grammatical Inference: Algorithms and Applications 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Adriaans, Pieter (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Fernau, Henning (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Zaanen, Menno van (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Artificial Intelligence ; 2484
• Θέματα: 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.

The Sixth International Colloquium on Grammatical Inference (ICGI2002) was held in Amsterdam on September 23-25th, 2002. ICGI2002 was the sixth in a series of successful biennial international conferenceson the area of grammatical inference. Previous meetings were held in Essex, U.K.; Alicante, Spai...

Πίνακας περιεχομένων:

• 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.