Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Substring

Known as: Prefix (formal languages), Suffix (formal languages), Prefix (disambiguation) 
A substring of a string is another string that occurs "in" . For example, "the best of" is a substring of "It was the best of times". This is not to… Expand
Wikipedia

Related topics

Related topics

35 relations
Approximate string matchingBoyer–Moore string search algorithmBoyer–Moore–Horspool algorithmBrace notation
Expand

Broader (1)

String (computer science)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
The Zero Resource Speech Challenge 2019: TTS without T
We present the Zero Resource Speech Challenge 2019, which proposes to build a speech synthesizer without any text or phonetic… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2017
Highly Cited
2017
Enriching Word Vectors with Subword Information
Continuous word representations, trained on large unlabeled corpora are useful for many natural language processing tasks… Expand
Is this relevant?
Highly Cited
2016
Highly Cited
2016
Neural Machine Translation of Rare Words with Subword Units
Neural machine translation (NMT) models typically operate with a fixed vocabulary, but translation is an open-vocabulary problem… Expand
  • figure 1
  • table 2
  • table 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
On the closest string and substring problems
The problem of finding a center string that is "close" to everygiven string arises in computational molecular biology and… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Tandem connectionist feature extraction for conventional HMM systems
Hidden Markov model speech recognition systems typically use Gaussian mixture models to estimate the distributions of… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A maximum-likelihood approach to stochastic matching for robust speech recognition
Presents a maximum-likelihood (ML) stochastic matching approach to decrease the acoustic mismatch between a test utterance and a… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Substring matching for clone detection and change tracking
  • J. H. Johnson
  • Proceedings International Conference on Software…
  • 1994
    • Corpus ID: 15328564
Legacy systems pose problems to maintainers that can be solved partially with effective tools. A prototype tool for determining… Expand
  • table 4.1
  • table 4.2
  • table 4.3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Prosodic Morphology: Constraint Interaction and Satisfaction
Terms of Use: Copyright for scholarly resources published in RUcore is retained by the copyright holder. By virtue of its… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A very fast substring search algorithm
This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend… Expand
  • table 1
  • table 16
  • table 1
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Fast Pattern Matching in Strings
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum… Expand
  • table 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE