Skip to Main content Skip to Navigation
Conference papers

A Lattice of Sets of Alignments Built on the Common Subword in a Finite Language

Laurent Miclet 1 Nelly Barbot 2 Baptiste Jeudy 3
1 Dyliss - Dynamics, Logics and Inference for biological Systems and Sequences
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
2 CORDIAL - Human-machine spoken dialogue
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes, ENSSAT - École Nationale Supérieure des Sciences Appliquées et de Technologie
Abstract : We define the locally maximal subwords and locally minimal superwords common to a finite set of words. We also define the corresponding sets of alignments. We give a partial order relation between such sets of alignments, as well as two operations between them. We show that the constructed family of sets of alignments has the lattice structure. We give hints to use this structure as a machine learning basis for inducing a generalization of the set of words.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00726166
Contributor : Baptiste Jeudy Connect in order to contact the contributor
Submitted on : Wednesday, August 29, 2012 - 10:31:41 AM
Last modification on : Tuesday, October 19, 2021 - 11:58:55 PM

Identifiers

  • HAL Id : hal-00726166, version 1

Citation

Laurent Miclet, Nelly Barbot, Baptiste Jeudy. A Lattice of Sets of Alignments Built on the Common Subword in a Finite Language. International Conference on Grammatical Inference, Sep 2012, United States. pp.164-176. ⟨hal-00726166⟩

Share

Metrics

Record views

447