نتایج جستجو برای: word equations
تعداد نتایج: 342793 فیلتر نتایج به سال:
This paper describes a tabular method of nding the word string, together with its dependency structure, that has the maximum preference score in a given series of word sets. The technique, which originated in the problem of constraining the process of Japanese speech recognition by linguistic knowledge, is potentially applicable to parsing and disambiguation of various natural languages. The pr...
A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fixed B, we can view a symmetric word, S(A, B), as a map from the set of positive definite matrices into itself. Given positive definite P , B, and a symmetric word, S(A, B), with positive powers of A, ...
Social media has become an important avenue of Word-of-mouth (WOM) and a recent study has found blogging to be an important lead-generation source among social media options. This article examines the dynamic interrelationship between word-of-blog volume and sales by using the movie industry as the research context. By employing the Granger Causality test and modeling the interrelationship thro...
Although Makanin proved the problem of satisfiability of word equations to be decidable, the general structure of solutions is difficult to describe. In particular, Hmelevskii proved that the set of solutions of xyz= zvx cannot be described using only finitely many parameters, contrary to the case of equations in three unknowns. In this paper we give a short, elementary proof of Hmelevskii’s re...
This paper studies the semi-global robust output regulation problem for the class of nonlinear affine systems in normal form. The same problem was studied before by Khalil under the assumption that the solution of the regulator equations is polynomial. By using the nonlinear internal model approach, we have relaxed the polynomial assumption on the solution of the regulator equations. Key word: ...
conclusions the findings of this study indicate that the frequency of disfluencies was increased in difficult syllable structures in comparison to simple syllable structures. according to the results, it seems that certain linguistic features, such as syllable structure can affect speech-motor output in people who stutter through affecting phonological encoding. background stuttering is one of ...
We develop a model of phonological contrast in natural language. Specifically, the model describes the maintenance of contrast between different words in a language, and the elimination of such contrast when sounds in the words merge. An example of such a contrast is that provided by the two vowel sounds i and e, which distinguish pairs of words such as pin and pen in most dialects of English. ...
We solve a long-standing open problem on word equations by proving that if the words x0, . . . , xn satisfy the equation x0 = x1 · · ·xn for three positive values of k, then the words commute. One of our methods is to assign numerical values for the letters, and then study the sums of the letters of words and their prefixes. We also give a geometric interpretation of our methods. 1998 ACM Subje...
We consider the problem of solving equations over k-ary trees. Here an equation is a pair of labeled-ary trees, where is a function associating an arity to each label. A solution to an equation is a morphism from-ary trees to k-ary trees that maps the left and right hand side of the equation to the same k-ary tree. This problem is a generalization of the word uniication problem posed by A. Mark...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید