We present an algorithm for anaphora resolution which is a modified and extended version of that developed by (Lappin and Leass, 1994). In contrast to that work, our algorithm does not require in-dept...
We present an algorithm for anaphora res- olution which is a modified and extended version of that developed by (Lappin and Leass,/994). In contrast to that work, our al- gorithm does not require in-d...
We present an algorithm for anaphora res- olution which is a modified and extended version of that developed by (Lappin and Leass,/994). In contrast to that work, our al- gorithm does not require in-d...
We present an algorithm for generating referring expressions in open domains. Existing algorithms assume a classification of adjectives which is possible only for restricted domains. Our alternative r...
This paper constitutes a response to Lust & Mazuka's (1989) defence of the Principal Branching Direction parameter and their critique of O'Grady, Suzuki-Wei & Cho's (1986) experiment, which purported ...
This paper presents a new model of anaphoric processing that utilizes the establishment of coherence relations between clauses in a discourse. We sur- vey data that comprises a currently stalemated ar...