Some well-known approaches include rule-based models ( Brill and Resnik 1994 ) , backed-off models ( Collins and Brooks 1995 ) , and a maximumentropy model ( Ratnaparkhi 1998 ) .
a rule based approach to pp attachment disambiguation
Eric Brill Philip S Resnik
Researchers have proposed many computational models for resolving PPattachment ambiguities . Some well-known approaches include rule-based models ( Brill and Resnik 1994 ) , backed-off models ( Collins and Brooks 1995 ) , and a maximumentropy model ( Ratnaparkhi 1998 ) . Following the tradition of using learning PPattachment as a way to gain insight into the parsing problem , we first apply sample selection to reduce the amount of annotation used in training a PP-attachment model .
Some well-known approaches include rule-based models ( @@CITATION ) , backed-off models ( Collins and Brooks 1995 ) , and a maximumentropy model ( Ratnaparkhi 1998 ) .