The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. Th...

If we consider words over the alphabet which is the set of all elements of a semigroup S, then such a word determines an element of S: the product of the letters of the word. S is strongly locally testable if whenever two words over the alphabet S have the same factors of a fixed length k, then the products of the letters of these words are equal. We had previously proved [19] that the syntacti...

Automated precedures for analyzing a given text of some language into a sequence of morphemes representing word classes and flexions, is important for machine translation, for automatic abstracting and indexing, and possibly for other technical purposes. It is a commonplace that an automatic procedure cannot resolve every possible utterance of the language, and it is one among several problems ...

We use the average hamming distance of a population as a syntactic metric to obtain probabilistic bounds on the time convergence of genetic algorithms. Analysis of a at function provides worst case time complexity for static functions and gives a theoretical basis to the problem of premature convergence. We suggest simple changes that mitigate this problem and help ght deception. Further, emplo...

Target-dependent sentiment analysis investigates the sentiment polarities on given target mentions from input texts. Different from sentence-level sentiment, it offers more fine-grained knowledge on each entity mention. While early work leveraged syntactic information, recent research has used neural representation learning to induce features automatically, thereby avoiding error propagation of...

The goal of this article is to present our work about a combination of several syntactic parsers to produce a more robust parser. We have built a platform which allows us to compare syntactic parsers for a given language by splitting their results in elementary pieces, normalizing them, and comparing them with reference results. The same platform is used to combine several parsers to produce a ...

Minimalist grammars (MGs) and multiple context-free grammars (MCFGs) are weakly equivalent in the sense that they define the same languages, a large mildly context-sensitive class that properly includes context-free languages. But in addition, for each MG, there is an MCFG which is strongly equivalent in the sense that it defines the same language with isomorphic derivations. However, the struc...

Any language has as part of its structure patterns according to which items are arranged on each of its strata. The term tactics is widely used for the analysis and description of arrangements, and the term syntax is traditionally used with reference to arrangements on the morphemic straturn. It is in connection with that stratum that the study of tactics of greatest interest in linguistics. Th...