Inference of finite-state transducers from regular languages

DOI10.1016/J.PATCOG.2004.03.025zbMATH Open1101.68645OpenAlexW2049401516MaRDI QIDQ2485084FDOQ2485084

Enrique Vidal, David Picó, Francisco Casacuberta

Publication date: 3 August 2005

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2004.03.025

zbMATH Keywords

Grammatical inferenceFormal language theoryMachine translationNatural language processingStochastic finite-state transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The EuTrans-I spoken language translation system
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach
• Injection Structures Specified by 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
• Title not available (Why is that?)

Uses Software

• CMU

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)