• DocumentCode
    3028528
  • Title

    Discover hierarchical lexical hyponymy relation from large-scale concept set

  • Author

    Zhou, Jiayu ; Lin, Youfang ; Wang, Shi ; Cao, Cungen

  • Author_Institution
    Sch. of Comput. & Inf. Technol., Beijing Jiaotong Univ., Beijing
  • fYear
    2008
  • fDate
    14-16 Aug. 2008
  • Firstpage
    205
  • Lastpage
    214
  • Abstract
    Lexical hyponymy relation is a kind of hyponymy that can be directly inferred from the lexical compositions of concepts, and of great importance in ontology learning. However, there is a key problem that the lexical hyponymy is so commonsensible that it cannot be discovered by any existing acquisition methods. In this paper, we propose a novel approach to semi-automatically discover hierarchical lexical hyponymy relations from a large-scale concept set, instead of analyzing lexical structures of concepts. Firstly we design Common Suffix Tree (CST) to cluster lexical concepts. We extract class concepts candidates from CST by statistic-base rules that we investigated, and then use a Google-based classifier to verify them. Finally, we extract lexical hyponymy relation candidates from CST and judge them after a prefix clustering process. Experimental result shows us that our approach can correctly discover most lexical hyponymy relations in a given large-scale concept set.
  • Keywords
    computational linguistics; knowledge acquisition; learning (artificial intelligence); ontologies (artificial intelligence); pattern clustering; statistical analysis; tree data structures; vocabulary; Google-based classifier; common suffix tree; hierarchical lexical hyponymy relation discovery; knowledge acquisition method; large-scale concept set; lexical concept clustering; ontology learning; statistic-base rule; Clustering algorithms; Computers; Data mining; Encyclopedias; Information technology; Knowledge acquisition; Knowledge engineering; Large-scale systems; Ontologies; Pattern matching; Common Suffix Tree; Information Extraction; Knowledge Acquisition; Lexical Hyponymy Relation; Suffix Probability Inflexion Rule;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cognitive Informatics, 2008. ICCI 2008. 7th IEEE International Conference on
  • Conference_Location
    Stanford, CA
  • Print_ISBN
    978-1-4244-2538-9
  • Type

    conf

  • DOI
    10.1109/COGINF.2008.4639170
  • Filename
    4639170