One would then union together the candidates from each of the two groups into two different views, e.g., Per-FirstLast and PerLastCommaFirst, and write filter rules at the higher level of these two views, e.g., "Remove PerLastCommaFirst spans that overlap with a PerFirstLast span".
our induction algorithm considers CR rules consisting of combinations of CD rules directly, leading to many semantically similar CR rules, each operating over small parts of a larger semantic group (see rule in Section 6.1).