6 citations found. Retrieving documents...
Anna Szabolcsi. Combinatory grammar and projection from the lexicon. In Ivan A. Sag and Anna Szabolcsi, editors, Lexical Matters. CSLI, Stanford, 1992.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Combinatory Logic and Natural Language Parsing - Bozsahin   (Correct)

....rules: Bfg x:f(gx) Some combinators, such as W (duplicator) and K (cancellator) have more of a lexical function, and do not operate at the syntactic level. For instance, W has the definition W = fx:fxx, which seems to suit the nature of reflexives (e.g. John 9 saw himself in the mirror) [15]. Section 3 explains how the syntactic rules and their semantic counterparts can be modeled computationally to obtain semantic forms from surface structures. 3 Parsing into Combinator Expressions Example (7) can now be written in combinator notation (11) instead of calculus. book ACC A.NOM ....

Anna Szabolcsi. Combinatory grammar and projection from the lexicon. In Ivan A. Sag and Anna Szabolcsi, editors, Lexical Matters. CSLI, Stanford, 1992.


The Nature of Lexical Knowledge - McCray (1998)   (1 citation)  (Correct)

....level and its most important instrument of communication. Leonhard Lipka, 1990. 2:ix] This paper considers the nature of lexical knowledge and its role in language and information processing. The lexicon is the central component of language and plays a pivotal role in current linguistic theory [3,4] and, increasingly, in natural language processing systems [5,6,7] The lexicon embodies information about the lexical items of the language and serves as the foundation for morphologic, syntactic, and semantic processing. The differences as well as commonalities among dictionaries, thesauri, and ....

.... angular notch of stomach , and aortic notch . Lexicons may take a variety of forms, but in recent linguistic theory, the lexicon is taken to be an important component of language with a status equal to the other components of language, including phonology, morphology, syntax, and semantics [2,3,4]. Chomsky [3:29] introduces the notion that representations at all levels of the language are projected from the lexicon. In other words, the information that we as humans store in our mental lexicons is critical to (is projected onto) our understanding of language at all levels. He goes on to ....

Szabolcsi A. Combinatory Grammar and Projection from the Lexicon. In: Sag IA and Szabolcsi A (eds). Lexical Matters. Center for the Study of Language and Information, 1992, 241-68.


A Hypothetical Reasoning Algorithm for Linguistic Analysis - König (1994)   (Correct)

....and others. The Lambek calculus LN , the deduction mechanism of a Lambek categorial grammar, includes the inference rules of a basic categorial grammar plus two rules of functional abstraction or operator introduction. 1 More recent work on Combinatory Categorial Grammar includes e.g. 29] and [30] 3 Definition 4 (Operator introduction rules) T non empty sequence of categories; i not previously used number. y; T x = y] i ; T x j (ynx) i (nIntr) T ; y x = T ; y] i x j (x=y) i ( Intr) The category y is not a member of the initial category sequence of the input ....

Anna Szabolcsi. Combinatory grammar and projection from the lexicon. In Ivan Sag and Anna Szabolcsi, editors, Lexical Matters. 1989.


Grammatical Functions and Word Order in Combinatory Grammar - Bozsahin (1997)   (Correct)

.... f g backward Y=Z XnY ) B Theta X=Z crossing g f Substitution forward (X=Y) Z Y=Z ) S X=Z f g Sj fgx:fx(gx) backward YnZ (XnY)nZ ) S XnZ Sfgx:fx(gx) g f a Although A is not a true combinator but a primitive of the combinatory system, it can be written as a combinator for convenience, as in (Szabolcsi, 1992). In the examples, it is stripped off the combinatory form by simple juxtaposition. Reduction rules for combinators are written with two arguments to show the correspondence between interpretations and the binary CCG rules. XY and X Y denote one step and finite step reduction of X to Y . rules ....

....for arity reducers (passive) arity increasers (causative) argument reducers (reflexive) etc. can be given combinatory interpretations. Below, we outline the p 2 cases for the passive and revdraft.tex; 16 09 1997; 13:43; no v. p.30 Grammatical Functions and Word Order 31 the causative. Szabolcsi (1992) provided a combinatory account of reflexives, which is compatible with the system proposed here. We assume the following category assignments for the English agentless passive: be : IV=TV pastp : PASS en : TV pastp nTV: I Mary saw John (s 0 j 0 m 0 ) correlates with the passive ....

Szabolcsi, A.: 1992, `Combinatory Grammar and Projection from the Lexicon'. In: I. A. Sag and A. Szabolcsi (eds.): Lexical Matters. Stanford: CSLI.


Noun incorporation and the Mohawk lexicon - Malouf (1994)   (1 citation)  (Correct)

....tend to be underdetermined by the lexicon is that most theories are extremely neutral as to what kinds of objects lexical items are. Given this neutrality, the choice of syntactic tools is extremely free, so the laws of syntax turn out to be rather independent of lexical substance . (Szabolcsi 1992, 242) In a parallel development, with the rise of functional projections and incorporation theory, the trend in recent GB work has been to treat everything as a syntactic process. Baker sums up this position. I have argued. that most or all of productive, semantically transparent ....

Szabolcsi, Anna. 1992. Combinatory grammar and projection from the lexicon. In Ivan A.


Combinatory Logic and Natural Language Parsing - Bozsahin   (Correct)

....rules: Bfg x:f(gx) Some combinators, such as W (duplicator) and K (cancellator) have more of a lexical function, and do not operate at the syntactic level. For instance, W has the definition W def = fx:fxx, which seems to suit the nature of reflexives (e.g. John saw himself in the mirror) [15]. Section 3 explains how the syntactic rules and their semantic counterparts can be modeled computationally to obtain semantic forms from surface structures. 3 Parsing into Combinator Expressions Example (7) can now be written in combinator notation (11) instead of calculus. 11) kitab Ayse ....

Anna Szabolcsi. Combinatory grammar and projection from the lexicon. In Ivan A. Sag and Anna Szabolcsi, editors, Lexical Matters. CSLI, Stanford, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC