In this paper, we address the issue of syntagmatic expressions from a computational lexical semantic perspective. From a representational viewpoint, we argue for a hybrid approach...
We describe a case study in tit(', application of symbolic machinc learning techniques for the discow;ry of linguistic rules and categories. A supervised rule induction algor...
In this paper we analyse the problem of generating referring expressions in a multilingnal generation system that produces instructions on how to fill out pension forms. The model...
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
We Imbed Into a first order logic a representation language that combines atemporal knowledge with time stamps in a hierarchical fashion. Each time structure contains its own chro...