| 1. |
- Caprotti, Olga, 1964, et al.
(författare)
-
High-quality translation: Molto tools and applications
- 2012
-
Ingår i: The fourth Swedish Language Technology Conference (SLTC).
-
Konferensbidrag (refereegranskat)abstract
- MOLTO (Multilingual On Line Translation, FP7-ICT-247914, www.molto-project.eu) is a European project focusing on translation on the web. MOLTO targets translation that has production quality, that is, usable for quick and reliable dissemination of information. MOLTO’s main focus is to increase the productivity of such translation systems, building on the technology of GF (Grammatical Framework) and its Resource Grammar Library. But MOLTO also develops hybrid methods which increase the quality of Statistical Machine Translation (SMT) by adding linguistic information, or bootstrap grammatical models from statistical models. This paper gives a brief overview of MOLTO’s latest achievements, many of which are more thoroughly described in separate papers and available as web-based demos and as open-source software.
|
|
| 2. |
- Caprotti, Olga, 1964, et al.
(författare)
-
The MOLTO Phrasebook
- 2010
-
Ingår i: Swedish Language Technology Conference SLTC 2010.
-
Konferensbidrag (refereegranskat)
|
|
| 3. |
|
|
| 4. |
- Carlsson, Magnus, 1964, et al.
(författare)
-
Fudgets - Purely Functional Processes with applications to Graphical User Interfaces
- 1998
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The main result of this thesis is a method for writing programs with graphical user interfaces in purely functional languages. The method is based on a new abstraction called the fudget. The method makes good use of key abstraction powers of functional languages, such as higher order functions and parametric polymorphism. The Fudget concept is defined in terms of the simpler concept of stream processors, which can be seen as a simple, but practically useful incarnation of the process concept. Programs based on fudgets and stream processors are networks of communicating processes that are built hierarchically, using combinators. Communication is type safe. The basic combinators provide serial compositions, parallel compositions, and loops. A key difference between previous work on stream processing functions and our approach is that we deliberately abstract away from the streams. We obtain a system that can be implemented deterministically, entirely within a purely functional language, but which also makes it possible to take advantage of parallel evaluation and indeterminism, where such is available within the functional language. The purely functional approach makes processes first class values and makes it easy to express process cloning and process migration. The practical viability of the approach is demonstrated by the Fudget library, which is an implementation of a graphical user interface toolkit in the purely functional language Haskell, together with a number of small an large applications that have been implemented on top of the library. In addition to GUI programming, fudgets are suitable for other forms of concurrent I/O programming. We demonstrate how client/server based applications can be we written, with type safe communication between client and server. We show a web browser as an example where GUI programming and network communication come together. We view fudgets as one example of a more general combinator-based approach to promote the idea that a functional language together with combinator libraries is a good alternative to using less expressive languages propped by application-specific tools. We describe a set of combinators, reminiscent of parsing combinators, for building syntax-directed editors.
|
|
| 5. |
- Hallgren, Thomas, 1965, et al.
(författare)
-
A Cloud-Based Editor for Multilingual Grammars
- 2015
-
Ingår i: ACL-IJCNLP 2015. - : Association for Computational Linguistics.
-
Konferensbidrag (refereegranskat)abstract
- Abstract Writing deep linguistic grammars has been considered a highly specialized skill, requiring the use of tools with steep learning curves and complex installation procedures. As the use of statistical methods has increased, new generations of computational linguists are getting less and less prepared for grammar writing tasks. In an aim to provide a better learning experience for grammar writers, we present a grammar engineering tool that resides in the cloud. It has been used in several tutorial courses and self-studies, and it ...
|
|
| 6. |
- Hallgren, Thomas, 1965
(författare)
-
Subtypes in Polymorphic Functional Languages
- 2013
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis is about type systems, and in particular type systems that extend or are otherwise close to the type system used in the functional language ML. ML meant a big step forward for type systems used in practical programming languages. Two main novelties with the ML type system, as compared to for example Pascal, are polymorphism and automatic type inference. Another important feature of ML is the powerful data type declarations and the associated pattern matching mechanism. The thesis consists of two interleaved parts: an overview of various type systems relating to ML (part A), and a presentation of a new extension of ML with subtypes (part B). The overview part covers, in varying detail, concepts like polymorphism, universally quantified types, existentially quantified types, conjunction types, different forms of subtyping, bounded quantification, type classes in Haskell and automatic type inference. The purpose of the extension of ML presented in part B is to provide the subtype relations available for variant types in the language Fun (described by L. Cardelli and P. Wegner) through new kinds of type declarations. These declarations allows the programmer to define subtypes or supertypes by removing or adding constructors from an existing type. It is also possible to form the union of previously defined data types. To implement the extension of ML, we examine some existing type systems that have the key ingredients needed: polymorphism, subtypes and automatic type inference. We choose to work with Fuh & Mishra's type system with constraint sets. This type system is not the ideal solution for the kind of subtypes provided by our extension. To be able to use Fuh & Mishra's type inference algorithm we make some restrictions to our extension. The type inference algorithm is extended to handle pattern matching. Keywords: type systems, polymorphism, subtypes, functional languages, ML, type inference
|
|
| 7. |
|
|
| 8. |
- Ranta, Aarne, 1963, et al.
(författare)
-
Tools for multilingual grammar-based translation on the web
- 2010
-
Ingår i: 48th Annual Meeting of the Association for Computational Linguistics, ACL 2010; Uppsala; Sweden; 11 July 2010 through 16 July 2010. - 9781617388088 ; , s. 66-71
-
Konferensbidrag (refereegranskat)abstract
- This is a system demo for a set of tools for translating texts between multiple languages in real time with high quality. The translation works on restricted languages, and is based on semantic interlinguas. The underlying model is GF(Grammatical Framework), which is an open-source toolkit for multilingual grammar implementations. The demo will cover up to 20 parallel languages. Two related sets of tools are presented: grammarian's tools helping to build translators for new domains and languages, and translator's tools helping to translate documents. The grammarian's tools are designed to make it easy to port the technique to new applications. The translator's tools are essential in the restricted language context, enabling the author to remain in the fragments recognized by the system. The tools that are demonstrated will be applied and developed further in the European project MOLTO (Multilingual On-Line Translation) which has started in March 2010 and runs for three years.
|
|
