The paper presents a large-scale computational subcategorisation lexicon for several thousand German verbs. The lexical entries were obtained by unsupervised learning in a statistical grammar framework: a German context-free grammar containing frame-predicting grammar rules and information about lexical heads was trained on 18.7 million words of a large German newspaper corpus. We developed a s...

Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency grammars, however the models employed are overly simplistic, particularly in comparison to supervised parsing models. In this paper we present an approach to dependency grammar induction using tree substitution grammar whi...

Natural Language processing is an interdisciplinary branch of linguistic and computer science studied under the Artificial Intelligence (AI) that gave birth to an allied area called ‘Computational Linguistics’ which focuses on processing of natural languages on computational devices. A natural language consists of many sentences which are meaningful linguistic units involving one or more words ...

The prevailing current view of a (symbolic, computational) grammar is basically that of a set of rewriting rules using feature-structured categories. However, whenever such a grammar is aimed at development of a realworld applied project, at least two disadvantages become clear. First, it breaks with the traditional understanding of a grammar as a network of phenomena (such as agreement, subcat...

Computational linguistics studies the computational processes involved in language learning, production, and comprehension. Computational linguists believe that the essence of these processes (in humans and machines) is a computational manipulation of information. Computational psycholinguistics studies psychological aspects of human language (e.g., the time course of sentence comprehension) in...

Among older and more widely used grammar engineering environments are XLE [9, 12] and LKB [3, 8] systems developed in 90-ies. Some features of these systems are represented in the Table 1. Their grammar formalisms come from computational linguistics: feature-structured, unification-based, which is quite different from the GF approach. Below you can see an example of lexical item for the word pr...

This paper reports further progress into a computational implementation of a new formalism for construction grammar, known as Fluid Construction Grammar (FCG). We focus in particular on how hierarchy can be implemented. The paper analyses the requirements for a proper treatment of hierarchy in grammar and then proposes a particular solution based on a new operator, known as the J-operator. The ...

This paper presents a semi-automatic approach to acquire a computational construction grammar from the semi-formal Swedish Constructicon. The implementation is based on the resource grammar library provided by Grammatical Framework and can be seen as an extension to the existing Swedish resource grammar. An important consequence of this work is that it generates feedback, explicit and implicit,...

The paper examines in how far Construction Grammar is a useful foundation by which artificial agents can self-organise communication systems that are grounded in the real world through a sensori-motor embodiment and use grammar to express certain aspects of meaning. It proposes a particular computational formalism, Fluid Construction Grammar, and mechanisms by which constructions can be progres...

In this paper, we propose a concrete operationalization which incorporates data from the FrameNet database into Fluid Construction Grammar, currently the only computational implementation of construction grammar that can achieve both production and parsing using the same set of constructions. As a proof of concept, we selected an annotated sentence from the FrameNet database and transcribed its...