A stack decoder approach to approximate string matching

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

• Publication date

  2010-07-19

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1835449.1835634
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Hybrid Indexing Method for Approximate String Matching

  2007cited by this paper
• Example-based machine translation using DP-matching between work sequences

  2001cited by this paper
• A guided tour to approximate string matching

  2001cited by this paper
• An Efficient A* Stack Decoder Algorithm for Continuous Speech Recognition with a Stochastic Language Model

  1992influential reference
• Fast sequential decoding algorithm using a stack

  1969influential reference

• Subsequence similarity language models

  2011cites this paper
• Towards Efficient Translation Memory Search Based on Multiple Sentence Signatures

  2011influential citation
• An Information-Retrieval Approach to Language Modeling: Applications to Social Data

  2010cites this paper