Grammatical framework. A type-theoretical grammar formalism. 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.

References in zbMATH (referenced in 34 articles , 1 standard article )

Showing results 1 to 20 of 34.
Sorted by year (citations)

1 2 next

  1. Nederhof, Mark-Jan; Yli-Jyrä, Anssi: A derivational model of discontinuous parsing (2021)
  2. Hellan, Lars: Construction-based compositional grammar (2019)
  3. Nguyen, Van Duc; Son, Tran Cao; Pontelli, Enrico: Natural language generation for non-expert users (2019)
  4. Kallmeyer, Laura; Maier, Wolfgang: LR parsing for LCFRS (2016)
  5. Asher, Nicholas: Selectional restrictions, types and categories (2014)
  6. Chatzikyriakidis, Stergios; Luo, Zhaohui: Natural language inference in Coq (2014)
  7. Angelov, Krasimir; Camilleri, John J.; Schneider, Gerardo: A framework for conflict analysis of normative texts written in controlled natural language (2013)
  8. Schodl, Peter; Neumaier, Arnold; Kofler, Kevin; Domes, Ferenc; Schichl, Hermann: Towards a self-reflective, context-aware semantic representation of mathematical specifications (2012)
  9. Pollard, Carl: Covert movement in logical grammar (2011)
  10. Ranta, Aarne: Translating between language and logic: what is easy and what is difficult (2011)
  11. Angelov, Krasimir; Bringert, Björn; Ranta, Aarne: PGF: A portable run-time format for type-theoretical grammars (2010) ioport
  12. Francez, Nissim; Dyckhoff, Roy: Proof-theoretic semantics for a natural language fragment (2010)
  13. Muskens, Reinhard: New directions in type-theoretic grammars (2010) ioport
  14. Lamar, Robert; Kamareddine, Fairouz; Wells, J. B.: MathLang translation to Isabelle syntax (2009)
  15. Ranta, Aarne: Grammars as software libraries (2009)
  16. Asher, Nicholas: A type driven theory of predication with complex types (2008)
  17. de Groote, Philippe; Maarek, Sarah; Yoshinaka, Ryo: On two extensions of abstract categorial grammars (2007)
  18. Ranta, Aarne: Modular grammar engineering in GF (2007) ioport
  19. Wagner, Marc; Autexier, Serge; Benzmüller, Christoph: \textscPlat(\Omega): a mediator between text-editors and proof assistance systems (2007)
  20. Jojgov, G. I.: Translating a fragment of weak type theory into type theory with open terms (2006)

1 2 next