L
Título: Synchronous grammars as tree transducers
Autores: Shieber, Stuart
Fecha: 2008-08-11
2004
Publicador:
Fuente: Ver documento
Tipo:
Tema: computational linguistics
computer science
natural-language processing
Descripción: Tree transducer formalisms were developed in the formal language theory community as generalizations of finite-state transducers from strings to trees. Independently, synchronous tree-substitution and -adjoining grammars arose in the computational linguistics community as a means to augment strictly syntactic formalisms to provide for parallel semantics. We present the first synthesis of these two independently developed approaches to specifying tree relations, unifying their respective literatures for the first time, by using the framework of bimorphisms as the generalizing formalism in which all can be embedded. The central result is that synchronous tree-substitution grammars are equivalent to bimorphisms where the component homomorphisms are linear and complete.
Engineering and Applied Sciences
Idioma: Inglés
Artículos similares:
Ellipsis and higher-order unification por Pereira, Fernando C. N.,Dalrymple, Mary,Shieber, Stuart
Automatic yellow-pages pagination and layout por Marks, Joe,Shieber, Stuart,Johari, Ramesh,Partovi, Ali
Generation and synchronous tree-adjoining grammars por Shieber, Stuart,Schabes, Yves
An algorithm for generating quantifier scopings por Hobbs, Jerry,Shieber, Stuart
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