arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1105.6162cs.CL
收藏

一种用于分词的统计学习算法

A statistical learning algorithm for word segmentation

Microsoft Corporation(微软公司)

Jerry R. Van Aken

摘要:

在自然语音中,说话者在单词之间不会停顿,但人类听者不知何故会将这种连续的音素流视为一系列不同的单词。检测口语单词之间的边界是人类新皮层记忆和识别重复序列的一般能力的一个实例。本文介绍了一种计算机算法,旨在解决定位的问题,从英语文本块中的空格已被删除的词的边界。这个问题避免了语音处理的复杂性,但需要类似的能力来检测重复序列。该算法完全依赖于输入流中字母之间的统计关系来推断单词边界的位置。维特比网格用于同时评估相邻字块的一组假设分割。这种技术提高了准确性,但在输入流中的字母到达和将单词发送到输出流之间会产生很小的延迟。该算法的C++版本的源代码在附录中给出。

英文摘要:

In natural speech, the speaker does not pause between words, yet a human listener somehow perceives this continuous stream of phonemes as a series of distinct words. The detection of boundaries between spoken words is an instance of a general capability of the human neocortex to remember and to recognize recurring sequences. This paper describes a computer algorithm that is designed to solve the problem of locating word boundaries in blocks of English text from which the spaces have been removed. This problem avoids the complexities of speech processing but requires similar capabilities for detecting recurring sequences. The algorithm relies entirely on statistical relationships between letters in the input stream to infer the locations of word boundaries. A Viterbi trellis is used to simultaneously evaluate a set of hypothetical segmentations of a block of adjacent words. This technique improves accuracy but incurs a small latency between the arrival of letters in the input stream and the sending of words to the output stream. The source code for a C++ version of this algorithm is presented in an appendix.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑