Analogical Equations in Sequences: Definition and Resolution
Lecture notes in computer sciencePublished 1 January 2004Open access
Arnaud Delhay, Laurent Miclet
Citations9
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work presents 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.
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.
Keywords
Computer Science
Journal of the ACMThe String-to-String Correction Problem
3,063 Citations1974Robert A. Wagner, Michael J. Fischer
An algorithm is presented which solves the string-to-string correction problem in time proportional to the product of the lengths of the two strings.
The Theory of Parsing, Translation, and Compiling
1,411 Citations1972Alfred V. Aho, Jeffrey D. Ullman
It is the hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing.
Automata and Computability
284 Citations1977Dexter Kozen
Although this course considers plenty of concrete examples and applications of these models, it will work primarily in terms of their mathematical properties, and the author will always be as explicit as possible about these properties.
Automata and Computability
230 Citations1997Dexter Kozen
This introduction to the basic theoretical models of computability develops their rich and varied structure and culminates in discussions of effective computability, decidability, and Godel's incompleteness theorems.
Solving analogies on words
87 Citations1998Yves Lepage
The algorithm presented in this paper takes a path that is inverse to the historical development of the idea of analogy, which is necessary, because a certain incomprehension is faced when speaking about linguistic analogy.
Electronic Notes in Theoretical Computer ScienceAnalogy and Formal Languages
78 Citations2004Yves Lepage
It is argued that some preliminary “good properties” obtained may plead in favour of the use of analogy in the study of formal languages in relationship with natural language.
Saussurian analogy
22 Citations1996Yves Lepage, Ando Shin-ichi
It is shown how it is possible to perform the analogical analysis and generation of sentences, using a tree-bank and approximate pattern-matching, and finds its place in the example-based approach to natural language processing.
HAL (Le Centre pour la Communication Scientifique Directe)Relation d'analogie et distance sur un alphabet défini par des traits
17 Citations2004Laurent Miclet, Arnaud Delhay
Analogy on Sequences : a Definition and an Algorithm
2 Citations2003Laurent Miclet, Arnaud Delhay
The definition of analogy on sequences is presented 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.