{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[16,2,16,3],[17,2,17,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910144343803321"]
[null,null,"Titolo",null,"Grammatical Inference: Algorithms and Applications : 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004. Proceedings / / edited by Georgios Paliouras, Yasubumi Sakakibara"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004"]
[null,null,"ISBN",null,"3-540-30195-X"]
[null,null,"Edizione",null,"[1st ed. 2004.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 296 p.)"]
[null,null,"Collana",null,"Lecture Notes in Artificial Intelligence ; ; 3264"]
[null,null,"Disciplina",null,"005.13/1"]
[null,null,"Soggetti",null,"Programming languages (Electronic computers)"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Logic, Symbolic and mathematical"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Programming Languages, Compilers, Interpreters"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Papers -- Learning and Mathematics -- Learning Finite-State Models for Machine Translation -- The Omphalos Context-Free Grammar Learning Competition -- Regular Papers -- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA -- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation -- Learning Mild Context-Sensitiveness: Toward Understanding Children’s Language Learning -- Learnability of Pregroup Grammars -- A Markovian Approach to the Induction of Regular String Distributions -- Learning Node Selecting Tree Transducer from Completely Annotated Examples -- Identifying Clusters from Positive Data -- Introducing Domain and Typing Bias in Automata Inference -- Analogical Equations in Sequences: Definition and Resolution -- Representing Languages by Learnable Rewriting Systems -- A Divide-and-Conquer Approach to Acquire Syntactic Categories -- Grammatical Inference Using Suffix Trees -- Learning Stochastic Finite Automata -- Navigation Pattern Discovery Using Grammatical Inference -- A Corpus-Driven Context-"]
[{"$nulls":4},"Free Approximation of Head-Driven Phrase Structure Grammar -- Partial Learning Using Link Grammars Data -- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search -- The Boisdale Algorithm – An Induction Method for a Subclass of Unification Grammar from Positive Data -- Learning Stochastic Deterministic Regular Languages -- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data -- Poster Papers -- Learning Syntax from Function Words -- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages -- Extracting Minimum Length Document Type Definitions Is NP-Hard -- Learning Distinguishable Linear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse -- Identifying Left-Right Deterministic Linear Languages -- Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples -- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries."]
[null,null,null,"Sommario/riassunto","The 7th International Colloquium on Grammatical Inference (ICGI 2004) was held in the National Centre for Scientific Research “Demokritos”,Athens,Greece on October 11–13, 2004. ICGI 2004 was the seventh in a series of successful biennial international conferences in the area of grammatical inference. Previous meetings were held in Essex, UK; Alicante, Spain; Montpellier, France; Ames, Iowa, USA; Lisbon, Portugal; and Amsterdam, The Netherlands. This series of conferences seeks to provide a forum for the presentation and discussion of original research papers on all aspects of grammatical inference. Grammatical inference, the study of learning grammars from data, is an established research field in artificial intelligence, dating back to the 1960s, and has been extensively addressed by researchers in automata theory, language acquisition, computational linguistics, machine learning, pattern recognition, computational learning theory and neural networks. ICGI 2004 emphasized the multidisciplinary nature of the research field and the diverse domains in which grammatical inference is being applied, such as natural language acquisition, computational biology, structural pattern recognition, information retrieval, Web mining, text processing, data compression and adaptive intelligent agents. We received 45 high-quality papers from 19 countries. The papers were - viewed by at least two – in most cases three – reviewers. In addition to the 20 full papers, 8 short papers that received positive comments from the reviewers were accepted, and they appear in a separate section of this volume. The topics of the accepted papers vary from theoretical results of learning algorithms to innovative applications of grammatical inference, and from learning several interesting classes of formal grammars to estimations of probabilistic grammars."]