SciELO - Scientific Electronic Library Online

 
vol.25 número1Why is the Least Square Error Method Dangerous?Analog Algorithms with Discontinuous States and Non-Unique Evolution Operators: Computability and Stability índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Não possue artigos similaresSimilares em SciELO

Compartilhar


Computación y Sistemas

versão On-line ISSN 2007-9737versão impressa ISSN 1405-5546

Resumo

HERNANDEZ CASIMIRO, Yanet; LEDENEVA, Yulia; GARCIA HERNANDEZ, René Arnulfo  e  RAMOS CORCHADO, Marco Antonio. Lexical Patterns Based on Maximal Frequent Secuences for Automatic Keyphrase Extraction. Comp. y Sist. [online]. 2021, vol.25, n.1, pp.153-163.  Epub 13-Set-2021. ISSN 2007-9737.  https://doi.org/10.13053/cys-25-1-3868.

This paper presents a method for the automatic keyphrase extraction task using lexical patterns. First, the patterns are obtained from a set of data and converted into regular expression search patterns, allowing to consider sequences of characters that define a phrase without depending on its syntactic or semantic characteristics and thus obtain a list of possible candidates. Besides, to select the best, only those that obtained a high weight will be considered, in the following four weights: Boolean (B), Precision (P), Recall (R), and F-Measure (F); which corresponds to the result obtained from each evaluated pattern, therefore a list is generating of the best 5,10 and 15 keyphrases for each document. The evaluation of the method was realized by length (L) and combination (C), where the combination takes the best candidates for each length (1 to 4). The method was tested in corpus of scientific articles using the SemEval-2010 data set for task 5.

Palavras-chave : Lexical patterns; key phrases; automatic key phrase extraction; maximal frequent sequences.

        · texto em Inglês     · Inglês ( pdf )