A framework of a mechanical translation between Japanese and English by analogy principle
Proc. of the international NATO symposium on Artificial and human intelligence
Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Fast text searching: allowing errors
Communications of the ACM
The String-to-String Correction Problem
Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
On Approximate String Matching
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Pilot implementation of a Bilingual Knowledge Bank
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Paradigmatic cascades: a linguistically sound model of pronunciation by analogy
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
A flexible example-based parser based on the SSTC
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Solving analogies on words: an algorithm
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Learning by analogy: a classification rule for binary and nominal data
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Domain and function: a dual-space model of semantic relations and compositions
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In the Cours de linguistique générale, Saussure mentions a phenomenon of tremendous importance in language, analogy. For example, given the series walk, walked and look, how can we coin the fourth term, looked? We give a possible account of this phenomenon in terms of edition distances, thus paving the way to computational applications. This explanation accounts for prefixing, suffixing and infixing. We show how it is possible to perform the analogical analysis and generation of sentences, using a tree-bank and approximate pattern-matching. As a consequence, our proposal finds its place in the example-based approach to natural language processing.