The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Learning Hierarchical Lexical Hyponymy
Abstract
Chinese information processing is a critical step toward cognitive linguistic applications like machine translation. Lexical hyponymy relation, which exists in some Eastern languages like Chinese, is a kind of hyponymy that can be directly inferred from the lexical compositions of concepts, and of great importance in ontology learning. However, a key problem is that the lexical hyponymy is so commonsense that it cannot be discovered by any existing acquisition methods. In this paper, we systematically define lexical hyponymy relationship, its linguistic features and propose a computational approach to semi-automatically learn hierarchical lexical hyponymy relations from a large-scale concept set, instead of analyzing lexical structures of concepts. Our novel approach discovered lexical hyponymy relation by examining statistic features in a Common Suffix Tree. The experimental results show that our approach can correctly discover most lexical hyponymy relations in a given large-scale concept set.
Related Content
|
Hemalatha J. J., Bala Subramanian Chokkalingam, Vivek V., Sekar Mohan.
© 2023.
14 pages.
|
|
R. Muthuselvi, G. Nirmala.
© 2023.
12 pages.
|
|
Jerritta Selvaraj, Arun Sahayadhas.
© 2023.
16 pages.
|
|
Vidhya R., Sandhia G. K., Jansi K. R., Nagadevi S., Jeya R..
© 2023.
8 pages.
|
|
Shanthalakshmi Revathy J., Uma Maheswari N., Sasikala S..
© 2023.
13 pages.
|
|
Uma N. Dulhare, Shaik Rasool.
© 2023.
29 pages.
|
|
R. Nareshkumar, G. Suseela, K. Nimala, G. Niranjana.
© 2023.
22 pages.
|
|
|