Hidden predicates and formulas used for bridging anaphora recognition. m represents a mention, M the set of mentions in the whole document, s an IS class, S the set of eight IS classes, and w the weight learned from the data for the specific formula.
| Hidden predicates | |
| p1 | hasIS(m, s) |
| Formulas | |
| Hard constraints | |
| f1 | ∀m ∈ M: |s ∈ S: hasIS(m, s)| = 1 |
| Joint inference formula template | |
| fg | (w) ∀mi, mj ∈ M ∀ ∈ S: jointInferenceFormula_Constraint (mi, mj) → hasIS(mi, ) ∧ hasIS(mj, ) |
| Non-joint inference formula template | |
| fl | (w) ∀m ∈ M ∀s ∈ S: non-jointInferenceFormula_Constraint (m, s) → hasIS(m, s) |
| Hidden predicates | |
| p1 | hasIS(m, s) |
| Formulas | |
| Hard constraints | |
| f1 | ∀m ∈ M: |s ∈ S: hasIS(m, s)| = 1 |
| Joint inference formula template | |
| fg | (w) ∀mi, mj ∈ M ∀ ∈ S: jointInferenceFormula_Constraint (mi, mj) → hasIS(mi, ) ∧ hasIS(mj, ) |
| Non-joint inference formula template | |
| fl | (w) ∀m ∈ M ∀s ∈ S: non-jointInferenceFormula_Constraint (m, s) → hasIS(m, s) |