摘要: This paper describes new set covering algorithms associated with the DISCRETE edit system. is based on Fellegi-Holt model (JASA 1976) of editing. A implicit-edit generation algorithm replaces Garfinkel, Kunnathur, and Liepins (Operations Research 1986) Winkler (1995). The set-covering correctly generate implicit edits for large subclasses reduce computation during by as much two orders magnitude.