Generalizing a Proof-Theoretic Account of Scope Ambiguity

Sylvain Pogodalla 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : When trying to build the semantic representation of a natural language expression, it may happen that a single expression produces many semantic representations. In this paper, we focus on scope ambiguities where a single syntactic analysis can yield many semantic representations. There are basically two ways to address scope ambiguities. One way is to build two syntactic structures (parse trees) from a single expression, then, from these syntactic structures, to functionally build two semantic representations. The other way is to build a single syntactic structure and to associate to the latter, in a non-functional way, two semantic representations. These two ways are represented by two frameworks: the type-logical framework, where ambiguity is modeled by the process (proof search), and the underspecification framework, where ambiguity is modeled by a (formal) language. Our proposal aims at giving a proof-theoretic account of scope ambiguity that does not rely on syntactic ambiguity nor on another intermediate language. It is based on the Abstract Categorial Grammar (ACG) framework.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download
Contributor : Sylvain Pogodalla <>
Submitted on : Monday, May 21, 2007 - 2:25:13 PM
Last modification on : Wednesday, January 31, 2018 - 11:02:00 AM
Document(s) archivé(s) le : Friday, November 25, 2016 - 4:03:04 PM


Files produced by the author(s)


  • HAL Id : inria-00112898, version 3



Sylvain Pogodalla. Generalizing a Proof-Theoretic Account of Scope Ambiguity. Harry Bunt. Proceedings of the 7th International Workshop on Computational Semantics (IWCS-7), Jan 2007, Tilburg, Netherlands. 2007. 〈inria-00112898v3〉



Record views


Files downloads