搜索结果: 1-1 共查到“计算语言学 Reduced Complexity”相关记录1条 . 查询时间(0.125 秒)
Finite-State Chart Constraints for Reduced Complexity Context-Free Parsing Pipelines
Finite-State Chart Reduced Complexity Parsing Pipelines
2015/9/10
We present methods for reducing the worst-case and typical-case complexity of a context-free parsing pipeline via hard constraints derived from finite-state pre-processing. We perform O(n) predictions...