File Information

File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/metho/04/n04-2004_metho.xml

Size: 14,379 bytes

Last Modified: 2025-10-06 14:08:53

<?xml version="1.0" standalone="yes"?>
<Paper uid="N04-2004">
  <Title>A Computational Framework for Non-Lexicalist Semantics</Title>
  <Section position="3" start_page="0" end_page="0" type="metho">
    <SectionTitle>
2 Event Structure
</SectionTitle>
    <Paragraph position="0"> It has previously been argued that representations based on a fixed collection of semantic roles cannot adequately capture natural language semantics. The actual inventory of semantic roles, along with precise definitions and diagnostics, remains an unsolved problem; see (Levin and Rappaport Hovav, 1996). Fixed roles are too coarse-grained to account for certain semantic distinctions--the only recourse, to expand the inventory of roles, comes with the price of increased complexity, e.g., in the syntaxto-semantics mapping.</Paragraph>
    <Paragraph position="1"> There is a general consensus among theoretical linguists that the proper representation of verbal argument structure is event structure--representations grounded in a theory of events that decompose semantic roles in terms of primitive predicates representing concepts such as causality and inchoativity (Dowty, 1979; Jackendoff,  1983; Pustejovsky, 1991b; Rappaport Hovav and Levin, 1998). Consider the following example: (2) He sweeps the floor clean.</Paragraph>
    <Paragraph position="2"> [ [ DO(he, sweeps(the floor)) ] CAUSE [ BECOME [ clean(the floor) ] ] ] Dowty breaks the event described by (2) into two subevents, the activity of sweeping the floor and its result, the state of the floor being clean. A more recent approach, advocated by Rappaport Hovav and Levin (1998), describes a basic set of event templates corresponding to Vendler's event classes (Vendler, 1957): (3) a. [ x ACT&lt;MANNER&gt; ] (activity)</Paragraph>
    <Paragraph position="4"> A process called Template Augmentation allows basic event templates to be freely &amp;quot;augmented&amp;quot; to any other event template. This process, for example, explains the resultative form of surface contact verbs like sweep:  (4) a. Phil swept the floor.</Paragraph>
    <Paragraph position="5"> [ Phil ACT&lt;SWEEP&gt; floor ] b. Phil swept the floor clean.</Paragraph>
    <Paragraph position="7"> Following this long tradition of research, I propose a syntactically-based event representation specifically designed to handle alternations in argument structure. Furthermore, I will show how this theoretical analysis can be implemented in a feature-driven computational framework. The product is an agenda-driven, chart-based parser for the Minimalist Program.</Paragraph>
  </Section>
  <Section position="4" start_page="0" end_page="0" type="metho">
    <SectionTitle>
3 A Decompositional Framework
</SectionTitle>
    <Paragraph position="0"> A primary advantage of decompositional (non-lexicalist) theories of lexical semantics is the ability to transparently relate morphologically related words--explaining, for example, categorial divergences in terms of differences in event structure. Consider the adjective flat and the deadjectival verb flatten:  (5) a. The tire is flat.</Paragraph>
    <Paragraph position="1"> b. The tire flattened.</Paragraph>
    <Paragraph position="2">  Clearly, (5a) is a stative sentence denoting a static situation, while (5b) denotes an inchoative event, i.e., a transition from &amp;quot;tire is not flat&amp;quot; to &amp;quot;tire is flat&amp;quot;. One might assign the above two sentence the following logical form: (6) a. BE(tire;[state flat]) b. ARG-(tire;e)^ BECOME(BE([state flat]);e) In Davidsonian terms, dynamic events introduce event arguments, whereas static situations do not. In (6b), the semantic argument that undergoes the change of state (ARG-) is introduced externally via the event argument. Considering that the only difference between flat.ADJ and flatten.V is the suffix -en, it must be the source of inchoativity and contribute the change of state reading that distinguishes the verb from the adjective. Here, we have evidence that derivational affixes affect the semantic representation of lexical items, that is, fragments of event structure are directly associated with derivational morphemes. We have the following situation:</Paragraph>
    <Paragraph position="4"> In this case, the complete event structure of a word can be compositionally derived from its component morphemes. This framework, where the &amp;quot;semantic load&amp;quot; is spread more evenly throughout the lexicon to lexical categories not typically thought to bear semantic content, is essentially the model advocated by Pustejovsky (1991a), among many others. Note that such an approach is no longer lexicalist: each lexical item does not fully encode its associated syntactic and semantic structures. Rather, meanings are composed from component morphemes.</Paragraph>
    <Paragraph position="5"> In addition to -en, other productive derivational suffixes in English such as -er, -ize, -ion, just to name a few, can be analyzed in a similar way. In fact, we may view morphological rules for composing morphemes into larger phonological units the same way we view syntactic rules for combining constituents into higher-level projections, i.e., why distinguish VP ! V + NP from V ! Adj + -en? With this arbitrary distinction erased, we are left with a unified morpho-syntactic framework for integrating levels of grammar previously thought to be separate--this is indeed one of the major goals of Distributed Morphology. This theoretical framework translates into a computational model better suited for analyzing the semantics of natural language, particularly those rich in morphology.</Paragraph>
    <Paragraph position="6"> A conclusion that follows naturally from this analysis is that fragments of event structure are directly encoded in the syntactic structure. We could, in fact, further postulate that all event structure is encoded syntactically, i.e., that lexical semantic representation is isomorphic to syntactic structure. Sometimes, these functional elements are overtly realized, e.g., -en. Often, however, these functional elements responsible for licensing event interpretations are not phonologically realized.</Paragraph>
    <Paragraph position="7"> These observations and this line of reasoning has not escaped the attention of theoretical linguists: Hale and Keyser (1993) propose that argument structure is, in fact, encoded syntactically. They describe a cascading verb phrase analysis with multiple phonetically empty verbal projections corresponding to concepts such as inchoativity and agentivity. This present framework builds on the work of Hale and Keyser, but in addition to advancing a more refined theory of verbal argument structure, I also describe a computational implementation.</Paragraph>
  </Section>
  <Section position="5" start_page="0" end_page="0" type="metho">
    <SectionTitle>
4 Event Types
</SectionTitle>
    <Paragraph position="0"> Although the study of event types can be traced back to Aristotle, it wasn't until the twentieth century when philosophers and linguists developed classifications of events that capture logical entailments and the co-occurrence restrictions between verbs and other syntactic elements such as tenses and adverbials. Vendler's (1957) four-way classification of events into states, activities, accomplishments, and achievements serves as a good starting point for a computational ontology of event types.</Paragraph>
    <Paragraph position="1"> Examples of the four event types are given below:  paint a picture recognize make a chair find Under Vendler's classification, activities and states both depict situations that are inherently temporally unbounded (atelic); states denote static situations, whereas activities denote on-going dynamic situations. Accomplishments and achievements both express a change of state, and hence are temporally bounded (telic); achievements are punctual, whereas accomplishments extend over a period of time. Tenny (1987) observes that accomplishments differ from achievements only in terms of event duration, which is often a question of granularity. From typological studies, it appears that states, change of states, and activities form the most basic ontology of event types. They correspond to the primitives BE, BE-COME, and DO proposed by a variety of linguists; let us adopt these conceptual primitives as the basic vocabulary of our lexical semantic representation.</Paragraph>
    <Paragraph position="2"> Following the non-lexicalist tradition, these primitives are argued to occupy functional projections in the syntactic structure, as so-called light verbs. Here, I adopt the model proposed by Marantz (1997) and decompose lexical verbs into verbalizing heads and verbal roots. Verbalizing heads introduce relevant eventive interpretations in the syntax, and correspond to (assumed) universal primitives of the human cognitive system. On the other hand, verbal roots represent abstract (categoryless) concepts and basically correspond to open-class items drawn from encyclopedic knowledge. I assume an inventory of three verbalizing heads, each corresponding to an aforementioned primitive:</Paragraph>
    <Paragraph position="4"> The light verb vDO licenses an atelic non-inchoative event, and is compatible with verbal roots expressing activity. It projects a functional head, voice (Kratzer, 1994), whose specifier is the external argument.</Paragraph>
    <Paragraph position="5">  The entire voiceP is further embedded under a tense projection (not shown here), and the verbal complex undergoes head movement and left adjoins to any overt tense markings. Similarly, the external argument raises to [Spec, TP]. This is in accordance with modern linguistic theory, more specifically, the subject-internal hypothesis. The verbal root can itself idiosyncratically license a DP to give rise to a transitive sentence (subjected, naturally, to selectional restrictions). These constructions correspond to what Levin calls &amp;quot;non-core transitive sentences&amp;quot; (1999):  The structure denotes an event where an entity undergoes a change of state to the end state specified by the root. v-P can be optionally embedded as the complement of a vDO, accounting for the causative/inchoative alternation. Cyclic head movement (incorporation) of the verbal roots into the verbalizing heads up to the highest verbal projection accounts for the surface form of the sentence.</Paragraph>
    <Paragraph position="7"> Note that in the causative form, vDO is unmodified by a verbal root--the manner of activity is left unspecified, i.e., &amp;quot;John did something that caused the window to undergo the change of state break.&amp;quot; Given this framework, deadjectival verbs such as flatten can be directly derived in the syntax:  (15) The tire flattened.</Paragraph>
    <Paragraph position="9"> In (Lin, 2004), I present evidence from Mandarin Chinese that this analysis is on the right track. The rest of this paper, however, will be concerned with the computational implementation of my theoretical framework.</Paragraph>
  </Section>
  <Section position="6" start_page="0" end_page="0" type="metho">
    <SectionTitle>
5 Minimalist Derivations
</SectionTitle>
    <Paragraph position="0"> My theory of verbal argument structure can be implemented in a unified morpho-syntactic parsing model that interleaves syntactic and semantic parsing. The system is in the form of an agenda-driven chart-based parser whose foundation is similar to previous formalizations of Chomsky's Minimalist Program (Stabler, 1997; Harkema, 2000; Niyogi, 2001).</Paragraph>
    <Paragraph position="1"> Lexical entries in the system are minimally specified, each consisting of a phonetic form, a list of relevant features, and semantics in the form of a , expression.</Paragraph>
    <Paragraph position="2"> The basic structure building operation, MERGE, takes two items and creates a larger item. In the process, compatible features are canceled and one of the items projects. Simultaneously, the , expression associated with the licensor is applied to the , expression associated with the licensee (in theoretical linguistic terms, SpellOut). null The most basic feature is the =x licensor feature, which cancels out a corresponding x licensee feature and projects. A simple example is a determiner selecting a noun to form a determiner phrase (akin to the context free rule DP ! det noun). This is shown below (underline indicates canceled features, and the node label &lt; indicates that the left item projects):  The features &gt;x and &lt;x trigger head movement (incorporation), i.e., the phonetic content of the licensee is affixed to the left or right of the licensor's phonetic content, respectively. These licensor features also cancel corresponding x licensee features:  Finally, feature checking is implemented by +x/-x features. The +x denotes a need to discharge features, and the -x denotes a need for features. A simple example of this is the case assignment involved in building a prepositional phrase, i.e., prepositions must assign case, and DPs much receive case.</Paragraph>
    <Paragraph position="3">  Niyogi (2001) has developed an agenda-driven chart parser for the feature-driven formalism described above; please refer to his paper for a description of the parsing algorithm. I have adapted it for my needs and developed grammar fragments that reflect my non-lexicalist semantic framework. As an example, a simplified derivation of the sentence &amp;quot;The tire flattened.&amp;quot; is shown in Figure 1. The currently implemented system is still at the &amp;quot;toy parser&amp;quot; stage. Although the effectiveness and coverage  of my parser remains to be seen, similar approaches have been successful at capturing complex linguistic phenomena. With a minimal set of features and a small number of lexical entries, Niyogi (2001) has successfully modeled many of the argument alternations described by Levin (1993) using a Hale and Keyser (1993) style analysis. I believe that with a suitable lexicon (either hand crafted or automatically induced), my framework can be elaborated into a system whose performance is comparable to that of current statistical parsers, but with the added advantage of simultaneously providing a richer lexical semantic representation of the input sentence than flat predicate argument structures based on semantic roles.</Paragraph>
  </Section>
class="xml-element"></Paper>
Download Original XML