...
首页> 外文期刊>Moscow University Computational Mathematics and Cybernetics >Some Ways of Determining Word Combinations for Classifying Texts
【24h】

Some Ways of Determining Word Combinations for Classifying Texts

机译:确定文本分类的单词组合的几种方法

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

摘要

Different ways of defining the term "word combinations" are considered. New methods based on syntactic trees are examined, as is the use of n-grams. Terms such as n-chain, n-subtree, and full t-subtrees are introduced. New types of word combinations can serve as the basis for start-of-text characters in problems of computer-assisted teaching. All described types of word combinations are compared to one another in a task of determining authorship, posed as a classification problem.
机译:考虑了定义术语“单词组合”的不同方式。考察了基于语法树的新方法以及n-gram的使用。介绍了诸如n链,n子树和完整的t子树之类的术语。新型单词组合可以作为计算机辅助教学问题中文本开头字符的基础。在确定作者身份的任务中,将所有描述的单词组合类型相互比较,这是分类问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号