In computational linguistics there is growing insight that high-quality NLP applications for information access (question anwering, etc.) are in need of deeper linguistic analysis, in particular, semantic analysis. A bottleneck for semantic processing is the lack of large-scale domain-independent lexical semantic resources. While WordNets for several languages are important lexical resources fo...

This paper presents a Frame Semantics analysis of calendric terms in English, Hebrew, and German, demonstrating the inextricable relationship between morphology and semantics. Here, we consider how Frame Semantics can be extended to morphological analysis. Traditionally, the morpheme has been taken as the smallest unit of meaning in linguistic analysis, with generative word formation rules gene...

Possibility semantics. Possibility semantics for modal logic is a generalization of standard Kripke semantics. In this semantics, a possibility frame has a refinement relation which is a partial order between states, in addition to the accessibility relation for modalities. From an algebraic perspective, full possibility frames are dually equivalent to complete Boolean algebras with complete op...

We present a method for corpus-based induction of an LFG syntax-semantics interface for frame semantic processing in a computational LFG parsing architecture. We show how to model frame semantic annotations in an LFG projection architecture, including special phenomena that involve non-isomorphic mappings between levels. Frame semantic annotations are ported from a manually annotated corpus to ...

This paper will remind the reader of neighborhood semantics for modal logics, compare them with relational semantics, and then look at some questions about neighborhood semantics that have been answered, and some which are still open. We will then introduce “ultrafilter semantics,” a way of expressing all sets over a canonical frame in an ‘effable’ way. This provides us with a conceptually easy...

In [12] the study of Positive Modal Logic (PML) is initiated using standard Kripke semantics and the positive modal algebras (a class of bounded distributive lattices with modal operators) are introduced. The minimum system of Positive Modal Logic is the (∧,∨, 2, 3,⊥,>)-fragment of the local consequence relation defined by the class of all Kripke models. It can be axiomatized by a sequent calcu...

Consider how one might understand the following ad, "For Sale, Parachute. Used once; never opened; small stain." Although there are no explicit cues to do so, the reader naturally recruits knowledge about how and why parachutes are normally used in order to construe the listed features of this chute as being causally related to one another. Empirical support for the importance of such causal an...

A compositional semantics for focusing subjuncts-words such as only, even, and also--is developed from Rooth's theory of association with focus. By adapting the theory so that it can be expressed in terms of a frame-based semantic formalism, a semantics that is more computationally practical is arrived at. This semantics captures pragmatic subtleties by incorporating a two-part representation, ...

This paper introduces the infrastructure and the principles of a semantic framework used for the analysis and classification of verbs, developed with the aim of constructing a lexical database of Mandarin verbal semantics, called the Mandarin VerbNet. Distinct from most existing lexical databases that enumerate word senses without detailed grammatical considerations, the Mandarin VerbNet is des...

Abstract We study various properties of formalised relativised interpretability. In the central part this thesis we for different interpretability logics following aspects: completeness modal semantics, decidability and algorithmic complexity. particular, two basic types relational semantics logics. One is Veltman which shall refer to as regular or ordinary semantics; other called generalised s...