Listar GI-COLE - Artigos por data de publicación
Mostrando ítems 1-10 de 10
-
Instrumentation of Synchronous Reactive Models for Performance Engineering
(Springer-Verlag, 1995) -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 versus global finite-state error repair
(Springer-Verlag, 2005)[Abstract] We focus on the domain of a regional least-cost strategy in order to illustrate the viability of non-global repair models over finitestate architectures. Our interest is justified by the difficulty, shared by ...