Scholarlink

Artificial intelligence methods for performing a query in search engines require effective solution of the task of automatic processing of texts in the database. One of the important tasks of implementing machine learning is the development of a rule system. This article discusses the problem of coreference calculated from preliminary studies aimed at automatic determination of meaningful distances expressed in Uzbek language texts. Basic rules and stages of solving the coreference problem are also analyzed. Explanations of a number of terms such as anaphoric relations and their main types, the main used anaphora, antecedent, cataphora, clustering, singleton, etc., which create the coreference problem, are given.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Problem of Coreference in NLP

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Utlir Khamdamov,
  • Elov Botir,
  • Axmedova Xolisxon,
  • Abdisalomova Shahlo,
  • Rakhimova Bekposhsha,
  • Hamroqulova Marjona

摘要

Artificial intelligence methods for performing a query in search engines require effective solution of the task of automatic processing of texts in the database. One of the important tasks of implementing machine learning is the development of a rule system. This article discusses the problem of coreference calculated from preliminary studies aimed at automatic determination of meaningful distances expressed in Uzbek language texts. Basic rules and stages of solving the coreference problem are also analyzed. Explanations of a number of terms such as anaphoric relations and their main types, the main used anaphora, antecedent, cataphora, clustering, singleton, etc., which create the coreference problem, are given.