Listar Grupo de Investigación en Compiladores e Linguaxes. COLE por data de publicación
Mostrando ítems 1-20 de 24
-
Parsing as resolution
(1993)[Abstract] A general context-free parsing algoritm based on logical dynamic programming techniques is described. The analyzer takes a general class of context-free grammar as drivers, and any finite string as input. In an ... -
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 ... -
Communication protocols verification with Esterel
(Computational Mechanics Publications, 1995)[Abstract] This work summarizes design, implementation and verification processes of a digital telephone switchboard in the Esterel real-time programming environment. Our aim is to show the modularity in the description ... -
Instrumentation of Synchronous Reactive Models for Performance Engineering
(Springer-Verlag, 1995) -
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 ... -
Finite-State Morphology and Formal Verification
(Cambridge University Press, 1999) -
Nuevos algoritmos tabulares para el análisis de LIG
(1999)[Resumen] A partir de un algoritmo de tipo CYK se desarrolla una serie de nuevos algoritmos tabulares para el análisis de Gramáticas Lineales de Índices que incluye algoritmos ascendentes y algoritmos de tipo Earley con y ... -
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 ... -
Integrating external dictionaries into Part-of-speech taggers
(2001)[Abstract] The highest performances in part-of-speech tagging have been obtained by using stochastic methods, such as hidden Markov models. The running parameters of a hidden Markov model for tagging can be estimated from ... -
Compilation methods of minimal acyclic finite-state automata for large dictionaries.
(Springer-Verlag, 2001)[Abstract] We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We outline the most important methods, including ... -
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 ... -
Formal methods of tokenization for part-of-speech tagging
(Springer-Verlag, 2002)[Abstract] One of the most important prior tasks for robust part-of-speech tagging is the correct tokenization or segmentation of the texts. This task can involve processes which are much more complex than the simple ... -
Practical NLP-Based Text Indexing
(Springer Verlag, 2002) -
A common solution for tokenization and part-of-speech tagging: one-pass Viterbi algorithm vs. Iterative approaches
(Springer-Verlag, 2002)Current taggers assume that input texts are already tokenized, i.e. correctly segmented in \emph{tokens} or high level information units that identify each individual component of the texts. This working hypothesis is ... -
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 ... -
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 ...