Welcome to the InfoSci Platform
Learning Hierarchical Lexical Hyponymy

Learning Hierarchical Lexical Hyponymy

Jiayu Zhou, Shi Wang, Cungen Cao
Copyright: © 2012 |Pages: 15
ISBN13: 9781466617438|ISBN10: 1466617438|EISBN13: 9781466617445
DOI: 10.4018/978-1-4666-1743-8.ch015
Cite Chapter Cite Chapter

MLA

Zhou, Jiayu, et al. "Learning Hierarchical Lexical Hyponymy." Developments in Natural Intelligence Research and Knowledge Engineering: Advancing Applications, edited by Yingxu Wang, IGI Global, 2012, pp. 205-219. https://doi.org/10.4018/978-1-4666-1743-8.ch015

APA

Zhou, J., Wang, S., & Cao, C. (2012). Learning Hierarchical Lexical Hyponymy. In Y. Wang (Ed.), Developments in Natural Intelligence Research and Knowledge Engineering: Advancing Applications (pp. 205-219). IGI Global. https://doi.org/10.4018/978-1-4666-1743-8.ch015

Chicago

Zhou, Jiayu, Shi Wang, and Cungen Cao. "Learning Hierarchical Lexical Hyponymy." In Developments in Natural Intelligence Research and Knowledge Engineering: Advancing Applications, edited by Yingxu Wang, 205-219. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-4666-1743-8.ch015

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.