Type and sort conflicts in semantics are usually resolved by a process of reinterpretation, which introduces an operator into the semantic representation.
In this approach, relaxed underspecified semantic representations are inferred from the syntactic structure, leaving space for subsequent addition of ...
The main idea is to derive sufficiently relaxed underspecified semantic representations; addition of reinterpretation operators then simply is further ...
E-mail: [email protected]. Abstract. Type and sort conflicts in semantics are usually resolved by a process of reinterpretation,.
Relaxing Underspecified Semantic Representations for Reinterpretation · Alexander Koller, Joachim Niehren, Kristina Striegnitz · Published in Grammars 1 May 2000 ...
Nov 16, 2010 · Relaxing Underspecified Semantic Representations for. Reinterpretation. Alexander Koller, Joachim Niehren, Kristina Striegnitz. To cite this ...
In this approach, relaxed underspecified semantic representations are inferred from the syntactic structure, leaving space for subsequent addition of ...
Type and sort conflicts in semantics are usually resolved by a process of reinterpretation, which introduces an operator into the semantic representation.
In tأis paper, we developed a general crite- rion for underspecified semantic representations wأicأ, if satisfied, ensures tأat relaxation at a certain position ...
The actual reinterpretation step simply is further special- ization, i.e instantiation of gaps; the approach assumes that suitable reinterpretation operators.
Missing: Underspecified | Show results with:Underspecified