In this paper , we evaluate a two-pass parsing strategy proposed for the so-called ' lexicalized' grammar. In ' lexicalized' grammars (Schabes, Abeill$ and Joshi, 1988), each elementary structure is systematical ly associated with a lexical i tem called anchor. These structures specify extended domains of locality (as compared to CFGs) over which constraints can be stated. The 'g rammar ' consi...

Abstract Updating the methodology of Hayward, Richard J. 1991. A propos patterns lexicalization in Ethiopian language area. In Daniela Mendel & Ulrike Claudi (eds.), Ägypten im afroorientalischen Kontext. Special issue Afrikanistische Arbeitspapiere , 139–156. Cologne: Institute African Studies, using concept colexification (François, Alexandre. 2008. Semantic maps and typology colexificati...

The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filtering during parsing. This problem is N P-comple te and untractable on large grammars. An approximation algorithm is presented. The quality of the suboptimal solution is evaluated on real-world grammars as well as on rand...

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

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

This paper aims to propose a new account for the cross-linguistic variation of resultative constructions in natural languages. Specifically, I shall show why certain languages like English have the typical resultatives while others like Romance languages or Japanese systemically miss them. I shall first review Washio’s (1996, 1997) typological pattern for resultative constructions as well as th...

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

This study investigated whether different lexicalization patterns of motion events in English and Spanish predict how speakers of these languages perform in non-linguistic tasks. Using 36 motion events, we compared English and Spanish speakers' linguistic descriptions to their performance on two non-linguistic tasks: recognition memory and similarity judgments. We investigated the effect of lan...

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