Marco Kuhlmann, Alexander Koller and Giorgio Satta, Lexicalization and Generative Power in CCG, 2015, Computational linguistics Association for Computational Linguistics (Print), (41), 2, 215-247. http://dx.doi.org/10.1162/COLI_a_00219 Copyright: Massachusetts Institute of Technology Press (MIT Press): STM Titles / MIT Press http://mitpress.mit.edu/main/home/default.asp?sid=19E29805-C0A0-4642-8...

This paper adopts a corpus-assisted critical discourse analysis approach to explore the pragmatics of lexical categories in courtroom discourse. More specifically, this probes extent which interlocutors employ particular lexemes achieve specific pragmatic purposes, which, turn, contributes understanding way language operates effectively within legal settings. The data used is taken from testimo...

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

Most of knowledge is written in natural language and structured knowledge base includes the partially limited information of them. In QA system perspective, the quality of knowledge base is depends on how it covers the knowledge to answer user’s questions. To deal with this knowledge base construction problem, we define the natural language question sets and answer documents which contains know...

This paper aims at accounting for the emergence and loss of constraints governing the formation of deverbal nominalizations in German from a cognitive point of view. Specifically, diachronic changes in the formation of derivatives in the suffix -ung are investigated on the basis of two large corpora of Middle High German (MHG, 1050-1350) and Early New High German (ENHG, 1350-1650) texts, respec...

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

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