| 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.
|
|
| 11. |
|
|
| 12. |
|
|
| 13. |
- Bringert, Björn, 1979, et al.
(författare)
-
Interactive Multilingual Web Applications with Grammatical Framework
- 2008
-
Ingår i: Advances in Natural Language Processing, 6th International Conference, GoTAL 2008, Gothenburg, Sweden. ; , s. 336-347
-
Konferensbidrag (refereegranskat)abstract
- We present an approach to multilingual web content based on multilingual grammars and syntax editing for a controlled language. Content can be edited in any supported language and it is automatically kept within a controlled language fragment. We have implemented a web-based syntax editor for Grammatical Framework (GF) grammars which allows both direct abstract syntax tree manipulation and text input in any of the languages supported by the grammar. With this syntax editor and the GF JavaScript API, GF grammars can be used to build multilingual web applications. As a demonstration, we have implemented an example application in which users can add, edit and review restaurants in English, Spanish and Swedish.
|
|
| 14. |
- Bringert, Björn, 1979, et al.
(författare)
-
Multimodal Dialogue System Grammars
- 2005
-
Ingår i: Proceedings of DIALOR'05, Ninth Workshop on the Semantics and Pragmatics of Dialogue.
-
Tidskriftsartikel (refereegranskat)abstract
- We describe how multimodal grammars for dialogue systems can be written using the Grammatical Framework (GF) formalism. A proof-of-concept dialogue system constructed using these techniques is also presented. The software engineering problem of keeping grammars for different languages, modalities and systems (such as speech recognizers and parsers) in sync is reduced by the formal relationship between the abstract and concrete syntaxes, and by generating equivalent grammars from GF grammars.
|
|
| 15. |
- Bringert, Björn, 1979
(författare)
-
Programming Language Techniques for Natural Language Applications
- 2008
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- It is easy to imagine machines that can communicate in natural language. Constructing such machines is more difficult. The aim of this thesis is to demonstrate how declarative grammar formalisms that distinguish between abstract and concrete syntax make it easier to develop natural language applications. We describe how the type-theorectical grammar formalism Grammatical Framework (GF) can be used as a high-level language for natural language applications. By taking advantage of techniques from the field of programming language implementation, we can use GF grammars to perform portable and efficient parsing and linearization, generate speech recognition language models, implement multimodal fusion and fission, generate support code for abstract syntax transformations, generate dialogue managers, and implement speech translators and web-based syntax-aware editors. By generating application components from a declarative grammar, 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.
|
|
| 16. |
- Bringert, Björn, 1979
(författare)
-
Rapid Development of Dialogue Systems by Grammar Compilation
- 2007
-
Ingår i: Proceedings of the 8th SIGdial Workshop on Discourse and Dialogue. - 9789074029322 ; , s. 223-226
-
Konferensbidrag (refereegranskat)abstract
- We propose a method for rapid development of dialogue systems where a Grammatical Framework (GF) grammar is compiled into a complete VoiceXML application. This makes dialogue systems easy to develop, maintain, localize, and port to other platforms, and can improve the linguistic quality of generated system output. We have developed compilers which produce VoiceXML dialogue managers and ECMAScript linearization code from GF grammars. Along with the existing GF speech recognition grammar compiler, this makes it possible to produce a complete mixed-initiative information-seeking dialogue system from a single GF grammar.
|
|
| 17. |
- Bringert, Björn, 1979
(författare)
-
Speech Recognition Grammar Compilation in Grammatical Framework
- 2007
-
Ingår i: Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing. ; , s. 1-8
-
Konferensbidrag (refereegranskat)abstract
- This paper describes how grammar-based language models for speech recognition systems can be generated from Grammatical Framework (GF) grammars. Context-free grammars and finite-state models can be generated in several formats: GSL, SRGS, JSGF, and HTK SLF. In addition, semantic interpretation code can be embedded in the generated context-free grammars. This enables rapid development of portable, multilingual and easily modifiable speech recognition applications.
|
|
| 18. |
- Bringert, Björn, 1979
(författare)
-
Speech Translation with Grammatical Framework
- 2008
-
Ingår i: Coling 2008: Proceedings of the workshop on Speech Processing for Safety Critical Translation and Pervasive Applications, Manchester, UK. ; , s. 5-8
-
Konferensbidrag (refereegranskat)abstract
- Grammatical Framework (GF) is a grammar formalism which supports interlingua-based translation, library-based grammar engineering, and compilation to speech recognition grammars. We show how these features can be used in the construction of portable high-precision domain-specific speech translators.
|
|
| 19. |
- Bringert, Björn, 1979, et al.
(författare)
-
Student Paper: HaskellDB Improved
- 2004
-
Ingår i: Haskell '04: Proceedings of the ACM SIGPLAN workshop on Haskell. - 1581138504 ; , s. 108-115
-
Konferensbidrag (refereegranskat)abstract
- We present an improved version of the HaskellDB database library. The original version relied on TRex, a Haskell extension supported only by the Hugs interpreter. We have replaced the use of TRex by a record implementation which uses more commonly implemented Haskell extensions. Additionally, HaskellDB now supports two different cross-platform database backends. Other changes include database creation functionality, bounded string support, performance enhancements, fixes to the optimisation logic, transaction support and more fine grained expression types.
|
|
| 20. |
- Ranta, Aarne, 1963, et al.
(författare)
-
Grammar Development in GF
- 2009
-
Ingår i: EACL. ; , s. 57-60
-
Konferensbidrag (refereegranskat)
|
|
