A stack decoder approach to approximate string matching

Authors:
Juan M. Huerta
Affiliations:
IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
Venue:
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Year:
2010

Citing 5
Cited 1

Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
An efficient A* stack decoder algorithm for continuous speech recognition with a stochastic language model

HLT '91 Proceedings of the workshop on Speech and Natural Language
Example-based machine translation using DP-matching between word sequences

DMMT '01 Proceedings of the workshop on Data-driven methods in machine translation - Volume 14
Fast sequential decoding algorithm using a stack

IBM Journal of Research and Development

An information-retrieval approach to language modeling: applications to social data

WSA '10 Proceedings of the NAACL HLT 2010 Workshop on Computational Linguistics in a World of Social Media

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new efficient algorithm for top-N match retrieval of sequential patterns. Our approach is based on an incremental approximation of the string edit distance using index information and a stack based search. Our approach produces hypotheses with average edit error of about 0.29 edits from the optimal SED result while using only about 5% of the CPU computation.