Grammatical Inference: Algorithms and Applications

A technique to infer finite-state transducers is proposed in this work. This technique is based on the formal relations between finitestate transducers and regular grammars. The technique consists of: 1) building a corpus of training strings from the corpus of training pairs; 2) inferring a regular grammar and 3) transforming the grammar into a finite-state transducer. The proposed method was assessed through a series of experiments within the framework of the EuTrans project.

[1]  Martti Juhola,et al.  Syntactic recognition of ECG signals by attributed finite automata , 1995, Pattern Recognit..

[2]  Alfred Ultsch Knowledge Extraction from Self-Organizing Neural Networks , 1993 .

[3]  R. T. L. Allen Investigation and diagnosis , 1993 .

[4]  G. Guimar Temporal Knowledge Discovery for Multivariate Time Series with Enhanced Self-organizing Maps , 2000 .

[5]  Sanjay Jain Learning Concepts Incrementally with Bounded Data Mining 3 , 1997 .

[6]  Kevin J. Lang Random DFA's can be approximately learned from sparse uniform examples , 1992, COLT '92.

[7]  Samuel Kaski,et al.  Monitoring EEG Signal with the Self-Organizing Map , 1993 .

[8]  Alfred Ultsch,et al.  A Method for Temporal Knowledge Conversion , 1999, IDA.

[9]  T. Kohonen,et al.  Exploratory Data Analysis by the Self-Organizing Map: Structures of Welfare and Poverty in the World , 1996 .

[10]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[11]  J. Oncina,et al.  INFERRING REGULAR LANGUAGES IN POLYNOMIAL UPDATED TIME , 1992 .

[12]  Hiroshi Sakamoto,et al.  Language Learning from Membership Queries and Characteristic Examples , 1995, ALT.

[13]  Yasubumi Sakakibara,et al.  Efficient Learning of Context-Free Grammars from Positive Structural Examples , 1992, Inf. Comput..

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[15]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[16]  Leonard Pitt,et al.  Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..

[17]  Yasubumi Sakakibara,et al.  Learning context-free grammars from structural data in polynomial time , 1988, COLT '88.

[18]  Ah Chung Tsoi,et al.  Rule inference for financial prediction using recurrent neural networks , 1997, Proceedings of the IEEE/IAFE 1997 Computational Intelligence for Financial Engineering (CIFEr).

[19]  T. Penzel,et al.  Design of an Ambulatory Sleep Apnea Recorder , 1991, [1991 Proceedings] Case Studies in Medical Instrument Design.