Buscar
Mostrando ítems 11-20 de 24
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 ...
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 ...
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 ...
Tokenization and proper noun recognition for information retrieval
(IEEE Computer Society Press, 2005-11-21)
[Abstract] In this paper we consider a set of natural language processing techniques that can be used to analyze large amounts of texts, focusing on the advanced tokenizer which accounts for a number of complex linguistic ...
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 ...
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 ...
Instrumentation of Synchronous Reactive Models for Performance Engineering
(Springer-Verlag, 1995)
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 ...