{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:57:24Z","timestamp":1649206644405},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[1994,6]]},"abstract":"<jats:p> Reference is a linguistic process by which a speaker\/ writer denotes an entity. It is an important phenomenon in natural language, and it has been addressed by many researchers. A local focus constitutes important information used in reference resolution; however, the previous focusing approaches fail to resolve some references due to several problems. This paper presents a marker-passing solution and some experimental results. Reference resolution is carried out based on the premise that \u201cthe most active concept acceptable syntactically and semantically as a referent is the referent.\u201d Referability is defined based on constraints and activeness to be used to compute the correct referent. This model has been implemented on a marker-passing simulator, and it shows 92.2% success rate and better performance than previous approaches in a set of arbitrarily chosen 100 news articles. <\/jats:p>","DOI":"10.1142\/s021821309400011x","type":"journal-article","created":{"date-parts":[[2004,11,19]],"date-time":"2004-11-19T02:21:13Z","timestamp":1100830873000},"page":"209-231","source":"Crossref","is-referenced-by-count":0,"title":["A MARKER-PASSING ALGORITHM FOR REFERENCE RESOLUTION"],"prefix":"10.1142","volume":"03","author":[{"given":"SEUNGHO","family":"CHA","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Southern California, Los Angeles, CA 90089, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAN","family":"MOLDOVAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX 75275\u20130122, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021821309400011X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:16:07Z","timestamp":1565147767000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021821309400011X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1994,6]]}},"alternative-id":["10.1142\/S021821309400011X"],"URL":"https:\/\/doi.org\/10.1142\/s021821309400011x","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}