Showing papers on "Concatenation published in 1974"

Electronic digital system and method for reproducing languages using the Arabic-Farsi script

Abstract: A system for mechanically reproducing language characters in a cursive form in accordance with the natural style calligraphy of the language. Written letters are characterized by "links" with preceding and following characters, and mathematical rules describe the cursive script in terms of the form each letter takes dependent upon the preceding and following characters. The system includes input means for inserting characters, one at a time, and for providing coded representations of the characters. The coded representations are fed to decoder means which has as an output a selected combination of concatenation properties applicable to the character. Analyzer means analyzes variables dependent on the concatentation properties of a successive string of characters which comprise a character under consideration, a preceding character and a following character. The analyzer means then provides a further coded representation of a particular concatenation property applicable to the character under consideration when the character under consideration is preceded by the preceding character and followed by the following character. The coded representation and the further coded representation are combined in a combining means to provide a composite coded representation containing information relative to a character and to its applicable concatenation properties. Means are provided for converting the composite code to a code suitable for driving output means.

Discrete phenomena in uniqueness in the Cauchy problem

Abstract: The concatenation method, recently applied to the study of solvability and hypoellipticity of linear partial differential equations with double characteristics, is used to show that uniqueness in the Cauchy problem, for certain degenerate hyperbolic equations, depends on whether the lower order terms (precisely, the subprincipal part) assume or not certain values belonging to a sequence of complex numbers»

Rule‐synthesis of speech by word concatenation: a first step

Abstract: Some preliminary work on rule‐synthesis of speech by word concatenation is described. Words spoken in isolation were analyzed to extract their pitch, formant, duration, and amplitude parameters. The parametric representations of the words were concatenated and modified, and speech was synthesized from the modified parameters. An experiment was run to determine which parameters required modification to achieve natural prosody in the concatenated speech. The results indicated that the only parameter requiring substantial contextual modification was pitch; modifications of segment duration and formant coarticulation had minimal effects on prosody. These results were incorporated into a scheme for rule‐synthesis of telephone numbers by digit concatenation. An evaluation experiment found the rule‐concatenated numbers to be as comprehensible as naturally spoken numbers, and as pleasant as numbers resynthesized from naturally spoken numbers.

A programming system for studies in speech synthesis

Abstract: This paper describes a speech synthesis system which is particularly suitable for experimental investigations. The synthesis is accomplished in two stages. The concatenation stage generates a schematized spectrographic representation corresponding to the symbolic input. The second stage consists in generating the corresponding acoustic signal. The steady state characterization of each phoneme is supplied as data. Independent concatenation procedures incorporate context dependent effects such as format transitions, changes in the normal duration of vowels, etc. The parameter values for these procedures are obtained by a set of rules. Applicability of a rule is determined by attributes assigned to the phonemes. The phonemes are divided into classes and subclasses by the attribute assignment. The attribute STOP, for instance, defines the class of all stop consonants and BILABIAL STOP would define the set/p, b, m/. Thus, a rule specifies a parameter value when a subclass of phonemes occur, in the context of another subclass. Such a formulation considerably reduces the number of rules. The classification as well as the rules are supplied as data to the system, giving it considerable flexibility. The spectrographic output of the concatenation stage is used to actuate a simulated series terminal analog synthesizer. Rudimentary prosodics are incorporated which modify a monotonous pitch contour with stress markers and interrogative or declarative termination of a sentence.

Characterization of context-free grammatical families

Abstract: Two characterization theorems for the class of context-free grammatical families are given. The characterizations are expressed in terms of the family of regular sets, the family of linear sets, and the following language-family operators: union, concatenation, the full semi-AFL operator, the full AFL operator, and a new ternary substitution operator.

Speech Synthesis System Integrating Formant‐Coded Words and Computer‐Generated Stress Parameters

Abstract: This paper describes an experiment in which an earlier system of speech synthesis based on concatenation of formant‐coded words [Rabiner, Schafer, and Flanagan, “Speech Synthesis by Concatenation of For‐mant Coded Words,” Bell Syst. Tech. J. (May 1971)] was integrated with an automatic system for generating prosodic information [Coker, Umeda, and Browman, “Automatic Synthesis for Ordinary English Text,” IEEE Trans. Audio Electrnacoust. (June 1973)]. An experimental investigation of the resulting system was made to determine the importance of various prosodic factors on the general quality of the synthetic speech. Of primary concern were procedures for altering the pitch and timing of the basic word data as well as the method of merging isolated words at the boundary between words. Listener preference tests were conducted with the aim of determining which. factors were important in improving the general quality of the synthetic speech. The results of these tests indicate that the rule‐generated prosody was preferred to simple alternatives such as obtaining prosodic information directly from the isolated words that comprise the utterance. Several examples of utterances synthesized by the resulting system are given.

Application of the Boolean-difference technique to sequential logic

Abstract: The letter describes the application of the Boolean-difference technique to sequential circuits by demonstrating that the sequential property of memory can be attributed to the concatenation of two sensitive paths. This leads to a behavioural description of a JK bistable, forming a basis for test generation for sequential networks.