In this paper we argue that the Japanese causative constructions should be viewed as a complex predicate having two possible c-structure realizations (i.e. a single monoclausal f-structure, and monoclausal and biclausal c-structures). Along with the Optimality Theory architecture, we suggest that the emergence of two c-structures in predicate composition is a consequence of the interactions tha...

If a locale is presented by a “flat site”, it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is derived for compactness of the locale (and also for its openness). Although its derivation uses impredicative constructions, it is also shown predicatively using the inductive generation of formal topologies. A predicative proof of ...

the concepts of structural optimization was introduced about sixty years ago. smiths from the university of los angeles (california) for the first time has offered the combination of finite element method and optimization techniques to design optimum structures (1960). at present time, this techniques are generally understood and many softwares for this perpose have been developed. in this pape...

We describe a model of grammar learning in which all linguistic units are grounded in rich conceptual representations, and larger grammatical constructions involve relational mappings between form and meaning that are built up from smaller (e.g., lexical) constructions. The algorithm we describe for acquiring these grammatical constructions consists of three separate but interacting processes: ...

Concord adverbial constructions in Korean show unbounded dependency relationships between two non-empty entities. There are two different types of unboundedness involved: one between a concord adverbial and a verbal ending and the other between the adverbial as a modifier and a predicate. In addition, these unboundedness relationships exhibit properties of “downward movement” phenomena. In this...

This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the pr...