Anaphora resolution for Arabic machine translation :
نام عام مواد
[Thesis]
نام نخستين پديدآور
Hamouda, Wafya
عنوان اصلي به قلم نويسنده ديگر
a case study of nafs
وضعیت نشر و پخش و غیره
نام ناشر، پخش کننده و غيره
University of Newcastle Upon Tyne
تاریخ نشرو بخش و غیره
2014
یادداشتهای مربوط به پایان نامه ها
جزئيات پايان نامه و نوع درجه آن
Thesis (Ph.D.)
امتياز متن
2014
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
In the age of the internet, email, and social media there is an increasing need for processing online information, for example, to support education and business. This has led to the rapid development of natural language processing technologies such as computational linguistics, information retrieval, and data mining. As a branch of computational linguistics, anaphora resolution has attracted much interest. This is reflected in the large number of papers on the topic published in journals such as Computational Linguistics. Mitkov (2002) and Ji et al. (2005) have argued that the overall quality of anaphora resolution systems remains low, despite practical advances in the area, and that major challenges include dealing with real-world knowledge and accurate parsing. This thesis investigates the following research question: can an algorithm be found for the resolution of the anaphor nafs in Arabic text which is accurate to at least 90%, scales linearly with text size, and requires a minimum of knowledge resources? A resolution algorithm intended to satisfy these criteria is proposed. Testing on a corpus of contemporary Arabic shows that it does indeed satisfy the criteria.
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )