• Stochastic parsing and parallelism 

  Barcala Rodríguez, Francisco Mario; Sacristán Agulló, Oscar; Graña Gil, Jorge (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 ...

• Regional versus global finite-state error repair 

  Vilares Ferro, Manuel; Otero Pombo, Juan; Graña Gil, Jorge (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 ...

• Formal methods of tokenization for part-of-speech tagging 

  Graña Gil, Jorge; Barcala Rodríguez, Francisco Mario; Vilares Ferro, Manuel (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 ...

• A common solution for tokenization and part-of-speech tagging: one-pass Viterbi algorithm vs. Iterative approaches 

  Graña Gil, Jorge; Alonso, Miguel A.; Vilares Ferro, Manuel (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 methods of minimal acyclic finite-state automata for large dictionaries. 

  Graña Gil, Jorge; Barcala Rodríguez, Francisco Mario; Alonso, Miguel A. (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 ...

View more