Weighted Deductive Parsing and Knuth's Algorithm

DOI10.1162/089120103321337467zbMath1234.68426OpenAlexW2115753373MaRDI QIDQ3225400

Mark-Jan Nederhof

Publication date: 20 March 2012

Published in: Computational Linguistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/089120103321337467

zbMATH Keywords

parsingKnuth's algorithmweighted deduction system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Related Items (2)

Computation of distances for regular and context-free probabilistic languages ⋮ Weighted parsing for grammar-based language models over multioperator monoids

Cites Work

• A note on two problems in connexion with graphs
• A generalization of Dijkstra's algorithm
• Anytime deduction for probabilistic logic
• Directed hypergraphs and applications
• Principles and implementation of deductive parsing
• Optimizing decision trees through heuristically guided search
• Syntax-directed least-errors analysis for context-free languages

This page was built for publication: Weighted Deductive Parsing and Knuth's Algorithm