The interpretation of sentences with plural determiners and collective predicates is a highly complex problem that has not been sufficiently investigated, despite many advances in theories of plurality and quantification. This paper proposes a new typology of predicates that serves as a basis for a general treatment of singular and plural noun phrases within generalized quantifier theory. Secti...

We analyse Hindi complex predicates and propose linguistic tests for their detection. This analysis enables us to identify a category of V+V complex predicates called lexical compound verbs (LCpdVs) which need to be stored in the dictionary. Based on the linguistic analysis, a simple automatic method has been devised for extracting LCpdVs from corpora. We achieve an accuracy of around 98% in th...

Abeillé and Godard (1994) seek to show that the rightward branching analysis of French tense auxiliaries shown in (1b), that I argued for in Manning (1992) and which is widely adopted in general, is wrong, and that rather we should adopt a flat analysis for this construction as shown in (1c), and they show how such an analysis can be realized within HPSG (Pollard and Sag 1994). (1) a. Je I vous...

English was long considered the only language to possess Verb Phrase Ellipsis (VPE), a process in which a verb phrase, identified in many standard accounts with the vP, goes missing under identity with the vP of an antecedent clause. An example of VPE in English is given in (1), where the elements struck through are not pronounced. A schematization of the relevant part of the structure is given...

In this paper we analyse the interdependence of Persian nonverbal (NV) element and the light verb (LV) in determining the syntactic properties, the event structure, and the alternation possibilities of the entire complex predicate (CP) and we argue that these properties provide strong evidence against a Lexicalist approach to such phenomena. Further we show how these facts may be naturally acco...

Complex Predicates are a crosslinguistically general phenomenon, but are more pervasive in South Asian than in European languages. This paper describes an LFG solution for Urdu/Hindi complex predication in terms of a RESTRICTION OPERATOR. The solution is theoretically well motivated and can be extended straightforwardly to related phenomena in European languages such as German, Norwegian, and F...

This paper addresses the problem of forbidden states of non safe Petri Net (PN) modelling discrete events systems. To prevent the forbidden states, it is possible to use conditions or predicates associated with transitions. Generally, there are many forbidden states, thus many complex conditions are associated with the transitions. A new idea for computing predicates in non safe Petri nets will...