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,...

Two general methods for the lexicalization of probabilistic grammars are presented which are modular, powerful and require only a small number of parameters. The rst method multiplies the unlexicalized parse tree probability with the exponential of the mutual information terms of all word-governor pairs in the parse. The second lexicalization method accounts for the dependencies between the dii...

We propose a strongly lexicalist treatment of translation equivalence where mismatches due to diverging lexicalization patterns are dealt with by means of translation links which capture crosslinguistic generalizations across sets of semantically related lexical items. We show how this treatment can be developed within a unification-based, multilingual lexical knowledge base which is integrated...

The encoding of motion events is known to be challenging for second language (L2) users, particularly if the lexicalization patterns their first (L1) diverge from those L2. This paper analyzes oral and written event descriptions produced by advanced L2 users German, an information-dense satellite-framed language. Based on usage error patterns, we discuss six major challenges with respect and, m...