Probabilistic parsing strategies

DOI10.1145/1147954.1147959zbMATH Open1326.68171OpenAlexW2054435341MaRDI QIDQ3546321FDOQ3546321

Authors: Mark-Jan Nederhof, Giorgio Satta 

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://dl.acm.org/citation.cfm?id=1218955.1219024&coll=DL&dl=GUIDE&CFID=66149777&CFTOKEN=88840270

Recommendations

• Probabilistic parsing
• The generative power of probabilistic and weighted context-free grammars
• Probabilistic GLR parsing
• Probabilistic parsing using left corner language models
• scientific article; zbMATH DE number 1154591

zbMATH Keywords

context-free grammarstransductionpush-down automataparsing algorithmsprobabilistic parsing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Cited In (7)

• Prefix probabilities for linear context-free rewriting systems
• Title not available (Why is that?)
• Probabilistic GLR parsing
• The generative power of probabilistic and weighted context-free grammars
• Probabilistic parsing
• Probabilistic parsing using left corner language models
• Robust Parsing Using Dynamic Programming

This page was built for publication: Probabilistic parsing strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546321)