porating these two KSs into our resolver : they can Following Soon et al. ( 2001 ) , we select as the aneach be represented as a constraint or as a feature , tecedent of each NP , NPS , the closest preceding NP and they can be applied to the resolver in isolation that is classified as coreferent with NPS .
a machine learning approach to coreference resolution of noun phrases
W M Soon H T Ng D Lim
Recall that there are eight ways of incorto select an antecedent for each NP in a test text . porating these two KSs into our resolver : they can Following Soon et al. ( 2001 ) , we select as the aneach be represented as a constraint or as a feature , tecedent of each NP , NPS , the closest preceding NP and they can be applied to the resolver in isolation that is classified as coreferent with NPS . If no such and in combination .
porating these two KSs into our resolver : they can Following @@CITATION , we select as the aneach be represented as a constraint or as a feature , tecedent of each NP , NPS , the closest preceding NP and they can be applied to the resolver in isolation that is classified as coreferent with NPS .