Learning categorial grammar by unification with negative constraints
Jacek Marciniec · Journal of Applied Non-Classical Logics · 1994
This paper presents the modification of the algorithm for determining categorial grammars from linguistic data, presented in [BP 90], in two directions: enabling negative input and admitting more types than just the sentence type. The notion of restricted optimal unification is introduced—optimal unification sensitive to negative constraints.