Buscar
Mostrando ítems 1-10 de 24
Compilation of constraint-based contextual rules for part-of-speech tagging into finite state transducers
(Springer-Verlag, 2002)
[Abstract] With the aim of removing the residuary errors made by pure stochastic disambiguation models, we put forward a hybrid system in which linguist users introduce high level contextual rules to be applied in combination ...
Regional Finite-State Error Repair
(Springer-Verlag, 2004)
[Abstract] We describe an algorithm to deal with error repair over finite-state architectures. Such a technique is of interest in spelling correction as well as approximate string matching in a variety of applications ...
GALENA: tabular DCG parsing for natural languages
(1998)
[Abstract] We present a definite clause based parsing environment for natural languages, whose operational model is the dynamic interpretation of logical push-down automata. We attempt to briefly explain our design decisions ...
A tagger environment for Galician
(1998)
[Abstract] In this paper, we introduce a tagger environment for Galician, the native language of Galicia. Galician belongs to the group of Romance languages which developed from the Latin imposed on the north-west of the ...
Verificación de conexiones telefónicas con esterel
(1995)
[Resumen] El presente trabajo resume el proceso de diseño, implementación y verificación del comportamiento de una centralita telefónica digital en el entorno de programación de tiempo real síncrono Esterel. Nuestra intención ...
Spelling correction on technical documents
(2005)
[Abstract] We describe a novel approach to spelling correction applied on technical documents, a task that requires a number of especific properties such as eficiency, safety and maintenance. In opposite to previous works, ...
Finite-State Morphology and Formal Verification
(Cambridge University Press, 1999)
Regional finite-state error repair
(Springer-Verlag, 2004)
[Abstract] We describe an algorithm to deal with error repair over finite-state architectures. Such a technique is of interest in spelling correction as well as approximate string matching in a variety of applications ...
Stochastic parsing and parallelism
(Springer-Verlag, 2001)
[Abstract] Parsing CYK-like algorithms are inherently parallel: there are a lot of cells in the chart that can be calculated simultaneously. In this work, we present a study on the appropriate techniques of paralle-lism ...