Aarne Ranta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Aarne Ranta has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Carrión del Fresno1 shared publication
- Ekaterina Voloshina1 shared publication
- Elizaveta Zimina
Tampere University
1 shared publication - Jaakko Peltonen
Tampere University, Tampere, Finland
1 shared publication - Jyrki Nummenmaa
Tampere University
1 shared publication - Kalervo Järvelin
Faculty of Information Technology and Communication Sciences, Tampere University, Tampere, Finland
1 shared publication
Latest Publications
- 24 May 2026
- Published by Springer Nature
- p. 1-23
Natural Language Generation from Wikidata—Architecture, Scalability and Challenges
- 24 May 2026
- Published by Springer Nature
- p. 1-23
Natural Language Generation from Wikidata—Architecture, Scalability and Challenges
- 16 June 2024
- Published by Springer Nature
- p. 19-33
TraQuLA: Transparent Question Answering Over RDF Through Linguistic Analysis
- 16 June 2024
- Published by Springer Nature
- p. 19-33
TraQuLA: Transparent Question Answering Over RDF Through Linguistic Analysis
- 22 January 2004
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 14 (2) , 145-189
Grammatical Framework
Grammatical Framework (GF) is a special-purpose functional language for defining grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to this a notation for defining concrete syntax. GF grammars themselves are purely declarative, but can be used both for linearizing syntax trees and parsing strings. GF can describe both formal and natural languages. The key notion of this description is a grammatical object, which is not just a string, but a record that contains all information on inflection and inherent grammatical features such as number and gender in natural languages, or precedence in formal languages. Grammatical objects have a type system, which helps to eliminate run-time errors in language processing. In the same way as a LF, GF uses dependent types in abstract syntax to express semantic conditions, such as well-typedness and proof obligations. Multilingual grammars, where one abstract syntax has many parallel concrete syntaxes, can be used for reliable and meaning-preserving translation. They can also be used in authoring systems, where syntax trees are constructed in an interactive editor similar to proof editors based on LF. While being edited, the trees can simultaneously be viewed in different languages. This paper starts with a gradual introduction to GF, going through a sequence of simpler formalisms till the full power is reached. The introduction is followed by a systematic presentation of the GF formalism and outlines of the main algorithms: partial evaluation and parser generation. The paper concludes by brief discussions of the Haskell implementation of GF, existing applications, and related work.
- 22 January 2004
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 14 (2) , 145-189
Grammatical Framework
Grammatical Framework (GF) is a special-purpose functional language for defining grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to this a notation for defining concrete syntax. GF grammars themselves are purely declarative, but can be used both for linearizing syntax trees and parsing strings. GF can describe both formal and natural languages. The key notion of this description is a grammatical object, which is not just a string, but a record that contains all information on inflection and inherent grammatical features such as number and gender in natural languages, or precedence in formal languages. Grammatical objects have a type system, which helps to eliminate run-time errors in language processing. In the same way as a LF, GF uses dependent types in abstract syntax to express semantic conditions, such as well-typedness and proof obligations. Multilingual grammars, where one abstract syntax has many parallel concrete syntaxes, can be used for reliable and meaning-preserving translation. They can also be used in authoring systems, where syntax trees are constructed in an interactive editor similar to proof editors based on LF. While being edited, the trees can simultaneously be viewed in different languages. This paper starts with a gradual introduction to GF, going through a sequence of simpler formalisms till the full power is reached. The introduction is followed by a systematic presentation of the GF formalism and outlines of the main algorithms: partial evaluation and parser generation. The paper concludes by brief discussions of the Haskell implementation of GF, existing applications, and related work.
- Open Access
- 1 January 2004
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 165 (165)
Computational semantics in type theory
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague’s PTQ model: the construction of analysis trees, the linearization of trees into strings, and the interpretation of trees as logical formulas. Moreover, a parsing algorithm is derived from the grammar. Given that GF is a constructive type theory with dependent types, the technique extends from explain anaphoric reference. On the other hand, GF has a built-in compositionality requirement that is stronger than in PTQ and prevents us from formulating quantifying-in rules of Montague style. This leads us to alternative formulations of such rules in terms of combinators and discontinuous constituents. The PTQ fragment will moreover be presented as an example of how a GF grammar is modified by replacing English with another target language, French. The paper concludes by a discussion of the complementary rôles of logically and linguistically oriented syntax.
- 1 January 2004
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 165 (165)
Open AccessComputational semantics in type theory
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague’s PTQ model: the construction of analysis trees, the linearization of trees into strings, and the interpretation of trees as logical formulas. Moreover, a parsing algorithm is derived from the grammar. Given that GF is a constructive type theory with dependent types, the technique extends from explain anaphoric reference. On the other hand, GF has a built-in compositionality requirement that is stronger than in PTQ and prevents us from formulating quantifying-in rules of Montague style. This leads us to alternative formulations of such rules in terms of combinators and discontinuous constituents. The PTQ fragment will moreover be presented as an example of how a GF grammar is modified by replacing English with another target language, French. The paper concludes by a discussion of the complementary rôles of logically and linguistically oriented syntax.