Search Results

You are looking at 1 - 10 of 41 items :

  • "language formalization" x
Clear All

Abstract

One of the most salient hallmarks of construction grammar is its approach to argument structure and coercion: rather than positing many different verb senses in the lexicon, the same lexical construction may freely interact with multiple argument structure constructions. This view has however been criticized from within the construction grammar movement for leading to overgeneration. This paper argues that this criticism falls flat for two reasons: (1) lexicalism, which is the alternative solution proposed by the critics, has already been proven to overgenerate itself, and (2) the argument of overgeneration becomes void if grammar is implemented as a problem-solving model rather than as a generative competence model; a claim that the paper substantiates through a computational operationalization of argument structure and coercion in Fluid Construction Grammar. The paper thus shows that the current debate on argument structure is hiding a much more fundamental rift between practitioners of construction grammar that touches upon the role of grammar itself.

first-order formulas. Part II. The construction of first-order formulas. Formalized Mathematics , 13( 1 ):27-32, 2005. [11] Czesław Bylinski. A classical first order language. Formalized Mathematics , 1( 4 ):669-676, 1990. [12] Czesław Bylinski. Functions and their basic properties. Formalized Mathematics , 1( 1 ):55-65, 1990. [13] Czesław Bylinski. Functions from a set to a set. Formalized Mathematics , 1( 1 ):153-164, 1990. [14] Czesław Bylinski. Some basic properties of sets. Formalized Mathematics , 1( 1 ):47-53, 1990. [15] Agata Darmochwał. Finite sets

first order language. Formalized Mathematics , 1( 4 ):669-676, 1990. [11] Czesław Bylinski. Functions and their basic properties. Formalized Mathematics , 1( 1 ):55-65, 1990. [12] Czesław Bylinski. Functions from a set to a set. Formalized Mathematics , 1( 1 ):153-164, 1990. [13] Czesław Bylinski. Some basic properties of sets. Formalized Mathematics , 1( 1 ):47-53, 1990. [14] Agata Darmochwał. Finite sets. Formalized Mathematics , 1( 1 ):165-167, 1990. [15] Kurt G¨odel. Die Vollst¨andigkeit der Axiome des logischen Funktionenkalk¨uls . Monatshefte f

Pogorzelski. Notions and theorems of elementary formal logic . Wydawnictwo UwB - Bialystok, 1994. [12] Piotr Rudnicki and Andrzej Trybulec. On same equivalents of well-foundedness. Formalized Mathematics , 6( 3 ):339–343, 1997. [13] Andrzej Trybulec. Defining by structural induction in the positive propositional language. Formalized Mathematics , 8( 1 ):133–137, 1999. [14] Anita Wasilewska. An Introduction to Classical and Non-Classical Logics . SUNY Stony Brook, 2005. [15] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics , 1 ( 1 ):73

References [1] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics , 1(1):41-46, 1990. [2] Grzegorz Bancerek. A model of ZF set theory language. Formalized Mathematics , 1(1):131-145, 1990. [3] Grzegorz Bancerek. Models and satisfiability. Formalized Mathematics , 1(1):191-199, 1990. [4] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics , 1(1):107-114, 1990. [5] Czesław Byliński. Binary operations. Formalized Mathematics , 1(1):175-180, 1990. [6] Czesław

positive propositional language. Formalized Mathematics , 8( 1 ):133-137, 1999. [12] Zinaida Trybulec. Properties of subsets. Formalized Mathematics , 1( 1 ):67-71, 1990. [13] Edmund Woronowicz. Many-argument relations. Formalized Mathematics , 1( 4 ):733-737, 1990.

References [1] Grzegorz Bancerek. A model of ZF set theory language. Formalized Mathematics , 1(1):131-145, 1990. [2] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics , 1(1):107-114, 1990. [3] Grzegorz Bancerek and Andrzej Trybulec. Miscellaneous facts about functions. Formalized Mathematics , 5(4):485-492, 1996. [4] Czesław Byliński. Basic functions and operations on functions. Formalized Mathematics , 1(1):245-254, 1990. [5] Czesław Byliński. Binary operations. Formalized Mathematics , 1

Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics , 1( 1 ):97-105, 1990. [23] Andrzej Trybulec. Defining by structural induction in the positive propositional language. Formalized Mathematics , 8( 1 ):133-137, 1999. [24] Zinaida Trybulec. Properties of subsets. Formalized Mathematics , 1( 1 ):67-71, 1990. [25] Edmund Woronowicz. Many argument relations. Formalized Mathematics , 1( 4 ):733-737, 1990. [26] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics , 1( 1 ):73-83, 1990. [27] Edmund Woronowicz. Relations

Grabowski. Hilbert positive propositional calculus. Formalized Mathematics , 8( 1 ): 69–72, 1999. [12] Fred Kröger and Stephan Merz. Temporal Logic and State Systems . Springer-Verlag, 2008. [13] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics , 1( 1 ): 115–122, 1990. [14] Andrzej Trybulec. Defining by structural induction in the positive propositional language. Formalized Mathematics , 8( 1 ):133–137, 1999. [15] Zinaida Trybulec. Properties of subsets. Formalized Mathematics , 1( 1 ):67–71, 1990. [16] Edmund Woronowicz. Many argument

calculus. Formalized Mathematics , 8(1): 69–72, 1999. [12] Beata Padlewska. Families of sets. Formalized Mathematics , 1(1):147–152, 1990. [13] Piotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem. Formalized Mathematics , 6(3):335–338, 1997. [14] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics , 1(1): 115–122, 1990. [15] Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics , 1 (2):329–334, 1990. [16] Andrzej Trybulec. Defining by structural induction in the positive propositional language