| Autor: |
Yevhen Kostiuk, Obdulia Pichardo-Lagunas, Anton Malandii, Grigori Sidorov |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
PeerJ Computer Science, Vol 9, p e1282 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2376-5992 |
| DOI: |
10.7717/peerj-cs.1282 |
| Popis: |
In this article, we propose a method for the automatic retrieval of a set of semantic primitive words from an explanatory dictionary and a novel evaluation procedure for the obtained set of primitives. The approach is based on the representation of the dictionary as a directed graph with a single-objective constrained optimization problem via a genetic algorithm with the PageRank scoring model. The problem is defined as a subset selection. The algorithm is fit to search for the sets of words that should fulfil several requirements: the cardinality of the set should not exceed empirically selected limits and the PageRank word importance score is minimized with cycle prevention thresholding. In the experiments, we used the WordNet dictionary for English. The proposed method is an improvement over the previous state-of-the-art solutions. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
