L
Título: An algorithm for generating quantifier scopings
Autores: Hobbs, Jerry
Shieber, Stuart
Fecha: 2008-08-14
1987
Publicador: Association for Computing Machinery
Fuente: Ver documento
Tipo: Journal Article
Tema:
Descripción: The syntactic structure of a sentence often manifests quite clearly the predicate-argument structure and relations of grammatical subordination. But scope dependencies are not so transparent. As a result, many systems for representing the semantics of sentences have ignored scoping or generating scoping mechanisms that have often been inexplicit as to the range of scopings they choose among or profligate in the scopings they allow. In this paper, we present an algorithm, along with proofs of some of its important properties, that generates scoped semantic forms from unscoped expressions encoding predicate-argument structure. The algorithm is not profligate as are those based on permutation of quantifiers, and it can provide a solid foundation for computational solutions where completeness is sacrificed for efficiency and heuristic efficacy.
Engineering and Applied Sciences
Idioma: Inglés
Artículos similares:
Ellipsis and higher-order unification por Pereira, Fernando C. N.,Dalrymple, Mary,Shieber, Stuart
Generation and synchronous tree-adjoining grammars por Shieber, Stuart,Schabes, Yves
Automatic yellow-pages pagination and layout por Marks, Joe,Shieber, Stuart,Johari, Ramesh,Partovi, Ali
Semantic-head-driven generation por Moore, Robert C.,Pereira, Fernando C. N.,van Noord, Gertjan,Shieber, Stuart
10 
Abbreviated text input using language modeling. por Shieber, Stuart,Nelken, Rani