Relaxing underspecified semantic representations for reinterpretation

DOI10.1023/A:1009948924590MaRDI QIDQ5931129zbMATH OpenOpenAlexFDO

Authors Alexander Koller, Joachim Niehren, Kristina Striegnitz

Publication date 17 January 2002

Published in Grammars (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009948924590

zbMATH Keywords

constraint language for lambda structuresknowledge representationlinguistic constraintsnatural language semanticsrelaxationsemantic underspecificationtoy grammartree descriptionsunderspecified reinterpretation

Mathematics Subject Classification ID

Logic of natural languages (03B65) Knowledge representation (68T30) Natural language processing (68T50)

Review text

This article investigates the foundations of underspecified reinterpretation of Natural Language (NL) semantic representations, and its basic operation of relaxation, in the framework of Constraint Language for Lambda Structures (CLLS), a formalism devoted to NL, semantic underspecification. In CLLS, the underspecified semantic representations are expressed by tree descriptions subsuming dominance constraints. Section 2 of the paper introduces tree descriptions in CLLS formalism. Section 3 discusses the underspecification approach to reinterpretation and specifies the overgeneration problem. Section 4 is devoted to the formalization of the notion of relaxation, what means a relaxation to be safe (the overgeneration problem is avoided), and to be open (arbitrary material can be filled into the gap). Section 5 develops techniques for reasoning about the structural properties of tree descriptions in CLLS; fragments and chains of fragments are defined, and some useful properties of these objects are proved. Section 6 presents a prototypical toy grammar for deriving relaxed underspecified representations. The final Section 7 shows that every relaxed description produced by the syntax/semantics interface of the proposed toy grammar is open and safe. These proof techniques may be extended to more detailed NL formal grammars.

Recommendations

• scientific article; zbMATH DE number 1696476
• Demystifying relational latent representations
• scientific article; zbMATH DE number 1794692
• scientific article; zbMATH DE number 1794690
• LMMS reloaded: transformer-based sense embeddings for disambiguation and beyond

Cited in

(2)

• Processing underspecified semantic representations in the constraint language for lambda structures
• An efficient enumeration algorithm for canonical form underspecified semantic representations

This page was built for publication: Relaxing underspecified semantic representations for reinterpretation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5931129)