The extended longest common substring algorithm for spoken document retrieval

The paper considers the spoken document retrieval problem. The proposed method uses a length of the longest common substring (LCS) algorithm for detection of query words. This method based on phoneme recognition of a spoken document. Also this method is compared with a text retrieval methods based on a vector space model. Use of a length of LCS and phoneme recognition improves retrieval effectiveness.