首页> 外国专利> Spell checker with arbitrary length string-to-string transformations to improve noisy channel spelling correction

Spell checker with arbitrary length string-to-string transformations to improve noisy channel spelling correction

机译:具有任意长度的字符串到字符串转换的拼写检查器,可改善嘈杂的通道拼写校正

摘要

A spell checker based on the noisy channel model has a source model and an error model. The source model determines how likely a word w in a dictionary is to have been generated. The error model determines how likely the word w was to have been incorrectly entered as the string s (e.g., mistyped or incorrectly interpreted by a speech recognition system) according to the probabilities of string-to-string edits. The string-to-string edits allow conversion of one arbitrary length character sequence to another arbitrary length character sequence.
机译:基于嘈杂通道模型的拼写检查器具有源模型和错误模型。源模型确定字典中单词w生成的可能性。误差模型根据字符串对字符串的编辑的可能性,确定单词w被错误地输入为字符串s的可能性(例如,语音识别系统输入错误或误解)。字符串到字符串的编辑允许将一个任意长度的字符序列转换为另一任意长度的字符序列。

著录项

  • 公开/公告号US7047493B1

    专利类型

  • 公开/公告日2006-05-16

    原文格式PDF

  • 申请/专利权人 ERIC D. BRILL;ROBERT C. MOORE;

    申请/专利号US20000539357

  • 发明设计人 ERIC D. BRILL;ROBERT C. MOORE;

    申请日2000-03-31

  • 分类号G06F17/21;

  • 国家 US

  • 入库时间 2022-08-21 21:43:11

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号