Rafael C. Carrasco

Orcid: 0000-0002-4726-9694

Affiliations:
  • University of Alicante, Department of Software and Computing Systems


According to our database1, Rafael C. Carrasco authored at least 59 papers between 1994 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Measuring the diversity of data and metadata in digital libraries.
CoRR, 2023

2022
Evaluating the quality of linked open data in digital libraries.
J. Inf. Sci., 2022

Discovering emerging topics in textual corpora of galleries, libraries, archives, and museums institutions.
J. Assoc. Inf. Sci. Technol., 2022

2020
Learning synchronous context-free grammars with multiple specialised non-terminals for hierarchical phrase-based translation.
CoRR, 2020

2019
A linked open data framework to enhance the discoverability and impact of culture heritage.
J. Inf. Sci., 2019

2018
Migration of a library catalogue into RDA linked open data.
Semantic Web, 2018

2017
Assisting non-expert speakers of under-resourced languages in assigning stems and inflectional paradigms to new word entries of morphological dictionaries.
Lang. Resour. Evaluation, 2017

2016
A parser for authority control of author names in bibliographic records.
Inf. Process. Manag., 2016

2015
Transformation of a Library Catalogue into RDA Linked Open Data.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2015

Linguistically-Enhanced Search over an Open Diachronic Corpus.
Proceedings of the Advances in Information Retrieval, 2015

2014
An efficient method to assist non-expert users in extending dictionaries by assigning stems and inflectional paradigms to unknknown words.
Proceedings of the 17th Annual conference of the European Association for Machine Translation, 2014

An open-source OCR evaluation tool.
Proceedings of the Digital Access to Textual Cultural Heritage 2014, 2014

2013
An open diachronic corpus of historical Spanish.
Lang. Resour. Evaluation, 2013

An open diachronic corpus of historical Spanish: annotation criteria and automatic modernisation of spelling.
CoRR, 2013

Generalized Biwords for Bitext Compression and Translation Spotting: Extended Abstract.
Proceedings of the IJCAI 2013, 2013

2012
Generalized Biwords for Bitext Compression and Translation Spotting.
J. Artif. Intell. Res., 2012

Indexing Structured Documents with Suffix Arrays.
Proceedings of the 12th International Conference on Computational Science and Its Applications, 2012

2011
Normalization of edit sequences for text synchronization.
RAIRO Theor. Informatics Appl., 2011

Document Translation Retrieval Based on Statistical Machine Translation Techniques.
Appl. Artif. Intell., 2011

2010
Long-term staff scheduling with regular temporal distribution.
Comput. Methods Programs Biomed., 2010

2009
A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata.
RAIRO Theor. Informatics Appl., 2009

Incremental Construction of Minimal Tree Automata.
Algorithmica, 2009

On the Use of Word Alignments to Enhance Bitext Compression.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2007
An Implementation of Deterministic Tree Automata Minimization.
Proceedings of the Implementation and Application of Automata, 2007

2006
Open-Source Portuguese-Spanish Machine Translation.
Proceedings of the Computational Processing of the Portuguese Language, 2006

2005
Smoothing and compression with stochastic <i>k</i>-testable tree languages.
Pattern Recognit., 2005

Probabilistic Finite-State Machines-Part II.
IEEE Trans. Pattern Anal. Mach. Intell., 2005

Probabilistic Finite-State Machines-Part I.
IEEE Trans. Pattern Anal. Mach. Intell., 2005

Parsing with Probabilistic Strictly Locally Testable Tree Languages.
IEEE Trans. Pattern Anal. Mach. Intell., 2005

XMLibrary Search: An XML Search Engine Oriented to Digital Libraries.
Proceedings of the Research and Advanced Technology for Digital Libraries, 2005

2004
Unsupervised Training of a Finite-State Sliding-Window Part-of-Speech Tagger.
Proceedings of the Advances in Natural Language Processing, 4th International Conference, 2004

2003
A similarity between probabilistic tree languages: application to XML document families.
Pattern Recognit., 2003

Buscadores de Contenidos para Bibliotecas Digitales: Desarrollo de una Arquitectura para un Buscador XML.
Proceedings of the IV Jornadas de Bibliotecas Digitales, 2003

El proyecto METAe (Meta-data Engine Project): concepto, implementación e integración en bibliotecas digitales.
Proceedings of the IV Jornadas de Bibliotecas Digitales, 2003

Presentación sinóptica de textos bilingües mediante distancias de edición.
Proceedings of the IV Jornadas de Bibliotecas Digitales, 2003

Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling.
Proceedings of the Pattern Recognition and Image Analysis, First Iberian Conference, 2003

Offspring-annotated probabilistic context-free grammars.
Proceedings of the Workshop and Tutorial on Learning Contex-Free Grammars, 2003

Learning probabilistic context-free grammars from treebanks.
Proceedings of the Progress in Pattern Recognition, 2003

2002
Incremental Construction and Maintenance of Minimal Finite-State Automata.
Comput. Linguistics, 2002

Tree k-Grammar Models for Natural Language Modelling and Parsing.
Proceedings of the Structural, 2002

Stochastic k-testable Tree Languages and Applications.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001
Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks.
IEEE Trans. Knowl. Data Eng., 2001

Stochastic Inference of Regular Tree Languages.
Mach. Learn., 2001

Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Proceedings of the Emergent Neural Computational Architectures Based on Neuroscience, 2001

2000
Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units.
Neural Comput., 2000

Lossless Compression of Surfaces Described as Points.
Proceedings of the Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30, 2000

Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks.
Proceedings of the Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30, 2000

Probabilistic <i>k</i>-Testable Tree Languages.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

A Comparison of PCFG Models.
Proceedings of the Fourth Conference on Computational Natural Language Learning, 2000

1999
Learning deterministic regular grammars from stochastic samples in polynomial time.
RAIRO Theor. Informatics Appl., 1999

Encoding of sequential translators in discrete-time recurrent neural nets.
Proceedings of the 7th European Symposium on Artificial Neural Networks, 1999

1998
Computing the Relative Entropy Between Regular Tree Languages.
Inf. Process. Lett., 1998

1997
Accurate Computation of the Relative Entropy Between Stochastic Regular Grammars.
RAIRO Theor. Informatics Appl., 1997

1996
A fast branch & bound nearest neighbour classifier in metric spaces.
Pattern Recognit. Lett., 1996

Inferring stochastic regular grammars with recurrent neural networks.
Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

1995
A note on the Nagendraprasad-Wang-Gupta thinning algorithm.
Pattern Recognit. Lett., 1995

Learning the Initial State of a Second-Order Recurrent Neural Network during Regular-Language Inference.
Neural Comput., 1995

Second-Order Recurrent Neural Networks Can Learn Regular Grammars from Noisy Strings.
Proceedings of the From Natural to Artificial Neural Computation, 1995

1994
Learning Stochastic Regular Grammars by Means of a State Merging Method.
Proceedings of the Grammatical Inference and Applications, Second International Colloquium, 1994


  Loading...