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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lepage, Y.: De l’analogie rendant compte de la commutation en linguistique, Grenoble, Habilitation à diriger les recherches (2003)
Lepage, Y., Ando, S.I.: Saussurian analogy: a theoretical account and its application. In: Proceedings of COLING 1996, København, pp. 717–722 (1996)
Hofstadter, D.: The Fluid Analogies Research Group: Fluid Concepts and Creative Analogies. Basic Books, New York (1994)
Miclet, L., Delhay, A.: Analogy on sequences: a definition and an algorithm. Technical Report 4969, INRIA (2003)
Aho, A., Ullman, J.: The Theory of Parsing, Translation and Compiling, Parsing, vol. 1. Prentice-Hall, Englewood Cliffs (1972)
Wagner, R., Fischer, M.: The string-to-string correction problem. JACM (1974)
Crochemore, M., et al.: Algorithmique du texte. Vuibert (2001)
Sankoff, D., Kruskal, J., eds.: Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparison. Addidon-Wesley (1983)
Rowland, T.: Group. Technical report, Mathworld, Wolfram (2004), http://mathworld.wolfram.com/Group.html
Miclet, L., Delhay, A.: Relation d’analogie et distance sur un alphabet défini par des traits. Technical Report 5244, INRIA (2004) (in French)
Stroppa, N., Yvon, F.: Analogie dans les séquences: un solveur à états finis. In: TALN 2004 (2004)
Roche, E., Schabes, Y.: Introduction to finite-state devices in natural language processing. MIT Press, Cambridge (1997)
Lepage, Y.: Solving analogies on words: an algorithm. In: Proceedings of COLINGACL 1998, Montréal, vol. 1, pp. 728–735 (1998)
Lepage, Y.: Analogy and formal languages. In: Proceedings of FG/MOL 2001, Helsinki, pp. 373–378 (2001)
Yvon, F.: Analogy-based NLP: Implementation issues. Technical report, Ecole Nationale Supérieure des Télécommunications (2003)
Sakarovitch, J.: Eléments de théorie des automates. Vuibert (2003)
Kozen, D.: Automata and Computability. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delhay, A., Miclet, L. (2004). Analogical Equations in Sequences: Definition and Resolution. In: Paliouras, G., Sakakibara, Y. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2004. Lecture Notes in Computer Science(), vol 3264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30195-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30195-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23410-4
Online ISBN: 978-3-540-30195-0
eBook Packages: Springer Book Archive