...
首页> 外文期刊>Information Processing Letters >Word prediction using a clustered optimal binary search tree
【24h】

Word prediction using a clustered optimal binary search tree

机译:使用聚类最佳二叉搜索树的单词预测

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Word prediction methodologies depend heavily on the statistical approach that uses the unigram, bigram, and the trigram of words. However, the construction of the N-gram model requires a very large size of memory, which is beyond the capability of many existing computers. Beside this, the approximation reduces the accuracy of word prediction. In this paper, we suggest to use a cluster of computers to build an Optimal Binary Search Tree (OBST) that will be used for the statistical approach in word prediction. The OBST will contain extra links so that the bigram and the trigram of the language will be presented. In addition, we suggest the incorporation of other enhancements to achieve optimal performance of word prediction. Our experimental results showed that the suggested approach improves the keystroke saving.
机译:单词预测方法在很大程度上取决于使用单词的unigram,bigram和trigram的统计方法。但是,N-gram模型的构造需要非常大的内存,这超出了许多现有计算机的能力。除此之外,这种近似降低了单词预测的准确性。在本文中,我们建议使用计算机集群来构建最佳二进制搜索树(OBST),该树将用于单词预测中的统计方法。 OBST将包含额外的链接,以便将显示该语言的二元组和三元组。此外,我们建议合并其他增强功能以​​实现单词预测的最佳性能。我们的实验结果表明,所提出的方法可以改善按键节省。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号