Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining grammars cannot be transformed into a normal form (preserving the generated tree language), in which each production contains a lexical symbol. A more powerful model, the simple context-free tree grammar, admits such a norma...

This paper is an historical study of the formation of the Chinese resultative verb compounds (RVCs) that signal a resultant state of a non-agent with a V1V2 predicate. Metaphorization and metonymization, understood within the theoretical framework of Brinton & Traugott (2005), are proposed to have played a most important role in the formation of the RVC in Middle Chinese. Many scholars noted (W...

We propose a general lexicalization model which accounts for how lexical units are selected and introduced in linguistic utterances during language generation. This model aims at “naturalness” by being based on actual lexical knowledge used in speech; consequently, it should be compatible with standard patterns of behavior shown by humans when they speak (flexibility in computing both content a...

The concept of Linked Data has attracted increased interest in recent times due to its free and open availability and the sheer of volume. We present a framework to generate patterns which can be used to lexicalize Linked Data. We use DBpedia as the Linked Data resource which is one of the most comprehensive and fastest growing Linked Data resource available for free. The framework incorporates...

This paper gives an overview of ongoing work on a system for the generation of NL descriptions of classes defined in OWL ontologies. We present a general structuring approach for such descriptions. Since OWL ontologies do not by default contain the information necessary for lexicalization, lexical information has to be added to the data via annotations. A rulebased mechanism for automatically d...

Abstract This article contains an edition of a 17th-century Low German letter addressed to the congregation in Stockholm. Seen against shift writing language from High German, this is analyzed respect code-mixing, which shown fulfill communicative function. Furthermore author here suggests that code-mixing observed can be described as congruent lexicalization, where syntactic structures are fil...

In this paper, we will describe a tree generating system called tree-adjoining grammar(TAG)and state some of the recent results about TAGs. The work on TAGS is motivated by linguistic considerations. However, a number of formal results have been established for TAGs, which we believe, would be of interest to researchers in tree grammars and tree automata. After giving a short introduction to TA...

An increasing number of enterprises are beginning to include ontologies into Text Analytics (TA) applications. This can be challenging for a TA group wishing to avail of such technologies due to the manual effort needed to map language resources within a TA system for a new domain. Ontology lexicalization offers a solution to this problem by seeking to automatically generate lexical resources i...

This study was conducted to analyze code-mixing types used by Jody when talking Ben in Filosofi Kopi and 2: & Jody. The writers observed as director of a coffee shop called Kopi, barista, who had lower status than the shop. In this study, theory Muysken (2000). qualitative approach study. findings showed two code-mixing: insertion congruent lexicalization. He did not use any alternations Ben.

In late Medieval Greek and many modern dialects, pronominal clitics are syntactically adjoined to an IP projection. In another set of dialects they have become syntactically adjoined to a verbal head. In the most innovating dialects (which include Standard Greek) they are agreement affixes. Extending the Fontana/Halpern clitic typology, we propose a trajectory of lexicalization from X clitics v...