Learning Recursive Automata from Positive Examples

Isabelle Tellier 1, 2, *
* Corresponding author
2 MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial grammars. To this aim, we first study how to translate finite state automata into categorial grammars and back. We then show that the generalization operators employed in both domains can be compared, and that their result can always be represented by generalized automata, called "recursive automata". The relation between these generalized automata and categorial grammars is studied in detail. Finally, new learnable subclasses of categorial grammars are defined, for which learning from strings is nearly not more expensive than from structures.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00470101
Contributor : Isabelle Tellier <>
Submitted on : Saturday, April 3, 2010 - 4:07:37 PM
Last modification on : Tuesday, May 21, 2019 - 3:38:12 PM
Long-term archiving on : Monday, July 5, 2010 - 9:21:10 PM

File

RIA06.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Isabelle Tellier. Learning Recursive Automata from Positive Examples. Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2006, New Methods in Machine Learning. Theory and Applications, 20 (6), pp.775-804. ⟨10.3166/ria.20.775-804⟩. ⟨inria-00470101⟩

Share

Metrics

Record views

273

Files downloads

647