This chapter represents a digression from the main topic of the book since computational approaches within the framework of ontological semantics go not only beyond the scope of this book but also beyond my own expertise. Nevertheless, I believe that my approach will benefit a great deal from a consideration how ontological semantics which is a complex approach to the treatment of text meaning by computer, deals with cases of mismatches between the morphological form and the semantic interpretation such as in the case of relational adjectives. Specifically, I will refer to Raskin and Nirenburg’s work on adjectives in the context of ontological semantics in the late 1990s. The crucial question to ask here is how natural language processing (NLP) applications deal with cases of underspecification, that is, how they are able to cut the number of candidate solutionswn to one when, in fact, several candidates share the same semantic information, being only underspecified for one or more syntactic features.