Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
A crucial challenge for improving EMLs is to provide an intuitive notation to support educational practitioners to not only understand, but also describe a large number of flexibl...
Anne Lejeune, Muriel Ney, Armin Weinberger, Margus...
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
This paper reports on Korean Word Associations (KorWA) which were collected to construct a semantic network for Korean language. An approach of graph representation and network an...
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...