Resumen:
In this paper we provide techniques to integrate WordNet into a Fuzzy Logic Programming System. Because WordNet relates words but does not give graded information of the relation between them, we have implemented standard similarity measures and new directives that allow us to generate the proximity equations linking two words with an approximation degree. Proximity equations are the key syntactic structures that, in addition to a weak unification algorithm, make possible a flexible query answering process in this kind of programming languages.
Descargas:
La descarga de este artículo ha sido restringida por el autor
Ver la referencia en formato Bibtex
@inproceedings{prole:2019:001,
title={{Integrating WordNet into Bousi~Prolog (Work in Progress)}},
author={Pascual Julian-Iranzo and Fernando Saenz-Perez},
url={http://hdl.handle.net/11705/PROLE/2019/001},
booktitle={PROLE2019},
year={2019},
publisher={SISTEDES},
crossref={prole2019caceres}
}
@proceedings{prole2019caceres,
title={{Actas de las XIX Jornadas de Programaci{\'o}n y Lenguajes (PROLE 2019)}},
editor={Alpuente, M., Sapi{\~n}a, J. y Rodr{\'i}guez Echeverr{\'i}a, R.},
booktitle={PROLE2019},
year={2019},
publisher={SISTEDES}
}
Copiar al portapapeles |
Cerrar