| J02-3003 | continuity is not a concern for | anaphora resolution algorithms | . Kameyama ( 1993 , 1998 ) was |
| J02-3003 | dictated by needs specific to | anaphora resolution algorithms | . Centering was not originally |
| E03-1025 | the performance gap between the | anaphora resolution algorithm | using the various parsers narrowed |
| I05-2016 | plan library . An overview of the | anaphora resolution algorithm | is shown in Figure 3 . When the |
| E99-1006 | Strube Abstract Most existing | anaphora resolution algorithms | are designed to account only |
| C96-1021 | prestigious of CeNT 's 23 halls . " The | anaphora resolution algorithm | generates the following analysis |
| J02-3003 | structurally . Regarding centering-based | anaphora resolution algorithms | , which seem the best candidates |
| E99-1006 | annotation as key for the abstract | anaphora resolution algorithm | . Table 6 shows the results of |
| E03-1025 | the Lappin and Leass ( 1994 ) | anaphora resolution algorithm | . This produces a second ranking |
| J02-3003 | between our approach and related | anaphora resolution algorithms | is in the treatment of subordinate |
| E03-1025 | 40 % ( 13 ) of the errors the | anaphora resolution algorithm | made a mistake with all the parsers |
| E03-1025 | narrowed . This may be due to the | anaphora resolution algorithm | making use of only certain instances |
| C96-1021 | Quantitative evaluation shows the | anaphora resolution algorithm | described here to run at a rate |
| J02-3003 | the two mechanisms in a single | anaphora resolution algorithm | . Next , we discuss some remaining |
| C02-1027 | pre-processing , needed as an input to the | anaphora resolution algorithm | : sentence , paragraph and clause |
| D09-1144 | implementation of a more advanced | anaphora resolution algorithm | treating pronominal as well as |
| J02-3003 | motivated and/or corpus-based | anaphora resolution algorithms | have been built with more or |
| J01-4001 | is how far the performance of | anaphora resolution algorithms | can go and what the limitations |
| J02-3003 | for N units , Ui = 1 ... N , the | anaphora resolution algorithm | starts at the last identified |
| E03-1025 | different antecedents suggested by the | anaphora resolution algorithm | using the various parsers ( Table |
