scientific article; zbMATH DE number 7488335

MaRDI QIDQ5061527

Stoyan Mihov, Klaus U. Schulz

Publication date: 11 March 2022

Full work available at URL: http://www.jalc.de/issues/2021/issue_26_3-4/jalc-2021-281-332.php

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

natural language processingfinite-state transducerscontextual conditionsfailure transitionstext rewriting

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• OpenFst
• OpenGrm

Cites Work

• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Algorithms for weighted finite automata with failure transitions
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Efficient string matching
• A remark on finite transducers
• Finite-State Techniques
• Unnamed Item

This page was built for publication: