OpenFst

swMATH653MaRDI QIDQ13407FDOQ13407

Author name not available (Why is that?)

Described by source

• OpenFst: A General and Efficient Weighted Finite-State Transducer Library

Cited In (14)

• Compositions of constant weighted extended tree transducers
• Automata in SageMath -- combinatorics meet theoretical computer science
• Algorithms for probabilistic and stochastic subsequential failure transducers
• From tree automata to string automata minimization
• Implementation of code properties via transducers
• Extended multi bottom-up tree transducers
• A type system for weighted automata and rational expressions
• Pairwise rational kernels obtained by automaton operations
• HFST Tools for Morphology – An Efficient Open-Source Package for Construction of Morphological Analyzers
• Survey: finite-state technology in natural language processing
• Minimizing deterministic weighted tree automata
• A Pushdown Transducer Extension for the OpenFst Library
• Title not available (Why is that?)
• Filters for Efficient Composition of Weighted Finite-State Transducers

This page was built for software: OpenFst