Skip to main content
Conference Proceedings

Analogical equations in sequences: Definition and resolution

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (2004) 3264 127-138
DOI: 10.1007/978-3-540-30195-0_12
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a definition of analogy on sequences which is based on two principles: the definition of an analogy between the letters of an alphabet and the use of the edit distance between sequences. Our definition generalizes the algorithm given by Lepage and is compatible with another definition of analogy in sequences given by Yvon. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Delhay, A., & Miclet, L. (2004). Analogical equations in sequences: Definition and resolution. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3264, pp. 127–138). Springer Verlag. https://doi.org/10.1007/978-3-540-30195-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free