Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Verification Method of Hyponymy between Chinese Terms Based on Concept Space

  • Conference paper
Active Media Technology (AMT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5820))

Included in the following conference series:

  • 1349 Accesses

Abstract

Hyponymy is a basic semantic relation. There are still many error relations in the automatic acquired hyponymy relations from free text. They will affect the building of ontologies. We present an iterative method of hyponymy verification between Chinese terms based on concept space. We give the definition of concept space about a group of candidate hyponymy relations initially. Then a set of hyponymy features based on concept space are acquired. These features are changed into production rules. Finally the candidate hyponymy relations are iterative verified with those production rules. Experimental results demonstrate good performance of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Beeferman, D.: Lexical discovery with an enriched semantic network. In: Proceedings of the Workshop on Applications of WordNet in Natural Language Processing Systems, ACL/COLING, pp. 358–364 (1998)

    Google Scholar 

  2. Cao, C., Shi, Q.: Acquiring Chinese Historical Knowledge from Encyclopedic Texts. In: Proceedings of the International Conference for Young Computer Scientists, pp. 1194–1198 (2001)

    Google Scholar 

  3. Hearst, M.A.: Automated Discovery of WordNet Relations. In: Fellbaum, C. (ed.) WordNet: An Electronic Lexical Database and Some of its Applications, pp. 131–153. MIT Press, Cambridge (1998) (to appear)

    Google Scholar 

  4. Maedche, A., Pekar, V., Staab, S.: Ontology Learning Part One—On Discovering Taxonomic Relations from the Web. In: Web Intelligence, pp. 301–322. Springer, Heidelberg (2002)

    Google Scholar 

  5. Caraballo, S.A.: Automatic construction of a hypernym-labeled noun hierarchy from text. In: Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pp. 120–126 (1999)

    Google Scholar 

  6. Maedche, A., Pekar, V., Staab, S.: Ontology Learning Part One—On Discovering Taxonomic Relations from the Web. In: Web Intelligence, pp. 301–322. Springer, Heidelberg (2002)

    Google Scholar 

  7. Sánchez, D., Moreno, A.: Patterned automatic taxonomy learning from the Web. AI Communications 21(3), 27–48 (2008)

    MathSciNet  MATH  Google Scholar 

  8. Elghamry, K.: Using the Web in Building a Corpus-Based Hypernymy-Hyponymy Lexicon with Hierarchical Structure for Arabic. Faculty of Computers and Information, pp. 157–165 (2008)

    Google Scholar 

  9. Zhang, C.-x., Hao, T.-y.: The State of the Art and Difficulties in Automatic Chinese Word Segmentation. Journal Of System Simulation 17(1), 138–143 (2005)

    Google Scholar 

  10. Mei, J.J., Zhu, Y.M., Gao, Y.Q., Yin, H.X.: Tongyici Cilin (Dictionary of Synonymous Words). Shanghai Cishu Publisher, China (1983)

    Google Scholar 

  11. Tian, G., Cao, C., Liu, L., Wang, H.: MFC: A Method of Co-referent Relation Acquisition from Large-scale Chinese Corpora. In: ICNC 2006-FSKD 2006, Xi’an, China (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, L., Zhang, S., Diao, L.H., Yan, S.Y., Cao, C.G. (2009). A Verification Method of Hyponymy between Chinese Terms Based on Concept Space. In: Liu, J., Wu, J., Yao, Y., Nishida, T. (eds) Active Media Technology. AMT 2009. Lecture Notes in Computer Science, vol 5820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04875-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04875-3_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04874-6

  • Online ISBN: 978-3-642-04875-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics