Grammatical Framework Export

@article{citeulike:346448, 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.}, address = {New York, NY, USA}, author = {Aarne Rant, A.}, citeulike-article-id = {346448}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=967507}, citeulike-linkout-1 = {http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=196719}, citeulike-linkout-2 = {http://dx.doi.org/10.1017/S0956796803004738}, comment = {<http://www.cs.chalmers.se/\~{}aarne/GF/> Free versions available thru Google}, doi = {10.1017/S0956796803004738}, issn = {0956-7968}, journal = {Journal of Functional Programming}, keywords = {grammar, haskell, logic, natural-language, zippers}, month = {March}, number = {02}, pages = {145--189}, posted-at = {2005-10-09 16:49:34}, priority = {2}, publisher = {Cambridge University Press}, title = {Grammatical Framework}, url = {http://dx.doi.org/10.1017/S0956796803004738}, volume = {14}, year = {2004} }

TY - JOUR ID - citeulike:346448 L3 - citeulike-article-id:346448 N2 - 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. IS - 02 JF - Journal of Functional Programming SN - 0956-7968 AD - New York, NY, USA EP - 189 TI - Grammatical Framework PB - Cambridge University Press VL - 14 SP - 145 KW - grammar KW - haskell KW - logic KW - natural-language KW - zippers N1 - <http://www.cs.chalmers.se/~aarne/GF/> Free versions available thru Google AU - Aarne Rant, A PY - 2004/03// UR - http://dx.doi.org/10.1017/S0956796803004738 ER -