Abstract. The paper argues that a promising way to improve the suc-cess rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MARS- a program for auto-matic resolution of pronominal anaphors and describes an experiment which we have conducted to optimise the success rate of MARS with the help of a genetic algorithm. After the optimisation we noted an improve-ment up to 8 % for some les. The results obtained after optimisation are discussed.
We present an evaluation of three anaphora resolution algorithms – GuiTAR, JavaRAP and MARS – based ...
This paper presents a simple mechanism for the resolution of anaphora in limited domain natural lang...
1 Abstract In this paper we will present an evaluation of current state-of-the-art algorithms for An...
Abstract. This paper describes a new, advanced and completely re-vamped version of Mitkov's kno...
This paper describes a new, advanced and completely revamped version of Mitkov's knowledge-poor appr...
Anaphora resolution is a central topic in dialogue and discourse that deals with finding the referen...
Abstract. Despite some promising early approaches, neural networks have by now received comparativel...
This paper describes a novel technique for resolving pronouns in natural language. A common approach...
In the last years, much effort went into the design of robust anaphor resolution algorithms. Many al...
Anaphora resolution is the problem of resolving references of pronouns to antecedents (previously me...
This paper presents the results of research undertaken on anaphora resolution achieved by partially-...
Anaphora resolution has proven to be a very difficult problem of natural language processing, and it...
This paper discusses the comparative evaluation of five well-known pronoun resolution algorithms con...
In the majority of cases, the pronoun it illustrates nominal anaphora, tending to refer back to anot...
Abstract This chapter summarizes the most influential non-statistical approaches to anaphora resolut...
We present an evaluation of three anaphora resolution algorithms – GuiTAR, JavaRAP and MARS – based ...
This paper presents a simple mechanism for the resolution of anaphora in limited domain natural lang...
1 Abstract In this paper we will present an evaluation of current state-of-the-art algorithms for An...
Abstract. This paper describes a new, advanced and completely re-vamped version of Mitkov's kno...
This paper describes a new, advanced and completely revamped version of Mitkov's knowledge-poor appr...
Anaphora resolution is a central topic in dialogue and discourse that deals with finding the referen...
Abstract. Despite some promising early approaches, neural networks have by now received comparativel...
This paper describes a novel technique for resolving pronouns in natural language. A common approach...
In the last years, much effort went into the design of robust anaphor resolution algorithms. Many al...
Anaphora resolution is the problem of resolving references of pronouns to antecedents (previously me...
This paper presents the results of research undertaken on anaphora resolution achieved by partially-...
Anaphora resolution has proven to be a very difficult problem of natural language processing, and it...
This paper discusses the comparative evaluation of five well-known pronoun resolution algorithms con...
In the majority of cases, the pronoun it illustrates nominal anaphora, tending to refer back to anot...
Abstract This chapter summarizes the most influential non-statistical approaches to anaphora resolut...
We present an evaluation of three anaphora resolution algorithms – GuiTAR, JavaRAP and MARS – based ...
This paper presents a simple mechanism for the resolution of anaphora in limited domain natural lang...
1 Abstract In this paper we will present an evaluation of current state-of-the-art algorithms for An...