Fibred semantics for feature-based grammar logic (Q1923842): Difference between revisions
From MaRDI portal
Latest revision as of 10:10, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fibred semantics for feature-based grammar logic |
scientific article |
Statements
Fibred semantics for feature-based grammar logic (English)
0 references
17 March 1997
0 references
This paper gives a simple method for providing categorial brands of feature-based unification grammars with a model-theoretic semantics. The key idea is to apply the paradigm of fibred semantics (or layered logics) in order to combine the two components of a feature-based grammar logic. We demonstrate the method for the augmentation of Lambek categorial grammar with Kasper/Rounds-style feature logic. These are combined by replacing (or annotating) atomic formulas of the first logic, i.e. the basic syntactic types, by formulas of the second. Modelling such a combined logic is less trivial than one might expect. The direct application of the fibred semantics method where a combined atomic formula like \texttt{np(num:sg \& pers:3rd)} denotes those strings which have the indicated property and the categorial operators denote the usual left- and right-residuals of these string sets, does not match the intuitive, unification-based proof theory. Unification implements a global bookkeeping with respect to a proof whereas the direct fibring method restricts its view to the atoms of the grammar logic. The solution is to interpret the (embedded) feature terms as global feature constraints while maintaining the same kind of fibred structures. For this adjusted semantics, the anticipated proof system is sound and complete.
0 references
computational linguistics
0 references
unification
0 references
combined logic
0 references
feature-based unification grammars
0 references
model-theoretic semantics
0 references
fibred semantics
0 references
layered logics
0 references
Lambek categorial grammar
0 references
Kasper/Rounds-style feature logic
0 references
proof system
0 references