搜索结果: 1-8 共查到“计算机科学技术 String”相关记录8条 . 查询时间(0.187 秒)
华南理工大学数据结构与算法课件Chapter4 String。
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string transla-tion, which converts a source tree to a target string. Without reconstructing TAG deriva-tions explicitly, our rule e...
Rule Markov Models for Fast Tree-to-String Translation
Rule Markov Models Fast Tree-to-String Translation
2013/4/22
Most statistical machine translation systems rely on composed rules (rules that can be formed out of smaller rules in the grammar).Though this practice improves translation by weakening independence a...
A Novel Dependency-to-String Model for Statistical Machine Translation
Novel Dependency-to-String Model Statistical Machine Translation
2013/4/22
Dependency structure, as a first step towards semantics, is believed to be helpful to improve translation quality. However, previous works on dependency structure based models typi-cally resort to ins...
Efficient Incremental Decoding for Tree-to-String Translation
Efficient Incremental Decoding Tree-to-String Translation
2013/4/22
Syntax-based translation models should in principlebe efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of language model integr...
String核负实例语法特征提取算法
Kmeans方法 聚类 String核
2009/11/30
通过String核方法把语法数据库中的负实例转化成核矩阵，采用Kmeans聚类算法对核矩阵进行聚类，将原始负实例数据库分成多个容量较小的特征数据表，使大规模O(n3)核矩阵转换为 ( )矩阵，以减少运算量。分析语法检查精度随Kmeans聚类参数的变化规律。实验结果表明，该算法在不降低语法检查精度的前提下提高了语法检查速度。
MORE EFFICIENT ALGORITHMS FOR CLOSEST STRING AND SUBSTRING PROBLEMS
MORE EFFICIENT ALGORITHMS CLOSEST STRING AND SUBSTRING
2012/12/3
The closest string problem and the closest substring problem are all natural theoretical computer science problems and find important applications in computational biology. Given n input strings, the ...
提出通过String Kernel方法把负实例语法数据库中的负实例转化成核矩阵，再用Kernel Principal Component Analysis（KPCA）对转换的核矩阵进行特征提取，进而可将原始负实例数据库按照这些特征分成多个容量较小的特征表。通过构造负实例特征索引表设计了一个分类器，待检查的句子通过此分类器被分配到某个负实例特征表里进行匹配搜索，而此特征表的特征属性数和记录数要远远小...