Título: The Computational Complexity of Two-Level Morphology
Autores: Barton, G. Edward, Jr.
Fecha: 2004-10-04
2004-10-04
1985-11-01
Publicador: MIT
Fuente:
Tipo:
Tema:
Descripción: Morphological analysis requires knowledge of the stems, affixes, combnatory patterns, and spelling-change processes of a language. The computational difficulty of the task can be clarified by investigating the computational characteristics of specific models of morphologial processing. The use of finite-state machinery in the "two-level" model by Kimmo Koskenicimi model does not guarantee efficient processing. Reductions of the satisfiability problem show that finding the proper lexical??face correspondence in a two-level generation or recognition problem can be computationally difficult. However, another source of complexity in the existing algorithms can be sharply reduced by changing the implementation of the dictionary component. A merged dictionary with bit-vectors reduces the number of choices among alternative dictionary subdivisions by allowing several subdivisions to be searched at once.
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