Mining data from text is often becomes a crucial part of data mining tasks. With the growing tendency of using cloud and sharing more and more files over the internet, the necessity of applying a string matching algorithm in text mining has increased rapidly in present time. These algorithms need to make less character comparisons and pattern shifts while searching. In this paper, we’re proposing a new algorithm named Back and Forth Matching (BFM) algorithm that works faster by matching a pattern from both the forward and backward direction. It shows a tremendous improvement, in comparison to other algorithms, while matching strings in large text files.

中文翻译：

---

BFM：一种前向后字符串匹配算法，具有改进的信息检索移位

从文本中挖掘数据通常成为数据挖掘任务的关键部分。随着使用云和通过互联网共享越来越多的文件的增长趋势，在当前的文本挖掘中应用字符串匹配算法的必要性迅速增加。这些算法在搜索时需要进行较少的字符比较和模式转换。在本文中，我们提出了一种名为“前后匹配（BFM）”算法的新算法，该算法通过从前后方向匹配模式来更快地工作。与其他算法相比，它在匹配大型文本文件中的字符串时显示出巨大的改进。