搜索结果: 1-4 共查到“文学 Context-Free Grammars”相关记录4条 . 查询时间(0.06 秒)
Synchronous Context-Free Grammars and Optimal Parsing Strategies
Synchronous Context-Free Grammars Optimal Parsing Strategies
2016/7/7
The complexity of parsing with synchronous context-free grammars is polynomial in the sentence
length for a fixed grammar, but the degree of the polynomial depends on the grammar. Specifi-
cally, th...
Splittability of Bilexical Context-Free Grammars is Undecidable
Splittability Bilexical Context-Free Grammars Undecidable
2015/9/9
Bilexical context-free grammars (2-LCFGs) have proved to be accurate models for statistical natural language parsing. Existing dynamic programming algorithms used to parse sentences under these models...
Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
Weighted and Probabilistic Context-Free Grammars Equally Expressive
2015/9/2
This article studies the relationship between weighted context-free grammars (WCFGs), where each production is associated with a positive real-valued weight, and probabilistic context-free grammars (P...
An Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars
Chart Parser Arbitrary Probabilistic Context-Free Grammars
2015/6/12
While methods for parsing probabilistic context-free grammars (PCFGs) are well known, a tabular parsing framework for arbitrary PCFGs which allows for botton-up, topdown, and other parsing strategies...