Computational Linguistics
Type-driven semantic interpretation of F-structures
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Monotonic semantic interpretation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
On interpreting f-structures as UDRSs
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Syntactic and semantic transfer with f-structures
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Wide-coverage deep statistical parsing using automatic dependency structure annotation
Computational Linguistics
Dependency-based n-gram models for general purpose sentence realisation
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Hi-index | 0.00 |
We describe an approach to interpreting LFG f-structures (Kaplan & Bresnan, 1982) truth-conditionally as underspecified quasi-logical forms. F-structures are either interpreted indirectly in terms of a homomorphic embedding into Quasi Logical Form (QLF) (Alshawi, 1992; Alshawi & Crouch, 1992; Cooper et al., 1994a) representations or directly in terms of adapting QLF interpretation clauses to f-structure representations. We provide a reverse mapping from QLFs to f-structures and establish isomorphic subsets of the QLF and LFG formalism. A simple mapping which switches off QLF contextual resolution can be shown to be truth preserving with respect to an independently given semantics (Dalrymple et al., 1995). We compare our proposal with approaches discussed in the literature.