#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1994

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Rafael C. Carrasco, JosÃ© Oncina
- ICGI
- 1994

- Rafael C. Carrasco, JosÃ© Oncina
- ITA
- 1999

In this paper, the identification of stochastic regular languages is addressed. For this purpose, we propose a class of algorithms which allow for the identification of the structure of the minimalâ€¦ (More)

- Enrique Vidal, Franck Thollard, Colin de la Higuera, Francisco Casacuberta, Rafael C. Carrasco
- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2005

Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or in fields to which pattern recognition is linked: computational linguistics, machine learning, timeâ€¦ (More)

- Enrique Vidal, Franck Thollard, Colin de la Higuera, Francisco Casacuberta, Rafael C. Carrasco
- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2005

Probabilistic finite-state machines are used today in a variety of areas in pattern recognition or in fields to which pattern recognition is linked. In part I of this paper, we surveyed these objectsâ€¦ (More)

- Luisa MicÃ³, JosÃ© Oncina, Rafael C. Carrasco
- Pattern Recognition Letters
- 1996

The recently introduced algorithm LAESA finds the nearest neighbour prototype in a metric space. The average number of distances computed in the algorithm does not depend on the number of prototypesâ€¦ (More)

- Rafael C. Carrasco
- ITA
- 1997

Works dealing with grammatical inference of stochastic grammars often evaluate the relative entropy between the model and the true grammar by means of large test sets generated with the trueâ€¦ (More)

- Rafael C. Carrasco, JosÃ© Oncina, Jorge Calera-Rubio
- Machine Learning
- 1998

We generalize a former algorithm for regular language identification from stochastic samples to the case of tree languages. It can also be used to identify context-free languages when structuralâ€¦ (More)

- Carme Armentano-Oller, Rafael C. Carrasco, +7 authors Miriam A. Scalco
- PROPOR
- 2006

This paper describes the current status of development of an open-source shallow-transfer machine translation (MT) system for the [European] Portuguese â†” Spanish language pair, developed using theâ€¦ (More)

- Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada
- CIAA
- 2007

A frontier-to-root deterministic finite-state tree automaton (DTA) can be used as a compact data structure to store collections of unranked ordered trees. DTAs are usually sparser than stringâ€¦ (More)

- Felipe SÃ¡nchez-MartÃnez, Rafael C. Carrasco, Miguel A. MartÃnez-Prieto, JoaquÃn Adiego
- J. Artif. Intell. Res.
- 2012

Large bilingual parallel texts (also known as bitexts) are usually stored in a compressed form, and previous work has shown that they can be more efficiently compressed if the fact that the two textsâ€¦ (More)