RECOGNIZING ANAPHORA REFERENCE IN PERSIAN SENTENCES

Similar documents
Linking Task: Identifying authors and book titles in verbose queries

SINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF)

The stages of event extraction

Memory-based grammatical error correction

BULATS A2 WORDLIST 2

Unit 8 Pronoun References

The Internet as a Normative Corpus: Grammar Checking with a Search Engine

Parsing of part-of-speech tagged Assamese Texts

EdIt: A Broad-Coverage Grammar Checker Using Pattern Grammar

Ch VI- SENTENCE PATTERNS.

Twitter Sentiment Classification on Sanders Data using Hybrid Approach

ScienceDirect. Malayalam question answering system

Chunk Parsing for Base Noun Phrases using Regular Expressions. Let s first let the variable s0 be the sentence tree of the first sentence.

Indian Institute of Technology, Kanpur

Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities

Writing a composition

AQUA: An Ontology-Driven Question Answering System

Disambiguation of Thai Personal Name from Online News Articles

First Grade Curriculum Highlights: In alignment with the Common Core Standards

CS 598 Natural Language Processing

Words come in categories

have to be modeled) or isolated words. Output of the system is a grapheme-tophoneme conversion system which takes as its input the spelling of words,

Emmaus Lutheran School English Language Arts Curriculum

What the National Curriculum requires in reading at Y5 and Y6

BYLINE [Heng Ji, Computer Science Department, New York University,

Using Semantic Relations to Refine Coreference Decisions

Product Feature-based Ratings foropinionsummarization of E-Commerce Feedback Comments

Advanced Grammar in Use

Houghton Mifflin Reading Correlation to the Common Core Standards for English Language Arts (Grade1)

Taught Throughout the Year Foundational Skills Reading Writing Language RF.1.2 Demonstrate understanding of spoken words,

Interactive Corpus Annotation of Anaphor Using NLP Algorithms

Using dialogue context to improve parsing performance in dialogue systems

BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS

The Smart/Empire TIPSTER IR System

Constructing Parallel Corpus from Movie Subtitles

English for Life. B e g i n n e r. Lessons 1 4 Checklist Getting Started. Student s Book 3 Date. Workbook. MultiROM. Test 1 4

A Case Study: News Classification Based on Term Frequency

Developing Grammar in Context

Cross Language Information Retrieval

A Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many

ELD CELDT 5 EDGE Level C Curriculum Guide LANGUAGE DEVELOPMENT VOCABULARY COMMON WRITING PROJECT. ToolKit

Context Free Grammars. Many slides from Michael Collins

ENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist

Target Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data

1 st Quarter (September, October, November) August/September Strand Topic Standard Notes Reading for Literature

The College Board Redesigned SAT Grade 12

Developing a TT-MCTAG for German with an RCG-based Parser

Detecting English-French Cognates Using Orthographic Edit Distance

LQVSumm: A Corpus of Linguistic Quality Violations in Multi-Document Summarization

THE ROLE OF DECISION TREES IN NATURAL LANGUAGE PROCESSING

A Computational Evaluation of Case-Assignment Algorithms

Modeling full form lexica for Arabic

Reading Grammar Section and Lesson Writing Chapter and Lesson Identify a purpose for reading W1-LO; W2- LO; W3- LO; W4- LO; W5-

TABE 9&10. Revised 8/2013- with reference to College and Career Readiness Standards

ARNE - A tool for Namend Entity Recognition from Arabic Text

Word Stress and Intonation: Introduction

Vocabulary Usage and Intelligibility in Learner Language

2/15/13. POS Tagging Problem. Part-of-Speech Tagging. Example English Part-of-Speech Tagsets. More Details of the Problem. Typical Problem Cases

Heuristic Sample Selection to Minimize Reference Standard Training Set for a Part-Of-Speech Tagger

Ensemble Technique Utilization for Indonesian Dependency Parser

Training and evaluation of POS taggers on the French MULTITAG corpus

Multilingual Sentiment and Subjectivity Analysis

University of Alberta. Large-Scale Semi-Supervised Learning for Natural Language Processing. Shane Bergsma

Opportunities for Writing Title Key Stage 1 Key Stage 2 Narrative

Distant Supervised Relation Extraction with Wikipedia and Freebase

SEMAFOR: Frame Argument Resolution with Log-Linear Models

Derivational: Inflectional: In a fit of rage the soldiers attacked them both that week, but lost the fight.

Semi-supervised methods of text processing, and an application to medical concept extraction. Yacine Jernite Text-as-Data series September 17.

Web as Corpus. Corpus Linguistics. Web as Corpus 1 / 1. Corpus Linguistics. Web as Corpus. web.pl 3 / 1. Sketch Engine. Corpus Linguistics

Bootstrapping and Evaluating Named Entity Recognition in the Biomedical Domain

1. Introduction. 2. The OMBI database editor

ELA/ELD Standards Correlation Matrix for ELD Materials Grade 1 Reading

Linguistic Variation across Sports Category of Press Reportage from British Newspapers: a Diachronic Multidimensional Analysis

The Role of the Head in the Interpretation of English Deverbal Compounds

Basic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1

knarrator: A Model For Authors To Simplify Authoring Process Using Natural Language Processing To Portuguese

Author: Fatima Lemtouni, Wayzata High School, Wayzata, MN

POS tagging of Chinese Buddhist texts using Recurrent Neural Networks

Towards a MWE-driven A* parsing with LTAGs [WG2,WG3]

Dear Teacher: Welcome to Reading Rods! Reading Rods offer many outstanding features! Read on to discover how to put Reading Rods to work today!

Introduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.

Development of the First LRs for Macedonian: Current Projects

Sample Goals and Benchmarks

Welcome to the Purdue OWL. Where do I begin? General Strategies. Personalizing Proofreading

Leveraging Sentiment to Compute Word Similarity

System Implementation for SemEval-2017 Task 4 Subtask A Based on Interpolated Deep Neural Networks

Underlying and Surface Grammatical Relations in Greek consider

Loughton School s curriculum evening. 28 th February 2017

Compositional Semantics

THE VERB ARGUMENT BROWSER

Semantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition

Chinese Language Parsing with Maximum-Entropy-Inspired Parser

FOREWORD.. 5 THE PROPER RUSSIAN PRONUNCIATION. 8. УРОК (Unit) УРОК (Unit) УРОК (Unit) УРОК (Unit) 4 80.

Guru: A Computer Tutor that Models Expert Human Tutors

Participate in expanded conversations and respond appropriately to a variety of conversational prompts

South Carolina English Language Arts

Phenomena of gender attraction in Polish *

Rule Learning With Negation: Issues Regarding Effectiveness

Beyond the Pipeline: Discrete Optimization in NLP

CORPUS ANALYSIS CORPUS ANALYSIS QUANTITATIVE ANALYSIS

Transcription:

Pinnacle Research Journals 39 RECOGNIZING ANAPHORA REFERENCE IN PERSIAN SENTENCES ABSTRACT MASIHEH HEDAYAT MOFIDI* *Student, Linguistics Department, Ferdowsi University of Mashhad, Iran. Finding the reference of pronouns in a part of text, which is a type of co-reference resolution, is main task in discourse analysis and also processing language texts. The reference of a pronoun is the noun that is substitute by the pronoun. In this paper, I propose a rule-based method for pronoun reference resolution in Persian texts. Our method use rules to determine the reference of different types of pronouns in a 3-sentences interval. An automatic system of reference resolution is developed based on the proposed method as the first pronoun reference resolution system for the Persian language. The experimental results show allowable accuracy in test cases. In this paper firstly I will describe some problems and challenges in detecting pronoun references and have an overview of related works in this field. After a brief description of the proposed method and the developed system, in the next sections, its features will be described in detail. Then the experimental results will be explained. KEYWORDS: reference, anaphora, sentence. 1. INTRODUCTION Co-reference Resolution refers to recognizing the reference of various entities such as pronouns and proper nouns in a piece of text. In other words it talks about determining which noun phrase is referring to which real world entity mentioned in the text. Co-reference resolution and its variants such as anaphor resolution or pronoun reference resolution usually work outside of a single sentence and so are counted as discourse analysis tasks in natural language processing. They are important tasks in many NLP applications such as machine translation, text understanding, question answering, text summarization, and so forth. Pronoun (anaphora) reference is the noun that is replaced by the pronoun and usually appears somewhere before it. Sometimes a pronoun has no reference; i.e. it appears as a noun, or its reference does not appear directly in the text. Usually, however, pronoun reference appears before the pronoun, and sometimes after it. Thus pronouns usually refer to other words, called their antecedents because they (should) come before the pronoun. A pronoun's antecedent may be a noun or another pronoun, but in either case, it mustbe clear what the antecedent is. The term pronoun reference or anaphora reference describes the relationship between the pronoun and its antecedent. Problems occur when the pronoun s antecedent is unclear or ambiguous. In such cases readers (human or machine) have problem deciding which of two or more earlier nouns a

Pinnacle Research Journals 40 pronoun stands in for, or have difficulty finding any noun at all. There are some differences in anaphora system between Persian and English which cause the need to some new methods for this language. Persian is a null-subject, or pro-drop language, so personal pronouns (e.g. I, he, and she) are optional. Pronouns generally are the same for all cases including nominative, accusative and possessive. The first-person singular accusative pronoun has two regular and short forms (mænrā"me" can be shortened to mærā). Table1 shows the normal form of Persian pronouns. TABLE 1.NORMAL FORM OF PERSIAN PRONOUNS Normal detached Forms Person Singular Plural 1 st mæn ām 2 nd to shomā u (non-human/human) ānha(non-human/human) 3 rd vey (human only and formal) ishān(human only and formal) Possession can be expressed either by normal forms of pronouns or by adding suffixes (genitive enclitics) to nouns. These are added after inflection for number (table 2). TABLE 2. GENITIVE ENCLITICS Genitive enclitics Person Singular Plural 1 st m- æ -emān 2 nd t- æ etān- 3 rd sh- æ -eshān Note that when the stem to which these are added ends in a vowel, a "y" is inserted for ease of pronunciation. There is also neither type of accusative pronouns which can be used in conjunction with verbs to incorporate a direct object (table 3). TABLE 3. ATTACHED ACCUSATIVE PRONOUNS Attached accusative pronouns Person Singular Plural 1 st mæ emān 2 nd tæ etān 3 rd shæ eshān

Pinnacle Research Journals 41 This type usually is used in colloquial speech while using it in written formal texts is not prohibited. For example the translation of the sentence "Yesterday I bought it." In two forms with detached and with attached accusative pronoun are shown in table 4. TABLE 4. EXAMPLE FOR DIRECT OBJECT INCORPORATION Exampl for direct object incorporation diruzanrakharidam diruzkharidæmæsh At last there are 7 reflexive pronouns in Persian; 6 of them for 6 persons (like for English) and the last is person-less pronoun which canbe used instead of all 6 persons and numbers. Table 5 shows the list of these pronouns. TABLE 5. EXAMPLE FOR DIRECT OBJECT INCORPORATION Person 1st 2nd 3rd ALL Reflexive pronouns Singular Khodæm (myself) Khodæt (yourself) Khodæsh (him/her/itself) Khod Plural Khodemæn (ourselves) Khodetæn (yourselves) Khodeshæn (themselves) Persian pronouns are neutral and do not have gender information. In addition there are some exceptions in number agreement between his pronoun and its antecedent. We sometimes use singular pronouns to refer to inanimate plural antecedents and sometimes use plural pronouns to refer to singular antecedents (for respecting). These exceptions cause difficulties in pronoun reference resolution. Generally there are three kinds of problems in recognizing anaphora reference: - Ambiguous Reference: A pronoun reference is ambiguous if it has more than one alternative and the reader cannot easily understand which of the earlier nouns is its real antecedent. - Vague or Indefinite reference: In some cases we use pronouns it or they without mentioning the reference explicitly in the text. In these cases we use these pronouns to refer to unclear entities. - Implied Antecedents: Sometimes the pronoun antecedent is not a noun but a fact implied n a phrase, sentence or a piece of text. In such we wish to refer to the whole idea of the statement. In this paper, we propose a rule-based method for pronoun reference resolution in Persian texts. This method shows some rules to recognize the reference of various types of pronouns in a three sentences interval. An automatic system of reference resolution is developed based on this

Pinnacle Research Journals 42 method. Experimental results show admissible accuracy in test cases which outperforms the other available work. In the rest of the paper, firstly we will describe some problems and challenges in detecting pronoun references and have an overview on the related work in this field. In the next sections, after a short description of the method and the developed system, its features and architecture, its components will be discussed. Then the experimental results and further works to improve the system will be explained. 2. LITERATURE REVIEW Anaphora reference resolution may be done by rule based methods or machine learning approaches. Rule based methods exploits some rules to determine the reference of pronouns. The rules are usually defined manually. On the other side, machine learning algorithms need a training set of texts annotated by pronoun references. This set may be provided manually or semi automatically. In the manual case, the user should first manually labels anaphora reference in some texts. A learning system then generates rules from the training texts. These rules can then be employed to recognize the reference of pronouns from new texts. The main problem with machine learning methods is the lack of training sets in less-studied languages such as Persian. In 2007, Culottaet al. proposed a machine learning method that enables features over sets of noun phrases. They outline a set of approximations that make this approach practical, and apply this method to the ACE co-reference dataset, achieving a 45% error reduction over a comparable method that only considers features of pairs of noun phrases. Denis and Baldridge proposed a supervised ranking approach for pronoun resolution. The ranking enables all candidate antecedents to be evaluated together; whereas classification methods examine at most two candidate antecedents at a time. They showed that their method do the best classification method. In 2004, XiaoqiangLuo and Abe Ittycheriah proposed a new approach for co-reference resolution which uses the Bell tree to represent the search space and casts the co-reference resolution problem as finding the best path from the root of the Bell tree to the leaf nodes. A Maximum Entropy model used to rank these paths. In 2002, Ng and Cardie presented a noun phrase co-reference system that extends the work of Soon et al. (2001). Improvements arise from two sources: changes to the learning framework and a large scale expansion of the feature set to include more sophisticated linguistic knowledge. There is also a work related to Persian anaphora resolution. In 2009, Sadat Moosavi and Ghassem- aniinvestigated approaches to Persian pronoun resolution. They have tested some known methods in the field of classification, machine earning, and ranking on a small set of 90 manually tagged documents randomly taken from Peykareh corpus Bijankhan. The results are at very promising.

Pinnacle Research Journals 43 In most of machine learning works it is assumed that there is a training set to make the system applicable. While there is no such a set available for Persian language and creating a large training set manually is time and cost consuming, in this paper, we propose a rule based method for pronoun reference resolution. Although it is not a complex system, it can be used to develop a training set for machine earning anaphora resolution system. In fact, there is no previous works on rule-based Persian coreference/pronoun resolution. Our proposed rule-based method for Persian coreference resolution has high accuracy and in some cases acts better than machine learning algorithms. We evaluate our proposed method and describe some empirical evaluation in experimental results section in this paper. 3. RESEARCH METHOD In this section we propose a rule based method to determine the pronoun references in a window of three sentences in a Persian text. The architecture of our developed system for Persian Pronoun reference resolution is shown in fig.1. As the fig.1 shows the operational system consists of two main parts; preprocessing and resolution. In preprocessing phase the input text is processed to extract a sequence of POS tagged tokens. To do this first of all we use a tokenizer to recognize the word boundaries in the sentence. Then using a POS tagger we asign a POS tag to each word in the sentence. The small tag set which is used in this system is shown in table 6.After preprocessing the input will be fed into the anaphora resolution subsystem to find the reference of pronouns according to some manually built heuristic rules. The last part is the evaluation module which evaluates the system s performance and decides about changing the rules if needed.

Pinnacle Research Journals 44

Pinnacle Research Journals 45 TABLE 6. THE SMALL TAG SET WHICH USED IN THE SYSTEM AR (Arabic) PRO ( pronoun) POSTP (post preposition) V (verb) ADV. (adverb) P (preposition) PUNC (punctuation) N (noun) CONJ (conjunction) N-PR (proper noun) ADJ (adjective) N-CN ( counting number) By investigating various Persian sentences, we extract some heuristic rules based on which we determine that our input text is similar to which of the rules. Then, we recognize the pronoun reference. The main part of our project is devoted to recognizing accusative pronoun references so that we could determine these references with high accuracy using the extracted rules. As it was seen, first a Persian statement is received in input, and then wetag all of the statement words using POS Tagger. Words tagged in PRO tag are the pronouns whose reference should be determined using manual rules. In this part we show some cases of our heuristic rules which are used for recognizing nominative anaphora references: I. If the pronoun is in the nominative part of second sentence, then antecedent is more probable to be found in the nominative part of first sentence. II. If the pronoun is in the objective part of second sentence, then its reference is more probable to be found in objective part of first sentence. III. If we have pronouns "it" and "he(she)" in a sentence, then pronoun reference of "he(she)" will be a noun that is animate and pronoun reference of "it" is a noun that is inanimate noun in the previous sentence. See the sentence bellow: John saw the book. He bought it. ( Johnketabra did. Ouanrakharid. ). Based onthis rule, the reference of he ( ou ) is John and the pronoun reference of it ( an ) is book. IV. If the pronoun is "they", its antecedent is either a plural noun or some nouns attached by va (and) for example: Reza and Alitook part in an examinationyesterday. They were dissatisfied with the result. ( Ali va Reza diroozdaremtehansherkatkardand.anhaazemtehannarazinabudand.) According to the above rule, the pronoun reference of they ( anha ) is Ali and Reza ( Ali va Reza ).

Pinnacle Research Journals 46 V. If we have pronoun "we" in a sentence, pronoun reference will be Iand with the word which is after it. Example: I and Reza went to Hussein's home. We bought a gift for him. ( manvareza be khaneyehosseinraftim. mabarayeouhediyekharidebudim. ) According to the above rule, the pronoun reference of we ( ma ) is "I and Reza" ( man vareza ). VI. If the pronoun is "there" or here, its reference should be a location or place in previous sentences. The referring place may appear as a location adverb or a noun in a propositional phrase in previous sentences. It may have been tagged by location in previous stages. TABLE 7.A VIEW OF THE PROGRAM Pronouns Reference Input text in Persian POS Tagging We use some other rules that are similar to those above. Our high accuracy in recognizing pronoun (anaphora) reference in Persian sentences is due to our accurate rules. We evaluate our proposed method and describe some empirical evaluation in experimental results art in this paper. In order to find accusative pronoun reference in Persian sentences, we first use a stemmer which determines the attached accusative pronouns (such as his or her ( sh ), my ( am ), etc.) in input Persian text. Then using some heuristic rules similar to the abovementioned rules, we recognize objective pronoun reference with high accuracy. TABLE 8. AN EXAMPLE Determine the pronoun reference: Farshid saw Ali. He took his book. Pronoun reference: Tag 's situation: (part of speech tagging) ST his pronoun reference Farshid N-PR Ali AR ra POSTIP did V ST ketabash N ash P ra POSTP gereft V

Pinnacle Research Journals 47 Analyzing the cause of errors show the factors which decrease the performance of the system: INTRINSIC AMBIGUITIES AND ERRORS IN NATURAL LANGUAGE Ambiguity is a natural characteristic of natural languages. Something is ambiguous when it can be understood in two or more possible senses or ways. The ambiguity may occur in word level (such as lexical ambiguity), in sentence level (such as structural ambiguity or ord sense ambiguity) or in discourse level (such as pronoun reference ambiguity). In the last case even humans may not easily find the reference of a pronoun among the alternatives. ERRORS IN PRE-PROCESSING POS tagger's Accuracy that we used in the preprocessing part is below 95 percent and thus it can cause someerrors in assigning POS tag to each word in the sentence. Wrong POS tagging will result in wrong referenceresolution as the rules are highly dependent to words OS tags. EXCEPTIONS IN HEURISTIC RULES Although we tried to build the heuristic rules as general as possible, in some cases, a rule may result in a wrong output in a specific sentence and this can be a source of error. In the next section we will show the experimental results and compare our work with the other system available for Persian. 4. DATA ANALYSIS This project is done based on the proposed approach, we built a program using C# for recognizing pronoun reference in Persian sentences. We now evaluate our proposed method, and compare it with the machine learning method proposed in. The experimental results are given in Table 1. Below, we first describe some experimental settings and then discuss the results. TEST TEXTS: Five Persian blogger websites are used in our experiments. From each Website, 20 random weblog pages are downloaded. EVALUATION MEASURES: We use the standard precision and recall measures to evaluate the results of system. Table 7 shows the results for the experiment. In this table miss shows the number of cases in which the text contains the pronoun reference, but it is not found and wrong shows the number of cases in which the page has the reference of the pronoun, but a wrong reference is found.

Pinnacle Research Journals 48 TABLE 9. EXPERIMENT RESULTS Blogger Website No. of random pages that is used for test No. of pronoun reference that the text from 20 pages contains it (sum of 20 pages) Our proposed method (Rule-based method) miss wrong Machine Learning method miss wrong 1 Mihanblog.com 20 257 13 12 9 15 2 Persianblog.ir 20 102 5 7 12 8 3 Blogfa.com 20 69 3 8 4 10 4 Iranblog.com 20 196 11 5 10 6 5 Parsiblog.com 20 119 8 2 14 3 Total 100 743 74 91 Table 9 shows the precision and recall of applying two methods (our proposed rule based method and the machine learning method proposed by Moosavi) on the provided test bed. Results show that our method outperforms the only other system available for Persian anaphoraresolution. TABLE 10.COMPARING THE PROPOSED METHOD WITH THE OTHER AVAILABLESYSTEM FOR PERSIAN Our Ruled Based Method: Machine Learning Method: Recall 90 % 87.7 % Precision 95.1 % 92.7 % 5. CONCLUSION This paper proposed a rule-based approach to anaphora reference resolution for Persian texts. Unlike existing methods, the proposedmethod does not perform machine learning to generate rules based on a set of user-labeled training pages. Our algorithm can start anaphora reference resolution from a set of manual extracted rules and either annotate the pronouns by their references or develop a training set for machine learning approaches. At present, the accuracy of our program is over 90% in Persian weblogs texts, as described in the previous part. This accuracy is due to he employed rules. If we increase the number of rules, the

Pinnacle Research Journals 49 accuracy of the program increases. We plan to do this in our future work, especially increasing the objective pronoun reference rules. Combining our method with a machine learning approach to increase the performance is also among our further works. Experimental results with pronoun reference extraction from 100 Persian Weblogs pages show that our proposed approach is highly effective. REFERENCES AronCulotta, MichaelWick, Robert Hall, Andrew McCallum, (2007). First-Order Probabilistic Models for Coreference Resolution.In Proceedings of HLT- AACL. MehrnoushShamsfard, HakimehFadaee, (2008). A Hybrid Morphology-Based POS Tagger for Persian.In Proceedings of 6th Language Resources and valuation Conference (LREC 2008), Morocco. Nafiseh Sadat Moosavi, GholamrezaGhassem-Sani, (2009). A Ranking Approach to Persian Pronoun Resolution", 10 th International Conference on intelligent Text Processing and Computational Linguistics (CICLing 2009), Mexico City, Mexico. Pascal Denis, Jason Baldridge, (2008). Specialized models and ranking for coreference resolution, In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pp. 660-669. Vincent Ng, Claire Cardie, (2002). Improving Machine Learning Approaches to Coreference Resolution, In Proceedings of the 40th Annual Meeting of the association for Computational Linguistics, Association for Computational Linguistics. XiaoqiangLuo, Abe Ittycheriah, (2006). A Mention-Synchronous Coreference Resolution Algorithm Based on the Bell Tree, In Proceedings of the ACL, 004.