We present a non-standard interpretation for concept expressions in ALCQ that defines approximate notions of subsumption based on approximating a subset of the concept and role names. We present the non-standard semantics, and the corresponding notion of approximate subsumption, discuss its formal properties and show that is can be computed by syntactic manipulations of concept expressions.

Even a superficial meaning representation of a text requires a system of semantic labels that characterize the relations between the predicates in the text and their arguments. The semantic interpretation of syntactic subjects and objects, of prepositions and subordinate conjunctions has been treated in numerous books and papers with titles including words like DEEP CASES, CASE ROLES, SEMANTIC ...

We present a game-theoretic model of the polymorphic λ-calculus, system F , as a fibred category. Every morphism σ of the model defines an η-expanded, β-normal form σ̂ of system F whose interpretation is σ. Thus the model gives a precise, non-syntactic account of the calculus.

Contextual information plays a key role in the automatic interpretation of text. This paper is concerned with the identification of textual contexts. A context taxonomy is introduced first, followed by an algorithm for detecting context boundaries. Experiments on the detection of subjective contexts using a machine learning model were performed using a set of syntactic features.

We use a syntactic interpretation of MALL in BCI with ∧, defined in [5], to prove the undecidability of the consequence relations for BCI with ∧ and BCI with ∨, and the NP-completeness of BCI. Similar results are obtained for a variant of the Lambek calculus.

While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semi-automatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. Our approach yields phrasal and single word lexical paraphrases as well as sy...

We develop a computational interpretation of guarded dependent type theory with clocks called CTT which enjoys a straightforward operational semantics and immediate canonicity result for base types. Our realizability-style presentation of guarded type theory is a computational and syntactic alternative to category-theoretic accounts of guarded recursion, emphasizing type theory’s role as the ul...

Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exceptions), and those whose truth value varies according to the degree of instantiation of arguments. In particular, non-leftmost unfolding steps can produce incorrect results since the independence of the computation ru...

There are a number of coUocational constraints in natural languages that ought to play a more important role in natural language parsers. Thus, for example, it is hard for most parsers to take advantage of the fact that wine is typically drunk, produced, and sold, but (probably) not pruned. So too, it is hard for a parser to know which verbs go with which prepositions (e.g., set up) and which n...