Complex conjunctions and determiners are often considered as pretokenized units in parsing. This is not always realistic, since they can be ambiguous. We propose a model for joint dependency parsing and multiword expressions identification, in which complex function words are represented as individual tokens linked with morphological dependencies. Our graphbased parser includes standard secondo...

The article is an attempt to prove dependence in the location of information perspective peaks polypredicative complex sentences English-language prose on peculiarities their formal and grammatical structuring. author proves that number such directly related syntactic structure hypotactic construction. One peak common for with heterogeneous co-subordination dependent clauses, consecutive subord...

Visual processing of objects in the absence of focused attention appears to be limited. We varied the degree of attention, or visual processing, that observers paid to objects using an instruction set manipulation. In 2 experiments, subjects performed tasks that required superficial or detailed visual analysis of the objects involved. In subsequent recognition tests, information about conjuncti...

In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input domain. We consider distribution-free testing of several basic Boolean function classes over {0, 1}, namely monotone conjunctions, general conjunctions, decision lists, and linear threshold functions. We prove that for eac...

A generalization of the minimal hitting-set algorithm given by deKleer and Williams is presented. The original algorithm handles only one faulty mode per component and only positive conflicts. In contrast, the new algorithm presented here handles more than two modes per component and also non-positive conflicts. The algorithm computes a logical formula that characterizes all diagnoses. Instead ...

Determining the correct structure of coordinating conjunctions and the syntactic constituents that they coordinate is a difficult task. This subtask of syntactic parsing is explored here for biomedical scientific literature. In particular, the intuition that sentences containing coordinating conjunctions can often be rephrased as two or more smaller sentences derived from the coordination struc...

It is known that a theory in S5-epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas. We show that this asymmetry between syntax and semantics persists also when infinite conjunctions (up to some...

A new numerical approach of nding out the full and reduced structural descriptions of an object (image) or class is suggested in the paper. These structural descriptions are based on the Boolean formulas obtained by a learning procedure. The conjunctions for each object at the rst level of generalization are considered as features. At the next level of generalization the relationship between co...

The recognition of named entities is now a well-developed area, with a range of symbolic and machine learning techniques that deliver high accuracy extraction and categorisation of a variety of entity types. However, there are still some named entity phenomena that present problems for existing techniques; in particular, relatively little work has explored the disambiguation of conjunctions app...

In this paper we seek to provide greater automation for formal deductive verification tools working with continuous and hybrid dynamical systems. We present an efficient procedure to check invariance of conjunctions of polynomial equalities under the flow of polynomial ordinary differential equations. The procedure is based on a necessary and sufficient condition that characterizes invariant co...