Buscar
Mostrando ítems 1-9 de 9
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 ...
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 ...
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 ...
Une approche formelle pour la génération d'analyseurs de langages naturels
(2005-11-21)
[Abstract] Un processus d'analyse syntaxique et d'annotation efficace est déterminante dans l'élaboration de structures d'analyse de langages naturels. Ce papier introduit un environnement de programmation permettant ...
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 ...