scispace - formally typeset
Search or ask a question
Topic

String (computer science)

About: String (computer science) is a research topic. Over the lifetime, 19430 publications have been published within this topic receiving 333247 citations. The topic is also known as: str & s.


Papers
More filters
Journal ArticleDOI
TL;DR: NICD, a generalization of noise sensitivity previously considered in [5, 31, 39], is extended to trees and the use of thereverse Bonami-Beckner inequality is used to prove a new isoperimetric inequality for the discrete cube and a new result on the mixing of short random walks on the cube.
Abstract: In this paper we studynon-interactive correlation distillation (NICD), a generalization of noise sensitivity previously considered in [5, 31, 39]. We extend the model toNICD on trees. In this model there is a fixed undirected tree with players at some of the nodes. One node is given a uniformly random string and this string is distributed throughout the network, with the edges of the tree acting as independent binary symmetric channels. The goal of the players is to agree on a shared random bit without communicating.

129 citations

Patent
28 Sep 2005
TL;DR: In this paper, methods and systems for selecting a language for text segmentation are disclosed. But they do not specify a language classifier for each of the candidate languages and the second candidate language associated with a string of characters.
Abstract: Methods and systems for selecting a language for text segmentation are disclosed. In one embodiment, at least a first candidate language and a second candidate language associated with a string of characters are identified, at least a first segmented result associated with the first candidate language and a second segmented result associated with the second candidate language are determined, a first frequency of occurrence for the first segmented result and a second frequency of occurrence for the second segmented result are determined, and an operable language is identified from the first candidate language and the second candidate language based at least in part on the first frequency of occurrence and the second frequency of occurrence.

128 citations

Journal ArticleDOI
TL;DR: Two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w are given and several properties and applications of LPF are investigated.

128 citations

Journal ArticleDOI
TL;DR: It is shown that the property of being superprimitive is testable on a string of n symbols in O(n) time and space.

128 citations

Patent
09 Mar 2009
TL;DR: In this article, an algorithm for synthesizing speech from text strings associated with media assets is presented. But the algorithm is not suitable for the case where each text string can be associated with a native string language (e.g., the language of the string).
Abstract: Algorithms for synthesizing speech used to identify media assets are provided. Speech may be selectively synthesized from text strings associated with media assets, where each text string can be associated with a native string language (e.g., the language of the string). When several text strings are associated with at least two distinct languages, a series of rules can be applied to the strings to identify a single voice language to use for synthesizing the speech content from the text strings. In some embodiments, a prioritization scheme can be applied to the text strings to identify the more important text strings. The rules can include, for example, selecting a voice language based on the prioritization scheme, a default language associated with an electronic device, the ability of a voice language to speak text in a different language, or any other suitable rule.

128 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Tree (data structure)
44.9K papers, 749.6K citations
86% related
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Computational complexity theory
30.8K papers, 711.2K citations
82% related
Supervised learning
20.8K papers, 710.5K citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
2021491
2020704
2019759
2018816
2017806