IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v63y2012i10p2087-2099.html
   My bibliography  Save this article

Entity disambiguation using semantic networks

Author

Listed:
  • Jorge H. Román
  • Kevin J. Hulin
  • Linn M. Collins
  • James E. Powell

Abstract

A major stumbling block preventing machines from understanding text is the problem of entity disambiguation. While humans find it easy to determine that a person named in one story is the same person referenced in a second story, machines rely heavily on crude heuristics such as string matching and stemming to make guesses as to whether nouns are coreferent. A key advantage that humans have over machines is the ability to mentally make connections between ideas and, based on these connections, reason how likely two entities are to be the same. Mirroring this natural thought process, we have created a prototype framework for disambiguating entities that is based on connectedness. In this article, we demonstrate it in the practical application of disambiguating authors across a large set of bibliographic records. By representing knowledge from the records as edges in a graph between a subject and an object, we believe that the problem of disambiguating entities reduces to the problem of discovering the most strongly connected nodes in a graph. The knowledge from the records comes in many different forms, such as names of people, date of publication, and themes extracted from the text of the abstract. These different types of knowledge are fused to create the graph required for disambiguation. Furthermore, the resulting graph and framework can be used for more complex operations.

Suggested Citation

  • Jorge H. Román & Kevin J. Hulin & Linn M. Collins & James E. Powell, 2012. "Entity disambiguation using semantic networks," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 63(10), pages 2087-2099, October.
  • Handle: RePEc:bla:jamist:v:63:y:2012:i:10:p:2087-2099
    DOI: 10.1002/asi.22672
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.22672
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asi.22672?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamist:v:63:y:2012:i:10:p:2087-2099. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.