Non-directionality and self-assessment in an example-based system using genetic algorithms

Authors:
Yves Lepage
Affiliations:
Universiti Sains Malaysia, Penang, Malaysia
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Year:
1994

Citing 6
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
The String-to-String Correction Problem

Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Toward memory-based translation

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Pilot implementation of a Bilingual Knowledge Bank

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Representation trees and string-tree correspondences

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show the application of an optimisation technique to natural language processing: genetic algorithms, thanks to the definition of a data structure called board and a formal distance. The system has two interesting features: non-directionality, which is more than bidirectionality, and self-assessment, independently of the inner knowledge. Results of experiments are presented and discussed.