Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access

    ARTICLE

    Employing Lexicalized Dependency Paths for Active Learning of Relation Extraction

    Huiyu Sun*, Ralph Grishman

    Intelligent Automation & Soft Computing, Vol.34, No.3, pp. 1415-1423, 2022, DOI:10.32604/iasc.2022.030794 - 25 May 2022

    Abstract Active learning methods which present selected examples from the corpus for annotation provide more efficient learning of supervised relation extraction models, but they leave the developer in the unenviable role of a passive informant. To restore the developer’s proper role as a partner with the system, we must give the developer an ability to inspect the extraction model during development. We propose to make this possible through a representation based on lexicalized dependency paths (LDPs) coupled with an active learner for LDPs. We apply LDPs to both simulated and real active learning with ACE as evaluation More >

  • Open Access

    ARTICLE

    Lexicalized Dependency Paths Based Supervised Learning for Relation Extraction

    Huiyu Sun*, Ralph Grishman

    Computer Systems Science and Engineering, Vol.43, No.3, pp. 861-870, 2022, DOI:10.32604/csse.2022.030759 - 09 May 2022

    Abstract Log-linear models and more recently neural network models used for supervised relation extraction requires substantial amounts of training data and time, limiting the portability to new relations and domains. To this end, we propose a training representation based on the dependency paths between entities in a dependency tree which we call lexicalized dependency paths (LDPs). We show that this representation is fast, efficient and transparent. We further propose representations utilizing entity types and its subtypes to refine our model and alleviate the data sparsity problem. We apply lexicalized dependency paths to supervised learning using the More >

Displaying 1-10 on page 1 of 2. Per Page