Constructing a word similarity graph from vector based word representation for named entity recognition
In this paper, we discuss a method for identifying a seed word that would best represent a class of named entities in a graphical representation of words and their similarities. Word networks, or word graphs, are representations of vectorized text where nodes are the words encountered in a corpus, a...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2018
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/3405 https://animorepository.dlsu.edu.ph/context/faculty_research/article/4407/type/native/viewcontent/0006926201660171.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | In this paper, we discuss a method for identifying a seed word that would best represent a class of named entities in a graphical representation of words and their similarities. Word networks, or word graphs, are representations of vectorized text where nodes are the words encountered in a corpus, and the weighted edges incident on the nodes represent how similar the words are to each other. Word networks are then divided into communities using the Louvain Method for community detection, then betweenness centrality of each node in each community is computed. The most central node in each community represents the most ideal candidate for a seed word of a named entity group which represents the community. Our results from our bilingual data set show that words with similar lexical content, from either language, belong to the same community. Copyright © 2018 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved |
|---|