搜索结果: 1-1 共查到“计算语言学 Splittability”相关记录1条 . 查询时间(0.122 秒)
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...