The following pages link to Jose Oncina (Q207959):
Displaying 19 items.
- Learning stochastic edit distance: application in handwritten character recognition (Q2498646) (← links)
- Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820) (← links)
- An approximate median search algorithm in non-metric spaces (Q2748190) (← links)
- Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
- (Q3046706) (← links)
- Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries (Q3528415) (← links)
- Learning Multiplicity Tree Automata (Q3541869) (← links)
- Learning deterministic regular grammars from stochastic samples in polynomial time (Q4256139) (← links)
- A modification of the LAESA algorithm for approximated k-NN classification (Q4421029) (← links)
- (Q4440392) (← links)
- (Q4536573) (← links)
- Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton (Q4605516) (← links)
- (Q4809019) (← links)
- (Q4809020) (← links)
- The most probable string: an algorithmic study (Q5415366) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493017) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493035) (← links)
- Algorithmic Learning Theory (Q5897391) (← links)
- Stochastic inference of regular tree languages (Q5945687) (← links)
