Redirigiendo al acceso original de articulo en 22 segundos...
ARTÍCULO
TITULO

Modification of the graph method for automatic abstraction tasks taking into account synonymy

Irina Polyakova    
Igor Zaitsev    

Resumen

The article discusses existing approaches to automatic text abstracting. The creation of an abstract obviously requires an understanding of the text at the level of pragmatics. However, at the moment, reliable semantic analysis is still not available for computers, especially not the analysis of pragmatics. Widespread methods based on neural networks can take into account semantics thanks to special vector representations of words. But the rest of the automatic referencing methods rely on morphology and syntax. However, part of the semantics is still available to them - there are thesauruses and networks, as well as algorithms that allow you to establish a semantic connection between individual words, such as their semantic similarity, in particular, synonymy. A method is proposed that takes into account the semantic similarity of words. A modification of the graph method has been developed that takes into account synonymy and allows for a better abstract. The basic and modified versions of the graph method are implemented programmatically for automatic referencing tasks, taking into account synonymy. The comparison of their quality in Russian and English texts using automatic evaluation metrics of abstracts is carried out. The evaluation results show an improvement in the modified graph method compared to the usual one, especially in Russian-language texts.

 Artículos similares

       
 
Andrii Morozov,Tamara Loktikova,Iurii Iefremov,Anatolii Dykyi,Pavlo Zabrodskyy     Pág. 21 - 28
By advancing the idea of finding width in bipartite graphs and basic definitions in matching theory, this paper shows that the task on establishing a maximal matching in an arbitrary graph can be reduced to its bipartite case. It has been proven that eac... ver más

 
Charles A. Phillips, Kai Wang, Erich J. Baker, Jason A. Bubier, Elissa J. Chesler and Michael A. Langston    
Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modificatio... ver más
Revista: Algorithms

 
Edyta Kucharska    
The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the process. The presented approach is based on the al... ver más
Revista: Applied Sciences

 
Boguslaw Michalec    
In the current study, the applicability of the Annandale method was verified based on the results of silting and sediment distribution measurements carried out in eight small reservoirs, with a capacity that does not exceed 5 million m3. It was found tha... ver más
Revista: Water