Recent Advances of Grammatical Inference

نویسنده

  • Yasubumi Sakakibara
چکیده

In this paper, we provide a survey of recent advances in the field “Grammatical Inference” with a particular emphasis on the results concerning the learnability of target classes represented by deterministic finite automata, context-free grammars, hidden Markov models, stochastic contextfree grammars, simple recurrent neural networks, and case-based representations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Advances in Learning Formal Languages

we present an overview in the advances related to the learning of formal languages i.e. development in the grammatical inference research. The problem of learning correct grammars for the unknown languages is known as grammatical inference. It is considered a main subject of inductive inference, and grammars are important representations to be investigated in machine learning from both theoreti...

متن کامل

Towards General Algorithms for Grammatical Inference

Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of strings, and a set of features or tests that constrain various inference rules. Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin’s famous lstar algorithm and several...

متن کامل

Investigating the relationship among complexity, range, and strength of grammatical knowledge of EFL students

Assessment  of  grammatical  knowledge  is  a  rather  neglected  area  of  research  in  the  field with  many  open  questions  (Purpura,  2004).  The  present  research  incorporates  recent proposals  about  the  nature  of  grammatical  development  to  create  a  framework  consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...

متن کامل

Polynomial characteristic sets for DFA identification

We study the order in Grammatical Inference algorithms, and its influence on the polynomial (with respect to the data) identification of languages. This work is motivated by recent results on the polynomial convergence of data-driven grammatical inference algorithms. In this paper, we prove a sufficient condition that assures the existence of a characteristic sample whose size is polynomial wit...

متن کامل

Current Trends in Grammatical Inference

Grammatical inference has historically found it’s first theoretical results in the field of inductive inference, but it’s first applications in the one of Syntactic and Structural Pattern Recognition. In the mid nineties, the field emancipated and researchers from a variety of communities moved in: Computational Linguistics, Natural Language Processing, Algorithmics, Speech Recognition, Bio-Inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 185  شماره 

صفحات  -

تاریخ انتشار 1997