首页> 外国专利> Computer-implemented methods and systems for entering and searching for non-Roman-alphabet characters and related search systems

Computer-implemented methods and systems for entering and searching for non-Roman-alphabet characters and related search systems

机译:用于输入和搜索非罗马字母字符的计算机实现的方法和系统以及相关的搜索系统

摘要

A computer-implemented method for selecting a desired Roman or non-Roman-alphabet character or objects from a set of non-Roman characters or objects may include steps of providing an association database that includes, for each non-Roman-alphabet character of the set, a Roman alphabet or other phonetic transliteration associated with each said non-Roman-alphabet character and a plurality of entries that are associated with each said non-Roman-alphabet character; receiving a phonetic transliteration of the desired non-Roman-alphabet character or data object and at least one associated entry that is associated with the desired non-Roman-alphabet character or other similar symbolic input; accessing the association database and identifying as candidate characters those characters of the set that are associated with the received phonetic transliteration and with the at least one received associated entry; if a number of candidate characters is greater than one, receiving additional associated entries and repeating the accessing and identifying step until a number of candidate characters is narrowed down to a single candidate character, and providing the single candidate character as the desired non-Roman-alphabet character. Also, derived from the principles described above, this invention includes a variety of methods for improving the efficiency of search engines through use of associations and other means of providing context for the item(s) being searched.
机译:一种用于从一组非罗马字符或对象中选择所需的罗马或非罗马字母字符或对象的计算机实现的方法,可以包括提供关联数据库的步骤,该关联数据库包括针对每个非罗马字母字符或对象的非罗马字母字符。设置与每个所述非罗马字母字符相关联的罗马字母或其他语音音译以及与每个所述非罗马字母字符相关联的多个条目;接收期望的非罗马字母字符或数据对象的语音音译以及与期望的非罗马字母字符或其他类似符号输入相关联的至少一个相关条目;访问关联数据库并将与接收到的语音音译和至少一个接收到的关联条目关联的集合中的那些字符识别为候选字符;如果多个候选字符大于一个,则接收其他关联的条目,并重复访问和标识步骤,直到将多个候选字符缩小为单个候选字符为止,然后将单个候选字符作为所需的非罗马字符字母字符。同样,从上述原理中得出,本发明包括通过使用关联和为被搜索项目提供上下文的其他手段来提高搜索引擎效率的各种方法。

著录项

  • 公开/公告号US7376648B2

    专利类型

  • 公开/公告日2008-05-20

    原文格式PDF

  • 申请/专利权人 RICHARD C. JOHNSON;

    申请/专利号US20040969488

  • 发明设计人 RICHARD C. JOHNSON;

    申请日2004-10-20

  • 分类号G06F17/30;G06F7;G06F3/048;G06F17/28;

  • 国家 US

  • 入库时间 2022-08-21 20:11:23

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号