• event



Simon Dobnik is organizing a workshop during this year's SLTC in Lund.

Web page: http://clt.gu.se/dialogue-technology-lab/sltc2012-apl

SLTC: http://nlp.cs.lth.se/events/sltc_2012/

Date: 2012-10-25 (All day)

Location: Lund University



The third annual workshop for CLT members will take place at Gullmarsstrand 10-12 October. We will leave by bus from Carlandersplatsen/Lundgrensgatan (map) at 09.00 on Wednesday morning, and expect to be back in Gothenburg by 3 pm on Friday. Below, you can find a preliminary schedule and titles for the presentations. If you have any questions, please contact Martin Kaså.

Preliminary schedule

09.00-10.45 Travelling
11.00-11.45 General report on CLT
12.00-13.00 Lunch
13.00-13.30 Talk: Søren Wichmann
13.30-14.00 Talk: Harald Hammarström
14.00-14.30 Talk: Kimmo Koskenniemi
14.30-16.30 Speed dating + Coffee (at 15.30)
16.30-17.30 Panel: Conceptual and distributional computational semantics
19.30- Dinner
09.00-09.30 Talk: Magnus Merkel
09.30-10.00 Talk: Hrafn Loftsson
10.00-10.30 Talk: Nicoletta Calzolari
10.30-11.00 Coffee
11.00-12.00 Future CLT flagships
12.00-13.00 Lunch
13.00-14.45 Poster session 1
14.45-15.15 Coffee
15.15-17.00 Poster session 2
17.15-19.00 Board meets advisors
19.30- Dinner
09.00-09.30 Talk: Giampiero Salvi
09.30-10.00 Talk: Rickard Domeij
10.00-10.30 Talk: Johanna Moore
10.30-11.00 Coffee
11.00-12.00 Panel: LT teaching
12.00-13.00 Lunch
13.00-15.00 Travelling

Poster session 1

Ann-Marie Eklund How query annotations may help in providing accurate public health
Aarne Ranta Demo: Some Techniques for Multilingual and Multimodal Query Systems
Benjamin Lyngfelt & Markus Forsberg SweCxn - towards a comprehensive Swedish constructicon
Cajsa Ottesjö & Stina Ericsson LekBot Active Play
Dana Dannélls Demo: Generating coherent multilingual painting descriptions from Web ontologies
Elena Volodina, Lars Borin Lärka - an emerging ICALL platform for Swedish
Elena Volodina, Richard Johansson, Sofie Johansson Kokkinakis Ranking corpus examples from "best" down
Grégoire Détrez Smart Paradigms and the Predictability and Complexity of Inflectional Morphology
Johan Roxendal Demo: Korp v2.0 Preview
John J. Camilleri A computational morphology for Maltese, and using it to build a full-form lexicon
Karin Friberg Heppin & Maria Toporowska Gronostaj The Rocky Road towards a Swedish FrameNet – Creating SweFN
Magdalena Siverbo FraCaSBank - a bilingual treebank for the FraCaS test suite
Sandra Derbring Pratmakaren - speaking movie subtitles
Staffan Larsson, Robin Cooper, Simon Dobnik Toward perceptually grounded formal semantics
David Junger, Torbjörn Lager, Johan Roxendal Poster och demo: Preview of the Dialog Web Lab

Poster session 2

Dimitrios Kokkinakis Medication Event Extraction Using Frame Semantics ... a pilot investigation
Dimitrios Kokkinakis, Markus Forsberg, Frida Smith, Joakim Öhlén Analysis of written information material to cancer patients
Elizabeth Coppock Scalarity in Discourse
Gerlof Bouma, Malin Ahlberg, Yvonne Adesam bokstaffua, bokstaffwa, bokstafwa, bokstaua, bokstawa... Towards lexical link-up for a corpus of Old Swedish
Judy Ribeck & Sofie Johansson Kokkinakis A Swedish Academic Word List
Karin Cavallin Automatic extraction of potential examples of semantic change using lexical sets
Karin Friberg Heppin & Anni Järvelin Towards Improving Search Results for Medical Experts and Laypersons
Krasimir Angelov Demo: The Penn Treebank and Statistical
and Robust Parsing in GF
Peter Ljunglöf Editing syntax trees on the surface
Richard Johansson Semantic role labeling with the Swedish FrameNet
Stina Ericsson Information structural leaks - a CLT small project
Taraka Rama Typological distances and vector similarity measures
Thomas Hallgren Demo: cloud.grammaticalframework.org


Date: 2012-10-10 09:00 - 2012-10-12 15:00

Location: Gullmarsstrand



Professor Martin Kay (Stanford U., Saarland U. and dr h.c. at Gothenburg U.) is invited speaker at the third international workshop on Free/Open-Source Rule-based Machine Translation (http://www.chalmers.se/hosted/freerbmt12-en/).

More information here: http://www.chalmers.se/cse/EN/news/calendar-events/new-machine-translation

Date: 2012-06-14 09:30 - 10:30

Location: room EE, EDIT building, Rännv 6B, Chalmers



A workshop organized by Markus Forsberg and Aarne Ranta

Ten years have gone by since we started working on BNF Converter. We like to celebrate this by inviting you to an informal event with some talks and wine. Welcome! (No registration necessary.)


15:15-15:20 Welcome (Markus Forsberg and Aarne Ranta)
15:20-15:50 Ten years of BNF Converter (Markus Forsberg)
15:50-16:20 Implementing Programming Languages - A New Book Using BNF Converter (Aarne Ranta)
16:20-16:40 BNFC-meta (Jonas Duregård)
16:40-17:00 Discussion: BNF Converter from a user's perspective (Bengt Nordström)
17:00-           Wine+snacks




Date: 2012-06-20 15:15 - 17:00

Location: L308, Lennart Torstenssonsgatan 8



Håkan Burden, GSLT PhD student at CSE, will defend his licentiate thesis "Three Studies on Model Transformations - Parsing, Generation and Ease of Use".

Opponent/discussion leader: Leon Moonen, Simula Research Laboratory, Oslo, Norway


Transformations play an important part in both software development and the automatic processing of natural languages. We present three publications rooted in the multi-disciplinary research of Language Technology and Software Engineering and relate their contribution to the literature on syntactical transformations.

Parsing Linear Context-Free Rewriting Systems
The first publication describes four different parsing algorithms for the mildly context-sensitive grammar formalism Linear Context-Free Rewriting Systems. The algorithms automatically transform a text into a chart. As a result the parse chart contains the (possibly partial) analysis of the text according to a grammar with a lower level of abstraction than the original text. The uni-directional and endogenous transformations are described within the framework of parsing as deduction.

Natural Language Generation from Class Diagrams
Using the framework of Model-Driven Architecture we generate natural language from class diagrams. The transformation is done in two steps. In the first step we transform the class diagram, defined by Executable and Translatable UML, to grammars specified by the Grammatical Framework. The grammars are then used to generate the desired text. Overall, the transformation is uni-directional, automatic and an example of a reverse engineering translation.

Executable and Translatable UML - How Difficult Can it Be?
Within Model-Driven Architecture there has been substantial research on the transformation from Platform-Independent Models (PIM) into Platform-Specifc Models, less so on the transformation from Computationally Independent Models (CIM) into PIMs. This publication reflects on the outcomes of letting novice software developers transform CIMs specified by UML into PIMs defined in Executable and Translatable UML.

The three publications show how model transformations can be used within both Language Technology and Software Engineering to tackle the challenges of natural language processing and software development.

Full text: http://www.cse.chalmers.se/%7Eburden/pdfs/BurdenLic.pdf

Date: 2012-06-18 10:15 - 13:00

Location: room EE, EDIT building, Rännv 6B, Chalmers



For more information, see the dedicated web page:


Date: 2012-05-04 10:00 - 17:00

Location: T302, Olof Wijksgatan 6



Dana Dannélls at the department of Swedish and Språkbanken will present her upcoming PhD thesis "Multilingual text generation from structured formal representations".

Opponent: Richard Power, The Open University, UK.

The thesis draft can be downloaded here: http://spraakdata.gu.se/svedd/finalseminar-120127.pdf.

Date: 2012-01-27 09:00 - 11:00

Location: L308, Lennart torstenssonsgatan 8



Shafqat Virk (graduate student at Applied IT) will defend his thesis for the licentiate degree: "Computational Grammar Resources for Indo-Iranian Languages"

Discussion leader: Hans Leiß


A lot of research is being carried out on different aspects of natural language processing (NLP). As a result, there exist state of the art machine translation systems such as Google translate. These systems are based on data driven (i.e. statistical) approaches, which provide huge coverage, but at the cost of limited accuracy. On the other hand knowledge intensive (i.e. grammar based) approaches provide high quality translations, but their coverage is limited. Generally speaking, one can say that a combined solution with human-like capabilities for accuracy and coverage is yet too far to be reached. One major reason of this limitation is the fact that natural languages are complex and ambiguous. This makes it a challenging task to develop a computational grammar of a natural language. Developing a grammar of a natural language requires at least comprehensive knowledge of the language, expertise to describe it, and also practical skills with a grammar formalism tool. This thesis is devoted to the development of computational grammars of four Indo-Iranian languages: Nepali, Persian, Punjabi, and Urdu. We explore different lexical and syntactical features of these languages and develop their resource grammars according to the requirements of Grammatical Framework (GF) resource grammar API.

Grammatical Framework (GF) is a grammar formalism tool, which has been used to develop grammars of a number of natural languages. So far most of these languages belong to the Germanic, Romance, or Slavic branches of the Indo- European family of languages. On the other hand, Indo-Iranian is the largest branch of the Indo-European family. With 310 living languages, this branch comprises 70% of the total languages in its family. Most of these Indo-Iranian languages have either very limited computational resources or no resources at all. This is one reason of developing resource grammars of these resource-limited languages.

Furthermore, Indo-Iranian languages have some distinctive features such as the Ezafe construction and the partial ergativigy. Previously, none of these features has been implemented in GF. Another reason of this study is to explore this dimension, and demonstrate implementation of these features in GF

Date: 2012-01-27 13:15 - 15:15

Location: Steve Jobs, plan 2 Patricia, Forskningsgången 6, Lindholmen



Ramona Enache (graduate student at CSE) will defend her thesis for the licentiate degree: "Automating the development of multilingual grammars"

Opponent: Gordon Pace, University of Malta


The thesis aims at exploring alternative ways of automating the development of multilingual GF (Grammatical Framework) grammars. The goal is to achieve semantics-preserving machine translation within a limited or semi-limited domain.

First, there is an experiment that investigates the relation between language skills, programming skills and the effort to develop a grammar for natural language. Along with this, we present a prototype for an example-based system aimed at automating and simplifying the task of GF grammar writing. This is done by partially alleviating the burden of GF programming and facilitating the integration of SMT (statistical machine translation) tools and feedback from native informants into the development of a GF grammar.

Secondly, there is work on ontology representation in GF. The goal is to automatically build a robust language-independent semantic interlingua for the multilingual grammars, by using the projection of the ontology as a GF grammar. In this way the ontology can be verbalized with little effort into a number of languages. The resulting GF grammar is a controlled language describing ontological concepts and their relations as defined in the initial ontology.

Another approach towards automating and enhancing GF grammars is the grammar-based approach to a rule-based SMT hybrid translation system. In order to increase the coverage of a grammar, we enriched it with a bilingual lexicon built on the fly, with the aid of an SMT system specialised on the corpus. The goal of the hybrid system is to parse English patent claims from the biomedical domain and translate them to French. The work represents the first large-scale experiment to use GF for parsing arbitrary unstructured text.

A final direction considered is the development of a general language resource for Romanian. It can be used to build domain-specific resources which will use it as a library for handling syntactic phenomena. In this way more multilingual GF grammars can be ported to Romanian, without the need to re-implement the linguistic technicalities of the language every time.

Date: 2012-02-29 10:15 - 12:00

Location: Room EF, EDIT building, Chalmers



Krasimir Angelov at CSE defends his PhD thesis "The Mechanics of the Grammatical Framework".

Faculty Opponent: Mark Steedman

More info: http://publications.lib.chalmers.se/cpl/record/index.xsql?pubid=149979

Full text: http://www.cse.chalmers.se/%7Ekrasimir/phd-thesis.pdf

Date: 2012-02-08 10:15 - 13:00

Location: EDIT building, Chalmers