Paper: Zero Morphemes In Unification-Based Combinatory Categorial Grammar

ACL ID P90-1024
Title Zero Morphemes In Unification-Based Combinatory Categorial Grammar
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1990
Authors

In this paper, we report on our use of zero morphemes in Unification-Based Combinatory Categorial Grammar. After illus- trating the benefits of this approach with several examples, we describe the algorithm for compil- ing zero morphemes into unary rules, which al- lows us to use zero morphemes more efficiently in natural language processing. 1 Then, we dis- cuss the question of equivalence of a grammar with these unary rules to the original grammar. Lastly, we compare our approach to zero mor- phemes 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 semantic defini- tions. In our analyses, they are just like an...