Weighted parsing for grammar-based language models over multioperator monoids

DOI10.1016/j.ic.2021.104774OpenAlexW3175249824MaRDI QIDQ2051800

Heiko Vogler, Richard Mörbitz

Publication date: 25 November 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.06585

zbMATH Keywords

formal grammarlanguage modelweighted parsing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Symbolic weighted language models, quantitative parsing and automated music transcription

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A constructive method for abstract algebraic software specification
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• On multiple context-free grammars
• On limits in complete semirings
• A generalization of Dijkstra's algorithm
• A discipline of dynamic programming over sequence data
• A Kleene theorem for weighted tree automata over distributive multioperator monoids
• Parsing Beyond Context-Free Grammars
• Principles and implementation of deductive parsing
• Weighted Deductive Parsing and Knuth's Algorithm
• Graph expressions and graph rewritings
• Control sets on linear grammars
• Initial Algebra Semantics and Continuous Algebras
• Semirings and Formal Power Series
• THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES
• Tree parsing for tree-adjoining machine translation
• Tree generating regular systems
• Heterogeneous algebras
• Algebras with a Scheme of Operators

This page was built for publication: Weighted parsing for grammar-based language models over multioperator monoids