Learning Recursive Automata from Positive Examples

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. R

• Type: Journal
• Year: 2006
• Where: RIA
• Authors: Isabelle Tellier
• Keywords: Categorial Grammars, Nous, Que Le, RIA 2006