Refining learning models in grammatical inference

[1]  E. Carterette,et al.  Informal speech : alphabetic & phonemic texts with statistical analyses and tables , 1974 .

[2]  Rajesh Parekh,et al.  An Incremental Interactive Algorithm for Regular Grammar Inference , 1996, AAAI/IAAI, Vol. 2.

[3]  Halit Eren,et al.  An application of artificial neural network for prediction of densities and particle size distributions in mineral processing industry , 1997, IEEE Instrumentation and Measurement Technology Conference Sensing, Processing, Networking. IMTC Proceedings.

[4]  Leona F. Fass,et al.  Learning context-free languages from their structured sentences , 1983, SIGA.

[5]  Qiang Shen,et al.  Fuzzy qualitative simulation , 1993, IEEE Trans. Syst. Man Cybern..

[6]  Jürgen Schmidhuber,et al.  LSTM recurrent networks learn simple context-free and context-sensitive languages , 2001, IEEE Trans. Neural Networks.

[7]  Enrique Vidal,et al.  Identification of DFA: data-dependent vs data-independent algorithms , 1996, ICGI.

[8]  Paul Rodríguez,et al.  Simple Recurrent Networks Learn Context-Free and Context-Sensitive Languages by Counting , 2001, Neural Computation.

[9]  Yuji Takada.  Grammatical Interface for Even Linear Languages Based on Control Sets , 1988, Inf. Process. Lett..

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

[11]  Cynthia Dwork,et al.  A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata , 1990, SIAM J. Comput..

[12]  Yasubumi Sakakibara,et al.  Recent Advances of Grammatical Inference , 1997, Theor. Comput. Sci..

[13]  Robert McNaughton,et al.  Parenthesis Grammars , 1967, JACM.

[14]  C. Chang.  The development of autonomy in preschool mandarin chinese-speaking children's play narratives , 1998 .

[15]  Christopher D. Manning,et al.  The unsupervised learning of natural language structure , 2005 .

[16]  Jürgen Schmidhuber,et al.  Long Short-Term Memory , 1997, Neural Computation.

[17]  Jeffrey Shallit,et al.  Automaticity I: Properties of a Measure of Descriptional Complexity , 1996, J. Comput. Syst. Sci..

[18]  Esko Ukkonen,et al.  Pattern Discovery in Biosequences , 1998, ICGI.

[19]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[20]  Adrian Walker,et al.  On the Inference of Stochastic Regular Grammars , 1978, Inf. Control..

[21]  Erkki Mäkinen.  The Grammatical Inference Problem for the Szilard Languages of Linear Grammars , 1990, Inf. Process. Lett..

[22]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[23]  T. Yokomori.  "Learning simple languages in polynomial time," Japanese Society for Artificial Inteligence , 1988 .

[24]  Xiao-Jun Zeng,et al.  Approximation accuracy analysis of fuzzy systems as function approximators , 1996, IEEE Trans. Fuzzy Syst..

[25]  C. M. Cook,et al.  Grammatical inference by hill climbing , 1976, Inf. Sci..

[26]  James Jay Horning,et al.  A study of grammatical inference , 1969 .

[27]  C. Lee Giles,et al.  Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks , 1992, Neural Computation.

[28]  Pieter W. Adriaans,et al.  The EMILE 4.1 Grammar Induction Toolbox , 2002, ICGI.

[29]  Rusins Freivalds,et al.  Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines , 1990, MFCS.

[30]  Dana Angluin,et al.  When won't membership queries help? , 1991, STOC '91.

[31]  Yasuhiro Tajima,et al.  Polynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample , 2000 .

[32]  Peter Stagge,et al.  Recurrent neural networks for time series classification , 2003, Neurocomputing.

[33]  Ray J. Solomonoff,et al.  A new method for discovering the grammars of phrase structure languages , 1959, IFIP Congress.

[34]  Ye-Yi Wang,et al.  Grammar learning for spoken language understanding , 2001, IEEE Workshop on Automatic Speech Recognition and Understanding, 2001. ASRU '01..

[35]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[36]  Daniel Marcu,et al.  Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences , 2003, NAACL.

[37]  José-Miguel Benedí,et al.  RNA Modeling by Combining Stochastic Context-Free Grammars and n-Gram Models , 2002, Int. J. Pattern Recognit. Artif. Intell..

[38]  Frederick Jelinek,et al.  Statistical methods for speech recognition , 1997 .

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

[40]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[41]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[42]  Dan Klein,et al.  A Generative Constituent-Context Model for Improved Grammar Induction , 2002, ACL.

[43]  Colin de la Higuera,et al.  Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality , 2000, ICML.

[44]  R. M. Wharton.  Grammar Enumeration and Inference , 1977, Inf. Control..

[45]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[46]  Alexander Clark.  Unsupervised induction of stochastic context-free grammars using distributional clustering , 2001, CoNLL.

[47]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[48]  Ian H. Witten,et al.  Identifying Hierarchical Structure in Sequences: A linear-time algorithm , 1997, J. Artif. Intell. Res..

[49]  Stefano Crespi-Reghizzi,et al.  An Effective Model for Grammar Interference , 1971, IFIP Congress.

[50]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[51]  Janet Wiles,et al.  Context-free and context-sensitive dynamics in recurrent neural networks , 2000, Connect. Sci..

[52]  Pedro García,et al.  Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations , 2002, ICGI.

[53]  Steve Young,et al.  Applications of stochastic context-free grammars using the Inside-Outside algorithm , 1990 .

[54]  C. Lee Giles,et al.  Constructing deterministic finite-state automata in recurrent neural networks , 1996, JACM.

[55]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

[57]  J. Baker.  Trainable grammars for speech recognition , 1979 .

[58]  Anke Rieger.  Inferring probabilistic automata from sensor data for robot navigation , 1999 .

[59]  Sheng Yu,et al.  Minimal cover-automata for finite languages , 1998, Theor. Comput. Sci..

[60]  R. C. Underwood,et al.  Stochastic context-free grammars for tRNA modeling. , 1994, Nucleic acids research.

[61]  Kenneth Basye,et al.  Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning , 2004, Machine Learning.

[62]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[63]  Dana Angluin,et al.  Queries and concept learning , 1988, Machine Learning.

[64]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, CACM.

[65]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[66]  Juan Miguel Vilar.  Query learning of subsequential transducers , 1996, ICGI.

[67]  Jeffrey L. Elman,et al.  Finding Structure in Time , 1990, Cogn. Sci..

[68]  Rajesh Parekh,et al.  A Polynominal Time Incremental Algorithm for Learning DFA , 1998, ICGI.

[69]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[70]  Ah Chung Tsoi,et al.  Noisy Time Series Prediction using Recurrent Neural Networks and Grammatical Inference , 2001, Machine Learning.

[71]  Halit Eren,et al.  Use of artificial neural networks in estimation of Hydrocyclone parameters with unusual input variables , 1996, Quality Measurement: The Indispensable Bridge between Theory and Reality (No Measurements? No Science! Joint Conference - 1996: IEEE Instrumentation and Measurement Technology Conference and IMEKO Tec.

[72]  Enrique Vidal,et al.  What Is the Search Space of the Regular Inference? , 1994, ICGI.

[73]  James J. Horning,et al.  A Procedure for Grammatical Inference , 1971, IFIP Congress.

[74]  Aravind K. Joshi,et al.  Skeletal Structural Descriptions , 1978, Inf. Control..

[75]  Jonas Kuhn.  Experiments in parallel-text based grammar induction , 2004, ACL.

[76]  B. MacWhinney.  The CHILDES project: tools for analyzing talk , 1992 .

[77]  Naoki Abe,et al.  Predicting Protein Secondary Structure Using Stochastic Tree Grammars , 1997, Machine Learning.

[78]  Stefan C. Kremer,et al.  Beyond EDSM , 2002, ICGI.

[79]  Lillian Lee,et al.  Learning of Context-Free Languages: A Survey of the Literature , 1996 .

[80]  Dana Angluin,et al.  A Note on the Number of Queries Needed to Identify Regular Languages , 1981, Inf. Control..

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

[82]  José Oncina,et al.  The Data Driven Approach Applied to the OSTIA Algorithm , 1998, ICGI.

[83]  Encarna Segarra,et al.  On the Use of the Morphic Generator Grammatical Inference (MGGI) Methodology in Automatic speech Recognition , 1990, Int. J. Pattern Recognit. Artif. Intell..

[84]  Rens Bod,et al.  An All-Subtrees Approach to Unsupervised Parsing , 2006, ACL.

[85]  Mark Levene,et al.  Data Mining of User Navigation Patterns , 1999, WEBKDD.

[86]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications, Third Edition , 1997, Texts in Computer Science.

[87]  Jürgen Schmidhuber,et al.  Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM , 2002, Neural Computation.

[88]  Barak A. Pearlmutter,et al.  Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm , 1998, ICGI.

[89]  E. Carterette,et al.  Redundancy in children's free-reading choices , 1963 .

[90]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

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

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

[93]  Joaquim Gabarró Vallès,et al.  Uniform characterizations of non-uniform complexity measures , 1985 .

[94]  Dana Angluin.  Negative results for equivalence queries , 1990, Mach. Learn..

[95]  Dennis Shasha,et al.  New Techniques for DNA Sequence Classification , 1999, J. Comput. Biol..

[96]  Boris Chidlovskii.  Wrapper generation by -reversible grammar induction , 2000 .

[97]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[98]  Juergen Schmidhuber,et al.  Long Short-Term Memory Learns Context Free and Context Sensitive Languages , 2000 .

[99]  Colin de la Higuera,et al.  A bibliographical study of grammatical inference , 2005, Pattern Recognit..