• DocumentCode
    1955781
  • Title

    A marker-passing algorithm for reference resolution

  • Author

    Cha, Seungho ; Moldovan, Dan I.

  • Author_Institution
    Parallel Knowledge Process. Lab., Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    1993
  • fDate
    8-11 Nov 1993
  • Firstpage
    250
  • Lastpage
    257
  • Abstract
    Reference is an important phenomenon in natural language, and it has been addressed by many researchers. Though a local focus constitutes an important information used in reference resolution, the previous focusing approaches fail to resolve some references due to several problems. The authors present a marker-passing algorithm and some experimental results. Reference resolution is carried out based on the premise that the most active concept which is acceptable syntactically and semantically as a referent is the referent. By defining the activeness of each concept and propagating activeness to related concepts, these problems are avoided. Referability is defined based on constraints and activeness and is used to compute the referent. This model has been implemented on SNAP (Semantic Network Array Processor) simulator, and it shows a 90.2% success rate in various definite references on a set of 100 news articles
  • Keywords
    computational linguistics; natural languages; SNAP; Semantic Network Array Processor; marker-passing algorithm; natural language; news articles; referability; reference resolution; referent; Computational modeling; Computer networks; Laboratories;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Tools with Artificial Intelligence, 1993. TAI '93. Proceedings., Fifth International Conference on
  • Conference_Location
    Boston, MA
  • ISSN
    1063-6730
  • Print_ISBN
    0-8186-4200-9
  • Type

    conf

  • DOI
    10.1109/TAI.1993.633964
  • Filename
    633964