Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 23
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Daud, Ali Khan, Wahab and Che, Dunren 2016. Urdu language processing: a survey. Artificial Intelligence Review,


    Ferré, Sébastien 2016. The Semantic Web. Latest Advances and New Domains.


    Liepiņš, Renārs Bojārs, Uldis Grūzītis, Normunds Čerāns, Kārlis and Celms, Edgars 2016. Databases and Information Systems.


    Safwat, Hazem and Davis, Brian 2016. CNLs for the semantic web: a state of the art. Language Resources and Evaluation,


    Gruzitis, Normunds and Dannélls, Dana 2015. A multilingual FrameNet-based grammar and lexicon for controlled natural language. Language Resources and Evaluation,


    Ranta, Aarne 2015. The Handbook of Contemporary Semantic Theory.


    Asher, Nicholas 2014. Selectional restrictions, types and categories. Journal of Applied Logic, Vol. 12, Issue. 1, p. 75.


    Palogiannidi, Elisavet Klasinas, Ioannis Potamianos, Alexandros and Iosif, Elias 2014. 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). p. 3211.

    Bing Li, Wei Su, Yi Yang, and Lian Li, 2013. IEEE Conference Anthology. p. 1.

    Dapoigny, Richard and Barlatier, Patrick 2013. Formal foundations for situation awareness based on dependent type theory. Information Fusion, Vol. 14, Issue. 1, p. 87.


    Asher, Nicholas 2012. Philosophy of Linguistics.


    Davis, Brian Dantuluri, Pradeep Handschuh, Siegfried and Cunningham, Hamish 2012. Semantic-Enabled Advancements on the Web.


    Ginzburg, Jonathan 2011. Semantics.


    Francez, Nissim and Dyckhoff, Roy 2010. Proof-theoretic semantics for a natural language fragment. Linguistics and Philosophy, Vol. 33, Issue. 6, p. 447.


    Martínez, Enrique Díaz, Gregorio Cambronero, M. Emilia and Schneider, Gerardo 2010. 2010 IEEE International Conference on Services Computing. p. 1.

    Muskens, Reinhard 2010. New Directions in Type-Theoretic Grammars. Journal of Logic, Language and Information, Vol. 19, Issue. 2, p. 129.


    Ranta, Aarne 2009. GF: A Multilingual Grammar Formalism. Language and Linguistics Compass, Vol. 3, Issue. 5, p. 1242.


    Strotmann, Andreas 2009. Universal abstracting. Proceedings of the American Society for Information Science and Technology, Vol. 46, Issue. 1, p. 1.


    Caprotti, Olga 2007. Language technologies for semantic markup in mathematics. PAMM, Vol. 7, Issue. 1, p. 1010503.


    Ranta, Aarne 2007. Modular Grammar Engineering in GF. Research on Language and Computation, Vol. 5, Issue. 2, p. 133.


    ×

Grammatical Framework

  • AARNE RANTA (a1)
  • DOI: http://dx.doi.org/10.1017/S0956796803004738
  • Published online: 01 March 2004
Abstract

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.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×