L
Título: Methods for Parallelizing Search Paths in Phrasing
Autores: Marcken, Carl de
Fecha: 2004-10-20
2004-10-20
1994-01-01
Publicador:
Fuente: Ver documento
Tipo:
Tema: parallel search
parsing
generate and test
Descripción: Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate and serialize work at considerable computational expense. There are techniques available that can eliminate redundant computations and perform remaining operations concurrently, effectively reducing the branching factors of these algorithms. This thesis applies these techniques to the problem of parsing natural language. The result is an efficient programming language that can reduce some of the expense associated with principle-based parsing and other search problems. The language is used to implement various natural language parsers, and the improvements are compared to those that result from implementing more deterministic theories of language processing.
Idioma: Inglés
Artículos similares:
Description Of Procedures In Automotive Engine Plants por Artzner, Denis,Whitney, Dr. Daniel
Reading Courtesy Amounts on Handwritten Paper Checks por Palacios, Rafael,Wang, Patrick S.P.,Gupta, Amar
On Trees and Logs por Pavlova, Anna,Cass, David
Saturn, The GM/UAW Partnership por Rubinstein, Saul,Kochan, Thomas
Academic Earmarks and the Returns to Lobbying por De Figueiredo, John M.,Silverman, Brian S.
10