{'fraction_non_alphanumeric': 0.022556390977443608, 'fraction_numerical': 0.0009398496240601503, 'mean_word_length': 5.15606936416185, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Graph-based Keyphrase Extraction Using Word and Document Em beddings*

With the increasing amount of text data in applications, the task of keyphrase extraction receives more attention that aims to extract concise and important information from a document. In this paper, we propose a novel graph-based keyphrase extraction method using word and document embedding vectors. Two graph construction schemes named GKE-w and GKE-p are designed in which candidate words and phrases are represented as nodes respectively. By calculating the similarity between a word/phrase and the document, each node is assigned an initial weight that reflects the preference to be a keyphrase. Then, we calculate the score of each candidate word/phrase using a semantic biased random walk strategy. Finally, the Top N scored candidate phrases are selected as the final keyphrases. Experiments on two widely used datasets show that the proposed keyphrase extraction algorithm outperforms the state-of-the-art keyphrase extraction methods in terms of precision, recall, and F1 measures.