A bottom-up efficient algorithm learning substitutable languages from positive examples - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

A bottom-up efficient algorithm learning substitutable languages from positive examples

(1) , (1) , (1)
1

Abstract

Based on Harris’s substitutability criterion, the recent definitions of classes of substitutable languages have led to interesting polynomial learnability results for expressive formal languages. These classes are also promising for practical applications: in natural language analysis, because definitions have strong linguisitic support, but also in biology for modeling protein families, as suggested in our previous study introducing the class of local substitutable languages. But turning recent theoretical advances into practice badly needs truly practical algorithms. We present here an efficient learning algorithm, motivated by intelligibility and parsing efficiency of the result, which directly reduces the positive sample into a small non-redundant canonical grammar of the target substitutable language. Thanks to this new algorithm, we have been able to extend our experimentation to a complete protein dataset confirming that it is possible to learn grammars on proteins with high specificity and good sensitivity by a generalization based on local substitutability.
Not file

Dates and versions

hal-01080249 , version 1 (04-11-2014)

Identifiers

  • HAL Id : hal-01080249 , version 1

Cite

François Coste, Gaelle Garet, Jacques Nicolas. A bottom-up efficient algorithm learning substitutable languages from positive examples. ICGI (International Conference on Grammatical Inference), Sep 2014, Kyoto, Japan. pp.49--63. ⟨hal-01080249⟩
153 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More