Inference of finite-state transducers from regular languages
From MaRDI portal
Publication:2485084
Recommendations
Cites work
- scientific article; zbMATH DE number 1670708 (Why is no real title available?)
- scientific article; zbMATH DE number 1670731 (Why is no real title available?)
- scientific article; zbMATH DE number 3825216 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1163157 (Why is no real title available?)
- The EuTrans-I spoken language translation system
Cited in
(13)- scientific article; zbMATH DE number 1670708 (Why is no real title available?)
- scientific article; zbMATH DE number 1949651 (Why is no real title available?)
- Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach
- scientific article; zbMATH DE number 1670731 (Why is no real title available?)
- Structural, Syntactic, and Statistical Pattern Recognition
- Some statistical-estimation methods for stochastic finite-state transducers
- Injection Structures Specified by Finite State Transducers
- Machine translation with inferred stochastic finite-state transducers
- On the Inference of Finite State Automata from Positive and Negative Data
- Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1
- Learning finite-state models for machine translation
- Finite state transducers with predicates and identities
- Finite State Transducers with Intuition
This page was built for publication: Inference of finite-state transducers from regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485084)