A* shortest string decoding for non-idempotent semirings (2204.07236v2)
Abstract: The single shortest path algorithm is undefined for weighted finite-state automata over non-idempotent semirings because such semirings do not guarantee the existence of a shortest path. However, in non-idempotent semirings admitting an order satisfying a monotonicity condition (such as the plus-times or log semirings), the notion of shortest string is well-defined. We describe an algorithm which finds the shortest string for a weighted non-deterministic automaton over such semirings using the backwards shortest distance of an equivalent deterministic automaton (DFA) as a heuristic for A* search performed over a companion idempotent semiring, which is proven to return the shortest string. While there may be exponentially more states in the DFA, this algorithm needs to visit only a small fraction of them if determinization is performed "on the fly".
- OpenFst: a general and efficient weighted finite-state transducer library. In Implementation and Application of Automata: 12th International Conference (CIAA 2007), pages 11–23.
- The mathematics of statistical machine translation: parameter estimation. Computational Linguistics, 19(2):263–312.
- Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(1):1–38.
- Edsger W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269–271.
- Kyle Gorman and Richard Sproat. 2021. Finite-State Text Processing. Morgan & Claypool.
- A formal basis for the heuristic determination of minimal cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100–107.
- Introduction to Automata Theory, Languages, and Computation, 3rd edition. Pearson.
- Frederick Jelinek and Robert L. Mercer. 1980. Interpolated estimation of Markov source parameters from sparse data. In Proceedings of the Workshop on Pattern Recognition in Practice, pages 381–397.
- Unsupervised analysis for decipherment problems. In Proceedings of the COLING/ACL 2006 Main Conference Poster Sessions, pages 499–506.
- Mehryar Mohri. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269–311.
- Mehryar Mohri. 2002. Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics, 7(3):321–350.
- Mehryar Mohri. 2009. Weighted automata algorithms. In Manfred Droste, Werner Kuich, and Heiko Vogler, editors, Handbook of Weighted Automata, pages 213–254. Springer.
- Weighted finite-state transducers in speech recognition. Computer Speech and Language, 16(1):69–88.
- Mehryar Mohri and Michael D. Riley. 2015. On the disambiguation of weighted automata. In Implementation and Application of Automata 20th International Conference (CIAA 2015), pages 263–278.
- Mehyar Mohri and Michael Riley. 2002. An efficient algorithm for the n-best-strings problem. In 7th International Conference on Spoken Language Processing, pages 1313–1316.
- Brian Roark and Richard Sproat. 2007. Computational Approaches to Morphology and Syntax. Cambridge University Press.
- Lateen EM: unsupervised training with multiple objectives, applied to dependency grammar induction. In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, pages 1269–1280.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.