We use children's noun learning as a probe into the nature of their syntactic prediction mechanism and statistical knowledge on which that is based. focus verb-based predictions, considering two possibilities: predictions might rely distributional about specific verbs–i.e. they be lexicalized–or general to all verbs. In an intermodal preferential looking experiment, we establish are lexicalized...

We study the impact of big models (in terms of the degree of lexicalization) and big data (in terms of the training corpus size) on dependency grammar induction. We experimented with L-DMV, a lexicalized version of Dependency Model with Valence (Klein and Manning, 2004) and L-NDMV, our lexicalized extension of the Neural Dependency Model with Valence (Jiang et al., 2016). We find that L-DMV onl...

The packaging of meaning in verbs varies widely across languages since are free to encode different aspects an event. At the same time, tend display recurrent preferences lexicalization, e.g. verb-framing vs. satellite-framing motion. It has been noted, however, that lexicalization patterns motion not carried over domain vision, gaze trajectory (‘visual path’) is coded outside main verb even ve...

In spite of its potential for bidirectionality, Extensible Dependency Grammar (XDG) has so far been used almost exclusively for parsing. This paper represents one of the first steps towards an XDG-based integrated generation architecture by tackling what is arguably the most basic among generation tasks: lexicalization. Herein we present a constraint-based account of disjunction in lexicalizati...

Fine-Grained lexicalization has been treated as a post process to refine the machine planned discourse and make the machine generated language more coherent and more fluent. Without this process, a system can still generate comprehensible languages but may sound unnatural and sometimes frustrate its users. To this end, generating coherent and natural sounding language is a major concern in any ...

Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoini...

extended abstract 1. introduction without a doubt, people communicate their feelings and thoughts through discourse and texts. every text is formed based on some metalinguistic variables including, culture, history, relations of power, politics, norms, and rules of the society. the author is supposed to organize a text considering all these mentioned variables and the translator is expected to ...

We propose lexical rather than phrasal amalgamation of contextual features. On a theoretical level, the lexicalization of context naturally follows other recent revisions concerned with lexicalization of set-valued features (nonlocal features, quantiier storage). On a computational level, it ooers advantages in using HPSG with head-driven generation algorithms. On a linguistic level, we sketch ...

In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We illustrate the advantages of lexicalized grammars in various contexts of natural language processing,...