Rémi Eyraud
Centre national de la recherche scientifique
31 Papers
168 Citations
Rémi Eyraud is an academic researcher from Centre national de la recherche scientifique. The author has contributed to research in topics: Grammar induction & Computer science. The author has an hindex of 12, co-authored 31 publications. Previous affiliations of Rémi Eyraud include Aix-Marseille University & Jean Monnet University.
Chat about Author
Papers
Learning Auxiliary Fronting with Grammatical Inference
Alexander Clark,Rémi Eyraud +1 more
- 08 Jun 2006
TL;DR: This article presented a simple context-free grammatical inference algorithm, and proved that it is capable of learning an interesting subclass of context free languages, and also demonstrated that an implementation of this algorithm is able to learn auxiliary fronting in polar interrogatives (AFIPI) in English.
Output Strictly Local Functions
Jane Chandlee,Rémi Eyraud,Jeffrey Heinz +2 more
- 01 Jul 2015
TL;DR: This paper characterizes a subclass of subsequential string-to-string functions called Output Strictly Local and presents a learning algorithm which provably learns any OSL function in polynomial time and data.
•Proceedings Article
Results of the PAutomaC Probabilistic Automaton Learning Competition
Sicco Verwer,Rémi Eyraud,Colin de la Higuera +2 more
- 16 Aug 2012
TL;DR: The purpose of this paper is to provide an overview of the implementation details of PAutomaC and to report the results of the competition.
Learning Auxiliary Fronting with Grammatical Inference
Alexander Clark,Rémi Eyraud +1 more
- 01 Jan 2006
TL;DR: It is demonstrated that learning can proceed even in the complete absence of examples of particular constructions, and thus that debates about the frequency of occurrence of such constructions are irrelevant.
Identification in the limit of substitutable context-free languages
Alexander Clark,Rémi Eyraud +1 more
- 08 Oct 2005
TL;DR: This paper formalisms the idea of substitutability introduced by Zellig Harris in the 1950s and makes it the basis for a learning algorithm from positive data only for a subclass of context-free grammars, and shows that there is a polynomial characteristic set, and thus provesPolynomial identification in the limit of this class.
20