...
首页> 外文期刊>IEEE Transactions on Pattern Analysis and Machine Intelligence >The normalized string editing problem revisited
【24h】

The normalized string editing problem revisited

机译:再谈规范化的字符串编辑问题

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

摘要

Marzal and Vidal (1993) considered the problem of computing the normalized edit distance between two strings, and reported experimental results which demonstrated the use of the measure to recognize hand-written characters. Their paper formulated the theoretical properties of the measure and developed two algorithms to compute it. In this short communication the authors demonstrate how this measure is related to an auxiliary measure already defined in the literature-the inter-string constrained edit distance. Since the normalized edit distance can be computed efficiently using the latter, the analytic and experimental results reported in the above paper can be obtained just as accurately, but more efficiently, using the strategies presented here.
机译:Marzal和Vidal(1993)考虑了计算两个字符串之间的归一化编辑距离的问题,并报告了实验结果,该结果证明了该方法可识别手写字符。他们的论文阐述了该度量的理论特性,并开发了两种算法进行计算。在这段简短的交流中,作者展示了此度量与文献中已定义的辅助度量(字符串间约束编辑距离)如何相关。由于可以使用后者有效地计算归一化编辑距离,因此使用本文介绍的策略可以同样准确但更有效地获得上述论文中报告的分析和实验结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号