| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
PGF: A Portable Run-time Format for Type-theoretical Grammars
- 2010
-
Ingår i: Journal of Logic, Language and Information. - : Springer Science and Business Media LLC. - 0925-8531 .- 1572-9583. ; 19:2, s. 201-228
-
Tidskriftsartikel (refereegranskat)abstract
- Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems.
|
|
| 7. |
- Angelov, Krasimir, 1978, et al.
(författare)
-
Speech-Enabled Hybrid Multilingual Translation for Mobile Devices
- 2014
-
Ingår i: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics. - : Association for Computational Linguistics. - 9781937284756
-
Konferensbidrag (refereegranskat)abstract
- This paper presents an architecture and a prototype for speech-to-speech translation on Android devices, based on GF (Grammatical Framework). From the user’s point of view, the advantage is that the system works off-line and yet has a lean size; it also gives, as a bonus, grammatical information useful for language learners. From the developer’s point of view, the advantage is the open architecture that permits the customization of the system to new languages and for special purposes. Thus the architecture can be used for controlled-language-like translators that deliver very high quality, which is the traditional strength of GF. However, this paper focuses on a general-purpose system that allows arbitrary input. It covers eight languages.
|
|
| 8. |
- Bringert, Björn, 1979, et al.
(författare)
-
A pattern for almost compositional functions
- 2006
-
Ingår i: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, Portland, Oregon, USA, September 18-20, 2006. - 1595933093 ; , s. 216-226
-
Konferensbidrag (refereegranskat)abstract
- This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional" means that for a number of the constructors in the type(s), the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern are given. The relationship to the "Scrap Your Boilerplate" approach to generic programming, and to general tree types in dependent type theory are also investigated.
|
|
| 9. |
- Bringert, Björn, 1979, et al.
(författare)
-
A Pattern for Almost Compositional Functions
- 2008
-
Ingår i: Journal of Functional Programming. - 0956-7968. ; 18:5-6, s. 567-598
-
Tidskriftsartikel (refereegranskat)abstract
- This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional" means that for all of the constructors in the type(s), except a limited number of them, the result of the function depends only on the constructor and the results of calling the function on the constructor's arguments. The pattern consists of a generic part constructed once for each data type or family of data types, and a task-specific part. The generic part contains the code for the predictable compositional cases, leaving the interesting work to the task-specific part. Examples of the pattern are given, implemented in dependent type theory with inductive families, in Haskell with generalized algebraic data types and rank-2 polymorphism, and in Java using a variant of the Visitor design pattern. The relationships to the "Scrap Your Boilerplate" approach to generic programming, and to general tree types in dependent type theory, are investigated by reimplementing our operations using those frameworks.
|
|
| 10. |
- Bringert, Björn, 1979
(författare)
-
Compiling Grammar-based Speech Application Components
- 2007
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- It is easy to imagine machines that can communicate using spoken natural language. Constructing such machines is more difficult. The available methods for development of interactive speech applications are costly, and current research is mainly focused on producing more sophisticated systems, rather than on making it easier to build them. This thesis describes how components used in interactive speech applications can be automatically derived from natural language grammars written in Grammatical Framework (GF). By using techniques borrowed from the field of programming language implementation, we can generate speech recognition language models, multimodal fusion and fission components, and support code for abstract syntax transformations. By automatically generating these components, we can reduce duplicated work, ensure consistency, make it easier to build multilingual systems, improve linguistic quality, enable re-use across system domains, and make systems more portable.
|
|
