A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Graph based keyword extraction approaches represent the text document as a graph with the words as vertices. An edge between two vertices exists only if the corresponding words are related. The effectiveness of the graph representation is dependent on how the relationship is defined between two words. Early approaches used word order, word co-occurrence and syntactic relationships. Recent graph representation approaches are using lexical association measures for defining relationship betweendoi:10.22266/ijies2017.1031.17 fatcat:wy62i6nukfdc3l7aikp55sdhou