Factor and subsequence kernels and signatures of rational languages

  • Authors:
  • Ahmed Amarni;Sylvain Lombardy

  • Affiliations:
  • Laboratoire d'informatique Gaspard-Monge, University Paris-Est Marne-la-Vallée, France;Laboratoire d'informatique Gaspard-Monge, University Paris-Est Marne-la-Vallée, France

  • Venue:
  • CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The kernels are popular methods to measure the similarity between words for classification and learning. We generalize the definition of rational kernels in order to apply kernels to the comparison of languages. We study this generalization for factor and subsequence kernels and prove that these kernels are defined for parameters chosen in an appropriate interval. We give different methods to build weighted transducers which compute these kernels.