MIKEL LORENZO
FORCADA ZUBIZARRETA
Investigador en el periodo 1993-2024
RAFAEL CARLOS
CARRASCO JIMENEZ
CATEDRATICO/A DE UNIVERSIDAD
Publicaciones en las que colabora con RAFAEL CARLOS CARRASCO JIMENEZ (18)
2017
-
Assisting non-expert speakers of under-resourced languages in assigning stems and inflectional paradigms to new word entries of morphological dictionaries
Language Resources and Evaluation, Vol. 51, Núm. 4, pp. 989-1017
2014
-
An efficient method to assist non-expert users in extending dictionaries by assigning stems and inflectional paradigms to unknown words
Proceedings of the 17th Annual Conference of the European Association for Machine Translation, EAMT 2014
2009
-
Incremental construction of minimal tree automata
Algorithmica (New York), Vol. 55, Núm. 1, pp. 95-110
2007
-
An implementation of deterministic tree automata minimization
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2006
-
Open-source Portuguese-Spanish machine translation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2005
-
Parameter reduction in unsupervisedly trained sliding-window part-of-speech taggers
International Conference Recent Advances in Natural Language Processing, RANLP
2004
-
Unsupervised Training of a Finite-State Sliding-Window Part-of-Speech Tagger
Advances in Natural Language Processing: 4th International Conference, EsTAL 2004, Alicante, Spain, October 20-22, 2004: proceedings
-
Unsupervised training of a finite-state sliding-window part-of-speech tagger
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2002
-
Incremental construction and maintenance of minimal finite-state automata
Computational Linguistics, Vol. 28, Núm. 2, pp. 207-216
-
Tree k-grammar models for natural language modelling and parsing
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2001
-
Simple strategies to encode tree automata in sigmoid recursive neural networks
IEEE Transactions on Knowledge and Data Engineering, Vol. 13, Núm. 2, pp. 148-156
2000
-
Encoding nondeterministic finite-state tree automata in sigmoid recursive neural networks
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
Stable encoding of finite-state machines in discrete-time recurrent neural nets with Sigmoid units
Neural Computation, Vol. 12, Núm. 9, pp. 2129-2174
-
Teoría de lenguajes, gramáticas y autómatas para informáticos
Servicio de Publicaciones
1999
-
Efficient encodings of finite automata in discrete-time recurrent neural networks
IEE Conference Publication
1996
-
Inferring stochastic regular grammars with recurrent neural networks
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1995
-
A note on the Nagendraprasad-Wang-Gupta thinning algorithm
Pattern Recognition Letters, Vol. 16, Núm. 5, pp. 539-541
-
Second-order recurrent neural networks can learn regular grammars from noisy strings
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)