首页> 外国专利> METHOD FOR GROUPING SET OF WORDS CAPABLE OF APPEARING IN SET OF NATURAL LANGUAGES

METHOD FOR GROUPING SET OF WORDS CAPABLE OF APPEARING IN SET OF NATURAL LANGUAGES

机译:自然语言集合中可出现的单词集合的分组方法

摘要

PROBLEM TO BE SOLVED: To exactly and speedily group words in natural languages by automatically clustering words in the set of words while using the relation value of suffix relation data, and providing a suffix in the group and group data having equivalent character strings before the suffix. SOLUTION: The input of a box 10 provides information concerning the natural language set and the operation of a box 12 provides the suffix relation data out of that information into a box 14 as the intermediate result. The suffix relation data in the box 14 and the set of words (word 1 to word M) are used for the operation of a box 22. In this operation, the words are clustered while using the relation values and as the final result, the group data showing word groups (word group 1 to word group N) are provided in a box 24. The word group has the suffix similar to one of relations and two or more words having the equivalent character strings before the suffix.
机译:解决的问题:通过使用后缀关系数据的关系值自动对词集中的单词进行聚类,并在后缀之前具有等效字符串的组和组数据中提供后缀,以对自然语言中的单词进行准确而快速的分组。解决方案:框10的输入提供有关自然语言集的信息,框12的操作将该信息中的后缀关系数据作为中间结果提供到框14中。框14的操作使用框14中的后缀关系数据和一组单词(单词1到单词M)。在此操作中,在使用关系值的同时对单词进行聚类,最后结果是在框24中提供了表示单词组(单词组1至单词组N)的组数据。单词组具有与关系之一相似的后缀,并且在后缀之前具有等同字符串的两个或更多个单词。

著录项

  • 公开/公告号JP2000181919A

    专利类型

  • 公开/公告日2000-06-30

    原文格式PDF

  • 申请/专利权人 XEROX CORP;

    申请/专利号JP19990349936

  • 申请日1999-12-09

  • 分类号G06F17/28;G06F17/30;

  • 国家 JP

  • 入库时间 2022-08-22 01:59:21

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号