APPLICATION OF HOBBS’S ALGORITHM TO UZBEK TEXTS

Authors

DOI:

https://doi.org/10.69691/yf1tnb09

Keywords:

Hobbs algorithm, pronoun, anaphora, antecedent, tag, parse tree, conjunction

Abstract

This article discusses the problem of solving coreference related to pronouns, the advantages and disadvantages of using the Hobbs algorithm to solve it. It also describes the specific features of the Hobbs algorithm and instructions for its use. The algorithm is applied to Uzbek texts and its working principle is studied.

Author Biography

  • Nasiba Jumaqulova

    Master’s degree student of

    the Tashkent state university of the uzbek language

    and literature  named after Alisher Navoi

References

Elova D.Q. O‘zbek tili matnlarida koreferensiyani hal qilish bosqichlari. / “Kompyuter lingvistikasi: muammolar, yechim, istiqbollar” xalqaro ilmiy-amaliy konferensiya materiallari, Vol 1, № 01 (2023), 156-161-b.

Hojiyev A. Tilshunoslik terminlarining izohli lug‘ati. – Toshkent, 2002.

Primova M. Til korpuslarida matnlarni annotatsiyalash: afzallik va kamchiliklari. / O‘zbekiston: til va madaniyat, 2023 Vol. 4 (6), 6-18-betlar.

https://uz.m.wiktionary.org/wiki

Abjalova M. Korpus birliklarini teglash va annotatsiyalash masalasi. / “Zamonaviy ilm-fan va ta’lim istiqbollari” Respublika ko‘p tarmoqli ilmiy-amaliy konferensiyasi to‘plami, Vol. 1, Issue 2, 2023. – 345-351-betlar.

Abdullayeva O. O‘zbek tili matnlarida sintaktik teg va teglash masalasi. / O‘zbekiston: til va madaniyat, 2023 Vol. 1 (6), 46-57-betlar.

Downloads

Published

2024-10-30

Issue

Vol. 11 No. 62 (2024): journal THE LIGHT OF CIVILIZATION

Section

10.00.00 - Philology

License

Copyright (c) 2024 Journal of Tamaddun Nuri

Creative Commons License

This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

How to Cite

APPLICATION OF HOBBS’S ALGORITHM TO UZBEK TEXTS. (2024). Journal of Tamaddun Nuri, 11(62), 348-351. https://doi.org/10.69691/yf1tnb09