We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
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 consider here the problem of building a never-ending language learner; that is, an intelligent computer agent that runs forever and that each day must (1) extract, or read, inf...
Andrew Carlson, Justin Betteridge, Bryan Kisiel, B...
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...