Machine Learning Approach for Resolving Pronominal Anaphora Using Hindi Dependency Treebank
نویسندگان
چکیده
Machine Learning facilitates the computers to mimic human intelligence by applying a set of rules to massive amounts of trained data and identifying patterns to make decisions and adapt based on what patterns are still uncovered. A number of applications ranging from spam detection, facial recognition, product recommendations to credit-card fraud detection, all of them apply machine learning procedures. The focus is on presenting machine learning approach for resolving anaphora’s in Hindi Sentences. The availability of Dependency Treebank for Hindi has motivated many researchers to explore and exploit its information for natural language processing such as anaphora resolution. Capturing the Treebank generated by a parser has been seen as a key element in resolving anaphora. An attempt is to show how the part-of-speech (POS) tagging, chunking and morphological information generated by the Hindi parser in the form of Hindi Dependency Treebank (henceforth HDT) can be used to derive rules for resolving Hindi anaphora and implementing the same in machine learning. The steps for resolution of pronominal anaphora are based on the syntactic cue provided by the HDT.
منابع مشابه
Exploring Semantic Information from Hindi Dependency Treebank for Resolving Pronominal Anaphora
Anaphora Resolution is exigent task in almost all NLP applications such as text summarization, machine translation, information extraction, question-answering systems, etc. A lot of work has been done for identifying and still more need to be done for finding the factors responsible for resolving the anaphoras in all languages. An attempt has been made to resolve Hindi pronominal anaphora using...
متن کاملPronominal Reference Type Identification and Event Anaphora Resolution for Hindi
In this paper, we present hybrid approaches for pronominal reference type (abstract or concrete) identification and event anaphora resolution for Hindi. Pronominal reference type identification is one of the important parts for any anaphora resolution system as it helps anaphora resolver in optimal feature selection based on pronominal reference types. We use language specific rules and feature...
متن کاملAnaphora Annotation in Hindi Dependency TreeBank
In this paper, we propose a scheme for anaphora annotation in Hindi Dependency Treebank. The goal is to identify and handle the challenges that arise in the annotation of reference relations in Hindi. We identify some of the issues related to anaphora annotation specific to Hindi such as distribution of markable span, sequential annotation, representation format, annotation of multiple referent...
متن کاملComparison of Classification and Ranking Approaches to Pronominal Anaphora Resolution in Czech
In this paper we compare two Machine Learning approaches to the task of pronominal anaphora resolution: a conventional classification system based on C5.0 decision trees, and a novel perceptron-based ranker. We use coreference links annotated in the Prague Dependency Treebank 2.0 for training and evaluation purposes. The perceptron system achieves f-score 79.43% on recognizing coreference of pe...
متن کاملApplication of Pronominal Divergence and Anaphora Resolution in English-Hindi Machine Translation
So far the majority of Machine Translation (MT) research has focused on translation at the level of individual sentences. For sentence level translation, Machine Translation has addressed various divergence issues for large variety of languages; the issue of pronominal divergence has been presented only recently. Since the quality of translation as required by users follows coherent multi-sente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015