Volume
OASIcs, Volume 29
2nd Symposium on Languages, Applications and Technologies
-
Part of:
Series:
Open Access Series in Informatics (OASIcs)
Conference: Symposium on Languages, Applications and Technologies (SLATE)
Event
SLATE 2013, June 20-21, 2013, Porto, PortugalEditors
Publication Details
- published at: 2013-06-05
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-939897-52-1
- DBLP: db/conf/slate/slate2013
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 29, SLATE'13, Complete Volume
Abstract
OASIcs, Volume 29, SLATE'13, Complete Volume
Cite as
2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@Proceedings{leal_et_al:OASIcs.SLATE.2013,
title = {{OASIcs, Volume 29, SLATE'13, Complete Volume}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013},
URN = {urn:nbn:de:0030-drops-40805},
doi = {10.4230/OASIcs.SLATE.2013},
annote = {Keywords: Programming Languages; Interoperability; Natural Language Processing}
}
Document
Front Matter
Frontmatter
Abstract
The success of the humankind relies on our ability to communicate and
transform the world. For ages we developed tools and technologies that
allowed us to thrive and prosper. As we expanded to every corner of
the planet we created languages that enabled us to communicate and
record knowledge, even if they also become barriers to communication
in themselves.
Technology and language have always been interconnected. Technologies
to record language gave birth to history and the written language
allowed us to preserve knowledge, including knowledge on
technologies. Technology reshaped language as books, radio shows or
motion pictures made us aware of how other people communicate. But
technologies and language were not completely blend together until
computers and networks become our favourite tool to communicate and
transform the world.
The goal of the Symposium on Languages, Applications and Technologies
(SLATE) is to be a forum to discuss the different ways in which
language and technology interplay in computer science, and they are
many. The symposium is divided into three main tracks, each one
focusing a specific aspect of languages, from natural languages to
compilers.
* The HHL (Human-Human Languages) track is dedicated to the
discussion of research projects and ideas involving natural language
processing and their industrial application.
* The HCL (Human-Computer Languages) track is where researchers,
developers and educators exchange ideas and information on the
latest academic or industrial work on language design, processing,
assessment and applications.
* The CCL (Computer-Computer Languages) track main goal is to
provide a broad space for discussion about the XML markup language,
examples of usage and associated technologies.
SLATE follows the footsteps of two former conferences: CoRTA, the
Conference on Compilers, Related Technologies and Applications; and
XATA, the conference on XML, Applications and Applied Technologies,
both with more than a decade of history.
This volume contains the proceedings of the 2nd edition of SLATE, held
in the Department of Computer Science, Faculty of Sciences, University
of Porto, Portugal, during June 20-21, 2013.
This year, SLATE received a total of 26 paper submissions for the
three tracks. Each submission was reviewed by at least three Program
Committee members, which included 55 researchers (counting
sub-reviewers). At the end, 19 papers were selected for publication
and presentation at the symposium, resulting in a 27% rejection
rate. The set of accepted papers present a variety of contributions
and were divided into the following five sessions for presentation at
the symposium:
* Software Development Tools, includes four articles on
programming languages compilation and analysis;
* XML and Applications, includes four articles on the
usage of XML in different areas, ranging from the annotation of
documents to its use on the semantic web;
* Languages on Learning Environments, includes three
articles that focus the automation on exercises generation and
evaluation;
* Domain Specific Languages, includes four articles on
languages for specific languages, from music, robots or graphical
user interfaces;
* Natural Language Processing, includes four articles
related to processing and teaching natural languages.
In addition to these sessions, the program also included two keynote
presentations, one on the PICAT system, a scalable logic-based
language, by Neng-Fa Zhou (Brooklyn College, New York), and another on
software languages and their history, by Jean-Marie Favre (University
of Grenoble, France).
The organizers of SLATE 2013 are in debt to many people without whom
this event would never been possible. We wish to thank to our
sponsors for making this event possible and to the EasyChair
conference management system for simplifying our task. Thanks must go
also to the authors of all submitted papers for their contribution and
interest in the symposium and to the participants for making the event
a meeting point for a fruitful exchange of ideas and feedback on
recent developments. Finally, we want to express our gratitude to the
Program Committee members and sub-reviewers, as the symposium would
not have been possible without their dedicated time and knowledge in
evaluating and ranking so many submissions from so many different
topics.
To all, our deepest thanks!
Cite as
2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. i-xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{leal_et_al:OASIcs.SLATE.2013.i,
author = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
title = {{Frontmatter}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {i--xiv},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.i},
URN = {urn:nbn:de:0030-drops-40473},
doi = {10.4230/OASIcs.SLATE.2013.i},
annote = {Keywords: natural language processing, interoperabilty languages, compilers, languages}
}
Document
Invited Talk
Software Languages: The Linguistic Continuum (Invited Talk)
Abstract
While computers are linguistic machines moving symbols around, Informatics is BY and FOR people. I claim here that the gap between Computer Languages and Human Languages is, as a matter of fact, filled by a wide spectrum of Software Languages. My point is that the notion of Software Language goes far beyond Programming Languages; just like Informatics is indeed much more than Computer Science. After a very brief retrospective on the history of languages and Information Technologies, I show that nowadays nearly all kinds of languages are indeed amenable to be represented as software; at least to some certain extent. Software Languages include not only the languages used typically in Software Engineering (e.g. Modeling Languages, Specification Languages, Architecture Description Languages, Query Languages, and so on), but also all kinds of Domain Specific Languages that originate from all other areas of human activities. As a matter of fact, although Scientific Languages, Engineering Languages and Business Languages existed long before Computers we all witness today the progressive transformation of these languages into their counterpart as Software Languages. Software Languages can take many different incarnations such as grammars, ontologies, schemas or metamodels. Moreover, these descriptions are often missing as many languages remain "implicit" or just exist in the form of proto-languages. I do not claim here that the notion of "Software Language" is clear cut or well understood. I just advocate that since these languages could reveal to be fundamental in the context of the Information Age they should be (1) studied from a scientific point of view in an integrative approach, and (2) developed and evolved in principled ways. This leads the emerging fields of Software Linguistics and Software anguage Engineering respectively.
Cite as
Jean-Marie Favre. Software Languages: The Linguistic Continuum (Invited Talk). In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{favre:OASIcs.SLATE.2013.3,
author = {Favre, Jean-Marie},
title = {{Software Languages: The Linguistic Continuum}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {3--3},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.3},
URN = {urn:nbn:de:0030-drops-40263},
doi = {10.4230/OASIcs.SLATE.2013.3},
annote = {Keywords: Software Languages, Software Linguistics, Software Language Engineering}
}
Document
Invited Talk
Picat: A Scalable Logic-based Language and System (Invited Talk)
Abstract
This talk will give the design principles of the Picat language (http://www.picat-lang.org), highlight the high-level and intuitive abstractions provided by Picat for easy programming, and contemplate why Picat is more robust and scalable than Prolog and could be more accessible than Prolog to ordinary programmers for scripting and modeling tasks.
Cite as
Neng-Fa Zhou. Picat: A Scalable Logic-based Language and System (Invited Talk). In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 5-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{zhou:OASIcs.SLATE.2013.5,
author = {Zhou, Neng-Fa},
title = {{Picat: A Scalable Logic-based Language and System}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {5--6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.5},
URN = {urn:nbn:de:0030-drops-40273},
doi = {10.4230/OASIcs.SLATE.2013.5},
annote = {Keywords: Functions, Relations, Loops, Constraints, Tabling}
}
Document
Or-Parallel Prolog Execution on Clusters of Multicores
Abstract
Logic Programming languages, such as Prolog, provide an excellent framework for the parallel execution of logic programs. In particular, the inherent non-determinism in the way logic programs are structured makes Prolog very attractive for the exploitation of implicit parallelism. One of the most noticeable sources of implicit parallelism in Prolog programs is or-parallelism. Or-parallelism arises from the simultaneous evaluation of a subgoal call against the clauses that match that call. Arguably, the most successful model for or-parallelism is environment copying, that has been efficiently used in the implementation of or-parallel Prolog systems both on shared memory and distributed memory architectures. Nowadays, multicores and clusters of multicores are becoming the norm and, although, many parallel Prolog systems have been developed in the past, to the best of our knowledge, none of them was specially designed to explore the combination of shared with distributed memory architectures. Motivated by our past experience, in designing and developing parallel Prolog systems based on environment copying, we propose a novel computational model to efficiently exploit implicit parallelism from large scale real-world applications specialized for the novel architectures based on clusters of multicores.
Cite as
João Santos and Ricardo Rocha. Or-Parallel Prolog Execution on Clusters of Multicores. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 9-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{santos_et_al:OASIcs.SLATE.2013.9,
author = {Santos, Jo\~{a}o and Rocha, Ricardo},
title = {{Or-Parallel Prolog Execution on Clusters of Multicores}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {9--20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.9},
URN = {urn:nbn:de:0030-drops-40465},
doi = {10.4230/OASIcs.SLATE.2013.9},
annote = {Keywords: Logic Programming, Or-Parallelism, Environment Copying, Scheduling}
}
Document
NESSy: a New Evaluator for Software Development Tools
Abstract
Select the best tool for developing a system is a complex process.
There must be considered several aspects corresponding to the domain
where the system is going to run. Generally, the domain characteristics only are comprehended by experts. They know very well which are the main characteristics, how they can be combined and which should not be considered. This knowledge is fundamental to select the most appropriate tool for implementing a system that solves problems or automates processes in a specific domain. For this reason, it is difficult to get a tool that allows to establish a ranking of development tools for a particular case. In this paper, NESSy, a system to evaluate software development tools, is presented. This tool implements a multi-criteria evaluation method named LSP (Logic Scoring of Preference). Furthermore, it presents a user-friendly environment for carrying out the evaluation process. LSP uses a set of structures aimed at describing software development tools with the goal of select the best one for a specific problem. The features previously mentioned make NESSy a relevant application to help the software engineer to select the best tool for solving specific problems related to particular domains.
Cite as
Enrique Miranda, Mario Berón, German Montejano, Maria João Varanda Pereira, and Pedro Rangel Henriques. NESSy: a New Evaluator for Software Development Tools. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 21-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{miranda_et_al:OASIcs.SLATE.2013.21,
author = {Miranda, Enrique and Ber\'{o}n, Mario and Montejano, German and Pereira, Maria Jo\~{a}o Varanda and Henriques, Pedro Rangel},
title = {{NESSy: a New Evaluator for Software Development Tools}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {21--37},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.21},
URN = {urn:nbn:de:0030-drops-40286},
doi = {10.4230/OASIcs.SLATE.2013.21},
annote = {Keywords: Evaluation Method, Elementary Criteria, Aggregation Structure, LSP}
}
Document
Supporting Separate Compilation in a Defunctionalizing Compiler
Abstract
Defunctionalization is generally considered a whole-program
transformation and thus incompatible with separate compilation. In
this paper, we formalize a modular variant of defunctionalization which can support separate compilation. Our technique allows modules in a Haskell-like language to be separately defunctionalized and compiled, then linked together to generate an executable program. We provide a prototype implementation of our modular defunctionalization technique and we discuss the experiences of its application in a compiler from a large subset of Haskell to low-level C code, based on the intensional transformation.
Cite as
Georgios Fourtounis and Nikolaos S. Papaspyrou. Supporting Separate Compilation in a Defunctionalizing Compiler. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 39-49, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{fourtounis_et_al:OASIcs.SLATE.2013.39,
author = {Fourtounis, Georgios and Papaspyrou, Nikolaos S.},
title = {{Supporting Separate Compilation in a Defunctionalizing Compiler}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {39--49},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.39},
URN = {urn:nbn:de:0030-drops-40294},
doi = {10.4230/OASIcs.SLATE.2013.39},
annote = {Keywords: Defunctionalization, functional programming, modules, separate compilation}
}
Document
Towards Automated Program Abstraction and Language Enrichment
Abstract
This paper focuses on the presentation of a method for automated
raise of programming language abstraction level. The base concept
for the approach is a code pattern -- recurring structure in program
code. In contrast to design patterns it has a specific representation at a code level and thus can be parameterized and replaced by a new language element. In the article two algorithms for automated recognition of patterns in samples of programs are described and examined. The paper also presents an approach for language extension based on the found patterns. It is based on an interactive communication with the programming environment, where recognized patterns are suggested to a programmer and can be injected into the language in a form of new elements. Conducted experiments are evaluated in regard to the future perspective and contributions.
Cite as
Sergej Chodarev, Emília Pietriková, and Ján Kollár. Towards Automated Program Abstraction and Language Enrichment. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 51-64, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{chodarev_et_al:OASIcs.SLATE.2013.51,
author = {Chodarev, Sergej and Pietrikov\'{a}, Em{\'\i}lia and Koll\'{a}r, J\'{a}n},
title = {{Towards Automated Program Abstraction and Language Enrichment}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {51--64},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.51},
URN = {urn:nbn:de:0030-drops-40300},
doi = {10.4230/OASIcs.SLATE.2013.51},
annote = {Keywords: Abstraction, code patterns, language extension, projectional editing}
}
Document
Publishing Linked Data with DaPress
Abstract
The central idea of the Web of Data is to interlink the information
available in the Web, most of which is actually stored in databases
rather than in static HTML pages. Tools to convert relational data
into semantic web formats and publish then as linked data are essential to fulfill the vision of a web of data available for
automatic processing, as web content is currently available to humans. This paper presents DaPress, a simple tool to publish linked data on the Web, that maps a relational database to an RDF triplestore and creates a SPARQL access point. The paper reports the
use of DaPress to publish the database of Authenticus, a system that
automatically assigns publication authors to known Portuguese
researchers and institutions.
Cite as
Teresa Costa and José Paulo Leal. Publishing Linked Data with DaPress. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 67-81, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{costa_et_al:OASIcs.SLATE.2013.67,
author = {Costa, Teresa and Leal, Jos\'{e} Paulo},
title = {{Publishing Linked Data with DaPress}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {67--81},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.67},
URN = {urn:nbn:de:0030-drops-40312},
doi = {10.4230/OASIcs.SLATE.2013.67},
annote = {Keywords: RDF, RDF Schema, Relational data; Semantic web}
}
Document
Seqins - A Sequencing Tool for Educational Resources
Abstract
The teaching-learning process is increasingly focused on the
combination of the paradigms "learning by viewing" and "learning
by doing." In this context, educational resources, either expository or evaluative, play a pivotal role. Both types of resources are interdependent and their sequencing would create a richer educational experience to the end user. However, there is a lack of tools that support sequencing essentially due to the fact that existing specifications are complex. The Seqins is a sequencing tool of digital resources that has a fairly simple sequencing model. The tool communicates through the IMS LTI specification with a plethora of e-learning systems such as learning management systems, repositories, authoring and evaluation systems. In order to validate Seqins we integrate it in an e-learning Ensemble framework instance for the computer programming learning.
Cite as
Ricardo Queirós, José Paulo Leal, and José Campos. Seqins - A Sequencing Tool for Educational Resources. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 83-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{queiros_et_al:OASIcs.SLATE.2013.83,
author = {Queir\'{o}s, Ricardo and Leal, Jos\'{e} Paulo and Campos, Jos\'{e}},
title = {{Seqins - A Sequencing Tool for Educational Resources}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {83--96},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.83},
URN = {urn:nbn:de:0030-drops-40326},
doi = {10.4230/OASIcs.SLATE.2013.83},
annote = {Keywords: e-Learning, Learning management systems, Automatic evaluation}
}
Document
XML to Annotations Mapping Patterns
Abstract
Configuration languages based on XML and source code annotations are
very popular in the industry. There are situations in which there
are reasons to move configuration languages from one format to the
other, or to support multiple configuration languages. In such cases
mappings between languages based on these formats have to be defined. Mapping can be used to support multiple configuration languages or to seamlessly move configurations from annotations to XML or vice versa. In this paper, we present XML to annotations mapping patterns that can be used to map languages from one format to the other.
Cite as
Milan Nosál and Jaroslav Porubän. XML to Annotations Mapping Patterns. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 97-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{nosal_et_al:OASIcs.SLATE.2013.97,
author = {Nos\'{a}l, Milan and Porub\"{a}n, Jaroslav},
title = {{XML to Annotations Mapping Patterns}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {97--113},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.97},
URN = {urn:nbn:de:0030-drops-40457},
doi = {10.4230/OASIcs.SLATE.2013.97},
annote = {Keywords: Mapping Patterns, Language Design, Annotations, Attribute-oriented Programming, XML}
}
Document
Retreading Dictionaries for the 21st Century
Abstract
Even in the 21st century, paper dictionaries are still compiled and
developed using standard word processors. Many publishing companies
are, nowadays, working on converting their dictionaries into computer readable documents, so that they can be used to prepare new features, such as making them available online. Luckily, most of these publishers can pay review teams to fix and even enhance these
dictionaries. Unfortunately, research institutions cannot hire that amount of workers.
In this article we present the process of retreading a Galician dictionary that was first developed and compiled using Microsoft Word. This dictionary was converted, through automatic rewriting, into a Text Encoding Initiative schema subset. This process will be
detailed, and the problems found will be discussed. Given a recent
normative that changed the Galician orthography, the dictionary has
undergone a semi-automatic modernization process. Finally, two applications for the obtained dictionaries will be shown.
Cite as
Xavier Gómez Guinovart and Alberto Simões. Retreading Dictionaries for the 21st Century. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 115-126, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{guinovart_et_al:OASIcs.SLATE.2013.115,
author = {Guinovart, Xavier G\'{o}mez and Sim\~{o}es, Alberto},
title = {{Retreading Dictionaries for the 21st Century}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {115--126},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.115},
URN = {urn:nbn:de:0030-drops-40333},
doi = {10.4230/OASIcs.SLATE.2013.115},
annote = {Keywords: dictionary, markup language, language processing, lexical information retrieval, Galician language}
}
Document
A Flexible Dynamic System for Automatic Grading of Programming Exercises
Abstract
The research on programs capable to automatically grade source code
has been a subject of great interest to many researchers. Automatic
Grading Systems (AGS) were born to support programming courses and
gained popularity due to their ability to assess, evaluate, grade
and manage the students' programming exercises, saving teachers from
this manual task.
This paper discusses semantic analysis techniques, and how they can be applied to improve the validation and assessment process of an AGS. We believe that the more flexible is the results assessment, the more precise is the source code grading, and better feedback is provided (improving the students learning process).
In this paper, we introduce a generic model to obtain a more flexible and fair grading process, closer to a manual one. More specifically, an extension of the traditional Dynamic Analysis concept, by performing a comparison of the output produced by a program under assessment with the expected output at a semantic level. To implement our model, we propose a Flexible Dynamic Analyzer, able to perform a semantic-similarity analysis based on our Output Semantic-Similarity Language (OSSL) that, besides specifying the output structure, allows to define how to mark partially correct answers. Our proposal is compliant with the Learning Objects standard.
Cite as
Daniela Fonte, Daniela da Cruz, Alda Lopes Gançarski, and Pedro Rangel Henriques. A Flexible Dynamic System for Automatic Grading of Programming Exercises. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 129-144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{fonte_et_al:OASIcs.SLATE.2013.129,
author = {Fonte, Daniela and Cruz, Daniela da and Gan\c{c}arski, Alda Lopes and Henriques, Pedro Rangel},
title = {{A Flexible Dynamic System for Automatic Grading of Programming Exercises}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {129--144},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.129},
URN = {urn:nbn:de:0030-drops-40343},
doi = {10.4230/OASIcs.SLATE.2013.129},
annote = {Keywords: Automatic Grading Systems, Domain Specific Languages, DSL, Dynamic Analysis}
}
Document
CodeSkelGen - A Program Skeleton Generator
Abstract
Existent computer programming training environments help users to learn programming by solving problems from scratch. Nevertheless,
initiating the resolution of a program can be frustrating and
demotivating if the student does not know where and how to start. Skeleton programming facilitates a top-down design approach, where a partially functional system with complete high-level structures is available, so the student needs only to progressively complete or update the code to meet the requirements of the problem.
This paper presents CodeSkelGen - a program skeleton generator. CodeSkelGen generates skeleton or buggy Java programs from a complete annotated program solution provided by the teacher. The annotations are formally described within an annotation type and processed by an annotation processor. This processor is responsible for a set of actions ranging from the creation of dummy methods to the exchange of operator types included in the source code.
The generator tool will be included in a learning environment that aims to assist teachers in the creation of programming exercises and to help students in their resolution.
Cite as
Ricardo Queirós. CodeSkelGen - A Program Skeleton Generator. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 145-154, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{queiros:OASIcs.SLATE.2013.145,
author = {Queir\'{o}s, Ricardo},
title = {{CodeSkelGen - A Program Skeleton Generator}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {145--154},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.145},
URN = {urn:nbn:de:0030-drops-40350},
doi = {10.4230/OASIcs.SLATE.2013.145},
annote = {Keywords: Code Generation, Programming Languages, Annotation}
}
Document
Choosing Grammars to Support Language Processing Courses
Abstract
Teaching Language Processing courses is a hard task. The level of abstraction inherent to some of the basic concepts in the area and the technical skills required to implement efficient processors are responsible for the number of students that do not learn the subject and do not succeed to finish the course.
In this paper we intend to list the main concepts involved in Language Processing subject, and identify the skills required to learn them. In this context, it is feasible to identify the difficulties that lead students to fail. This enables us to suggest some pragmatic ways to overcome those troubles. We will focus on the grammars suitable to motivate students and help them to learn easily the basic concepts. After identifying the characteristics of such grammars, some examples are presented to make concrete and clear our proposal. The contribution of this paper is the systematic way we approach the process of teaching Language Processing courses towards a successful learning activity.
Cite as
Maria João Varanda Pereira, Nuno Oliveira, Daniela da Cruz, and Pedro Rangel Henriques. Choosing Grammars to Support Language Processing Courses. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 155-168, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{pereira_et_al:OASIcs.SLATE.2013.155,
author = {Pereira, Maria Jo\~{a}o Varanda and Oliveira, Nuno and Cruz, Daniela da and Henriques, Pedro Rangel},
title = {{Choosing Grammars to Support Language Processing Courses}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {155--168},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.155},
URN = {urn:nbn:de:0030-drops-40369},
doi = {10.4230/OASIcs.SLATE.2013.155},
annote = {Keywords: Teaching Language Processing, Domain Specific Languages, Grammars}
}
Document
Role of Patterns in Automated Task-Driven Grammar Refactoring
Abstract
Grammarware engineering, and grammar-dependent software development has received considerable attention in recent years. Despite of this fact, grammar refactoring as a significant cornerstone of grammarware engineering is still weakly understood and little practiced. In this paper, we address this issue by proposing universal algorithm for automated refactoring of context-free grammars called mARTINICA, and formal specification language for preserving knowledge of grammar engineers called pLERO. Significant advantage of mARTINICA with respect to other automated refactoring approaches is that it performs grammar refactoring on the bases of user-defined refactoring task, rather then operating under some fixed objective of refactoring process. In order to be able to understand unified refactoring process of mARTINICA this paper also provides brief insight in grammar refactoring operators, which in our approach provide universal refactoring transformations for specific context-free grammars. For preserving of knowledge considering refactoring process we propose formalism based on patterns which are well-proven method of knowledge preservation in variety of other domains, such as software architectures.
Cite as
Ján Kollár and Ivan Halupka. Role of Patterns in Automated Task-Driven Grammar Refactoring. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 171-186, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{kollar_et_al:OASIcs.SLATE.2013.171,
author = {Koll\'{a}r, J\'{a}n and Halupka, Ivan},
title = {{Role of Patterns in Automated Task-Driven Grammar Refactoring}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {171--186},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.171},
URN = {urn:nbn:de:0030-drops-40378},
doi = {10.4230/OASIcs.SLATE.2013.171},
annote = {Keywords: Automated grammar refactoring, refactoring operators, grammar refactoring patterns, evolutionary algorithms, task-driven transformations}
}
Document
Defining Domain Language of Graphical User Interfaces
Abstract
Domain-specific languages are computer (programming, modeling, specification) languages devoted to solving problems in a specific domain. The least examined DSL development phases are analysis and design. Various formal methodologies exist, however domain analysis is still done informally most of the time. There are also methodologies of deriving DSLs from existing ontologies but the presumption is to have an ontology for the specific domain. We propose a solution of a user interface driven domain analysis and we
focus on how it can be incorporated into the DSL design phase. We will present the preliminary results of the DEAL prototype, which can be used to transform GUIs to DSL grammars incorporating concepts from a domain and thus to help in the preliminary phases of the DSL design.
Cite as
Michaela Baciková, Jaroslav Porubän, and Dominik Lakatos. Defining Domain Language of Graphical User Interfaces. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 187-202, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{bacikova_et_al:OASIcs.SLATE.2013.187,
author = {Bacikov\'{a}, Michaela and Porub\"{a}n, Jaroslav and Lakatos, Dominik},
title = {{Defining Domain Language of Graphical User Interfaces}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {187--202},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.187},
URN = {urn:nbn:de:0030-drops-40381},
doi = {10.4230/OASIcs.SLATE.2013.187},
annote = {Keywords: graphical user interfaces, domain analysis, formalization, domain-specific languages, DEAL}
}
Document
ABC with a UNIX Flavor
Abstract
abc is a simple, yet powerful, textual musical notation. This paper presents abc::dt, a rule-based domain-specific language (Perl embedded), designed to simplify the creation of abc processing tools. Inspired by the Unix philosophy, those tools intend to be simple and compositional in a Unix filters' way. From abc::dt's rules we obtain an abc processing tool whose main algorithm follows a traditional compiler architecture, thus consisting of three stages: 1) abc parser (based on abcmtops' parser), 2) abc semantic transformation (associated with abc attributes), 3) output generation (either a user defined or system provided abc generator).
Cite as
Bruno M. Azevedo and José João Almeida. ABC with a UNIX Flavor. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 203-218, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{azevedo_et_al:OASIcs.SLATE.2013.203,
author = {Azevedo, Bruno M. and Almeida, Jos\'{e} Jo\~{a}o},
title = {{ABC with a UNIX Flavor}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {203--218},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.203},
URN = {urn:nbn:de:0030-drops-40397},
doi = {10.4230/OASIcs.SLATE.2013.203},
annote = {Keywords: Music Processing, ABC Notation, Unix, Scripting, Compilers}
}
Document
Specifying Adaptations through a DSL with an Application to Mobile Robot Navigation
Abstract
Developing applications for resource-constrained embedded systems is a challenging task specially when applications must adapt to changes in their operating conditions or environment. To ensure an appropriate response at all times, it is highly desirable to develop applications that can dynamically adapt their behavior at run-time. In this paper we introduce an architecture that allows the specification of adaptable behavior through an external, high-level and platform-independent domain-specific language (DSL). The DSL is used here to define adaptation rules that change the run-time behavior of the application depending on various operational factors, such as time constraints. We illustrate the use of the DSL in an application to mobile robot navigation using smartphones, where experimental results highlight the benefits of specifying the adaptable behavior in a flexible and external way to the main application logic.
Cite as
André C. Santos, João M. P. Cardoso, Pedro C. Diniz, and Diogo R. Ferreira. Specifying Adaptations through a DSL with an Application to Mobile Robot Navigation. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 219-234, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{santos_et_al:OASIcs.SLATE.2013.219,
author = {Santos, Andr\'{e} C. and Cardoso, Jo\~{a}o M. P. and Diniz, Pedro C. and Ferreira, Diogo R.},
title = {{Specifying Adaptations through a DSL with an Application to Mobile Robot Navigation}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {219--234},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.219},
URN = {urn:nbn:de:0030-drops-40403},
doi = {10.4230/OASIcs.SLATE.2013.219},
annote = {Keywords: Domain-specific language, run-time adaptations, adaptive behavior, embedded systems, mobile robot navigation}
}
Document
Dictionary Alignment by Rewrite-based Entry Translation
Abstract
In this document we describe the process of aligning two standard
monolingual dictionaries: a Portuguese language dictionary and a Galician synonym dictionary. The main goal of the project is to provide an online dictionary that can show, in parallel, definitions
and synonyms in Portuguese and Galician for a specific word, written
in Portuguese or Galician.
These two languages are very close to each other, and that is the main reason we expect this idea to be viable. The main drawback is the lack of a good and free translation dictionary between these two languages, namely, a dictionary that can cover lexicons with more than one hundred thousand different words.
To solve this issue we defined a translation function, based on substitutions, that is able to achieve an F_1 score of 0.88 on a manually verified dictionary of nine thousand words. Using this same translation function to align a Portuguese--Galician dictionary we obtained almost 50% of the dictionary lexicon (more than eighty thousand words) alignment.
Cite as
Alberto Simões and Xavier Gómez Guinovart. Dictionary Alignment by Rewrite-based Entry Translation. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 237-247, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{simoes_et_al:OASIcs.SLATE.2013.237,
author = {Sim\~{o}es, Alberto and Guinovart, Xavier G\'{o}mez},
title = {{Dictionary Alignment by Rewrite-based Entry Translation}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {237--247},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.237},
URN = {urn:nbn:de:0030-drops-40413},
doi = {10.4230/OASIcs.SLATE.2013.237},
annote = {Keywords: translation, rewrite system, dictionary, dictionary alignment}
}
Document
Combining Language Independent Part-of-Speech Tagging Tools
Abstract
Part-of-speech tagging is a fundamental task of natural language processing. For languages with a very rich agglutinating morphology, generic PoS tagging algorithms do not yield very high accuracy due to data sparseness issues. Though integrating a morphological analyzer can efficiently solve this problem, this is a resource-intensive solution. In this paper we show a method of combining language independent statistical solutions -- including a statistical machine translation tool -- of PoS-tagging to effectively boost tagging accuracy. Our experiments show that, using the same training set, our combination of language independent tools yield an accuracy that approaches that of a language dependent system with an integrated morphological analyzer.
Cite as
György Orosz, László János Laki, Attila Novák, and Borbála Siklósi. Combining Language Independent Part-of-Speech Tagging Tools. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 249-257, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{orosz_et_al:OASIcs.SLATE.2013.249,
author = {Orosz, Gy\"{o}rgy and Laki, L\'{a}szl\'{o} J\'{a}nos and Nov\'{a}k, Attila and Sikl\'{o}si, Borb\'{a}la},
title = {{Combining Language Independent Part-of-Speech Tagging Tools}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {249--257},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.249},
URN = {urn:nbn:de:0030-drops-40441},
doi = {10.4230/OASIcs.SLATE.2013.249},
annote = {Keywords: part-of-speech tagging, combination, agglutinative languages, machine learning, machine translation}
}
Document
Comparing Different Methods for Disfluency Structure Detection
Abstract
This paper presents a number of experiments focusing on assessing
the performance of different machine learning methods on the identification of disfluencies and their distinct structural regions over speech data. Several machine learning methods have been applied, namely Naive Bayes, Logistic Regression, Classification and Regression Trees (CARTs), J48 and Multilayer Perceptron. Our experiments show that CARTs outperform the other methods on the identification of the distinct structural disfluent regions. Reported experiments are based on audio segmentation and prosodic features, calculated from a corpus of university lectures in European Portuguese, containing about 32h of speech and about 7.7% of disfluencies. The set of features automatically extracted from the forced alignment corpus proved to be discriminant of the regions contained in the production of a disfluency. This work shows that
using fully automatic prosodic features, disfluency structural regions
can be reliably identified using CARTs, where the best results achieved correspond to 81.5% precision, 27.6% recall, and 41.2% F-measure. The best results concern the detection of the interregnum, followed by the detection of the interruption point.
Cite as
Henrique Medeiros, Fernando Batista, Helena Moniz, Isabel Trancoso, and Luis Nunes. Comparing Different Methods for Disfluency Structure Detection. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 259-269, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{medeiros_et_al:OASIcs.SLATE.2013.259,
author = {Medeiros, Henrique and Batista, Fernando and Moniz, Helena and Trancoso, Isabel and Nunes, Luis},
title = {{Comparing Different Methods for Disfluency Structure Detection}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {259--269},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.259},
URN = {urn:nbn:de:0030-drops-40420},
doi = {10.4230/OASIcs.SLATE.2013.259},
annote = {Keywords: Machine learning, speech processing, prosodic features, automatic detection of disfluencies}
}
Document
Syntactic REAP.PT: Exercises on Clitic Pronouning
Abstract
The emerging interdisciplinary field of Intelligent Computer Assisted Language Learning (ICALL) aims to integrate the knowledge from computational linguistics into computer-assisted language learning (CALL). REAP.PT is a project emerging from this new field, aiming to teach Portuguese in an innovative and appealing way, and adapted to each student. In this paper, we present a new improvement of the REAP.PT system, consisting in developing new, automatically generated, syntactic exercises. These exercises deal with the complex phenomenon of pronominalization, that is, the substitution of a syntactic constituent with an adequate pronominal form. Though the transformation may seem simple, it involves complex lexical, syntactical and semantic constraints. The issues on pronominalization in Portuguese make it a particularly difficult aspect of language learning for non-native speakers. On the other hand, even native speakers can often be uncertain about the correct clitic positioning, due to the complexity and interaction of competing factors governing this phenomenon. A new architecture for automatic syntactic exercise generation is proposed. It proved invaluable in easing the development of this complex exercise, and is expected to make a relevant step forward in the development of future syntactic exercises, with the potential of becoming a syntactic exercise generation framework. A pioneer feedback system with detailed and automatically generated explanations for each answer is also presented, improving the learning experience, as stated in user comments. The expert evaluation and crowd-sourced testing positive results demonstrated the validity of the present approach.
Cite as
Tiago Freitas, Jorge Baptista, and Nuno Mamede. Syntactic REAP.PT: Exercises on Clitic Pronouning. In 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), Volume 29, pp. 271-285, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
Copy BibTex To Clipboard
@InProceedings{freitas_et_al:OASIcs.SLATE.2013.271,
author = {Freitas, Tiago and Baptista, Jorge and Mamede, Nuno},
title = {{Syntactic REAP.PT: Exercises on Clitic Pronouning}},
booktitle = {2nd Symposium on Languages, Applications and Technologies},
pages = {271--285},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-52-1},
ISSN = {2190-6807},
year = {2013},
volume = {29},
editor = {Leal, Jos\'{e} Paulo and Rocha, Ricardo and Sim\~{o}es, Alberto},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2013.271},
URN = {urn:nbn:de:0030-drops-40433},
doi = {10.4230/OASIcs.SLATE.2013.271},
annote = {Keywords: Intelligent Computer Assisted Language Learning (ICALL), Portuguese, Syntactic Exercises, Automatic Exercise Generation, Clitic Pronouning}
}