After illustrating the benefits of this approach with several examples, we describe the algorithm for compiling zero morphemes into unary rules, which allows us to use zero morphemes more efficiently in natural language processing. 1 Then, we discuss the question of equivalence of a grammar with these unary rules to the original grammar. Lastly, we compare our approach to zero morphemes with possible alternatives. 1. Zero Morphemes in Categorial Grammar In English and in other natural languages, it is attractive to posit the existence of morphemes that are invisible on the surface but have their own syntactic and.
