Examples and demos
-Numeral translator: recognizes and generates +Numeral +translator: recognizes and generates numbers from 1 to 999,999 in 80 languages. +(The link goes to a live applet, which requires +Java 1.5 plugin. +Here is an example, which does +not require the plugin.)@@ -130,8 +136,7 @@ French, Swedish, and Russian with a few mouse clicks.
-Resource grammar -library: +Resource grammar library: basic structures of seven languages (English, Finnish, French, German, Italian, Russian, Swedish). Resource grammars can be used as libraries for writing GF @@ -143,7 +148,7 @@ but they can also be useful for language training. GF is available precompiled for several platforms: Linux, Mac OS X, Microsoft Windows, and Sun OS. -For more information, see the Download Page. +For more information, see the Download Page.
Source code
@@ -160,9 +165,9 @@ The platform-independent graphical user interface is written inHere is a -GF source package, which includes a Makefile +GF source package, which includes a Makefile for different platforms and Haskell compilers. -The Download Page gives more information on +The Download Page gives more information on compiler requirements.
@@ -175,39 +180,39 @@ Here are some older source packages still available:
- -User's tutorial +User's tutorial on editing in the Java interface.
- -Grammarian's tutorial +Grammarian's tutorial on writing GF grammars, with exercises.
- - + GF in 25 Minutes for programmers.
- -Grammatical Framework: A Type-Theoretical +Grammatical Framework: A Type-Theoretical Grammar Formalism (ps.gz). Theoretical paper on GF by A. Ranta, appeared in The Journal of Functional Programming, vol. 14:2. 2004, pp. 145-189.
- - + User Manual explaining the GF user interfaces and command language.
- - + Language specification of the GF grammar formalism.
- - + Highlights of Version 2.0 (in comparison with version 1.1).
- - + Bibliography: publications on GF, as well as background literature.
@@ -237,14 +245,9 @@ in Vienna 2003.
- - + Package of example GF grammars -
- Gramlets: @@ -256,16 +259,6 @@ GF grammars compiled to Java applets. The GF Xerox Home Page with the oldest releases of and documents on GF, Version 0.54, 1999. -
- - -Local guide -on running GF on Chalmers CS computers. - -
- -Application project: - - Grammars for Object-Oriented Software Specifications -by Kristofer Johannisson.
-
Earlier application:
@@ -295,15 +288,6 @@ More details on the
Authors and Acknowledgements page.
-
-
Implementation project
diff --git a/grammars/Makefile b/grammars/Makefile index 6d22fc4c6..3cb03e42a 100644 --- a/grammars/Makefile +++ b/grammars/Makefile @@ -4,3 +4,5 @@ distr: test: sh tst.sh +lib: + sh mkLib.sh diff --git a/lib/resource-0.6/index.html b/lib/resource-0.6/index.html new file mode 100644 index 000000000..db2fdec4d --- /dev/null +++ b/lib/resource-0.6/index.html @@ -0,0 +1,490 @@ + + + + ++ + + +News.
+
+The GF Resource Grammar Library
+ + +Aarne Ranta +2002-2004 + ++ +Version 0.6: source package. + +
+ +Current languages: English, Finnish, French, German, Italian, Russian, Swedish. + +
+ +10/8/2004 This document updated as a revision of the +old resource page. + +
+ +13/4/2004 Version 0.6 written using the module system of GF 2. Also an +extended coverage. The files are placed in separate subdirectories (one +per language) and have different names than before, so that file names +(without the extension .gf) are also legal module names. + + ++ + +Notice. You need GF Version 2.0beta or later +to work with these resource grammars. +It is available from the +GF home page. + + + +
+ + +
Introduction
+ +As programs in general can be divided into +-
+
- application programs +
- library programs +
-
+
- application grammars +
- resource grammars +
+ +A resource grammar is not based on semantics, but its +purpose is to define the linguistic "surface" structures +of some language. The availability of these structures makes it easier to +write application grammars. + +
+ +With resource grammars, we aim to achieve division of labour in +grammar writing: +
-
+
- application grammars are written by domain experts +
- resource grammars are written by linguists +
+ lin Even x = {s = + table { + m => x.s ++ + table {Ind => "est" ; Subj => "soit"} ! m ++ + table {Masc => "pair" ; Fem => "paire"} ! x.g + } + } ; ++but simply ++ lin Even = predA1 (adjReg "pair") ; +
+The author of the French resource grammar will have defined the +functions predAdj and adjReg in such a way that +they can be used in all applications. + ++ +What is more, the resource grammar has a language-independent +API, which makes it possible to write the corresponding rule +for other languages in a very similar way. For instance, the +German rule is +
+ lin Even = predA1 (adjReg "gerade") ; +
+ + + +Coverage
+ +The ultimate goal of the resource grammar library is a full coverage of the linguistic +structures of each language. As of Version 0.6, we still have some way +to go to reach that goal. But we do have +-
+
- fairly complete sets of inflection paradigms for each language +
- a representative fragment of syntax covering present-tense +indicative, interrogative, and imperative sentence. +
- lexica of structural words such as pronouns, articles, conjunctions. +
Demo
+ +To get an idea of the coverage of the resource library, and also +to help finding the right functions for your applications, you +can do ++ make test + jgf TestAll.gfcm +
+This opens the syntax editor with all the seven resource grammars +extended with a small lexicon. + + + + +Programmer's view on resource grammars
+ +The resource grammar library a hierarchical structure. Its main layers are +-
+
- The language-dependent core resources, to be described below. +
- The language-independent core resource API, + Combinations.gf. + Structural.gf. +
- The derived resource libraries, some of which are + language-dependent, some of which aren't. The most important + ones are the language-dependent lexical paradigm modules + ParadigmsX.gf. +
Grammaticality guarantee via data abstraction
+ +An important principle is that +-
+
- the core resource API and the derived resource libraries guarantee + that all type-correct uses of them preserve grammaticality. +
-
+
- all lin and + lincat rules are built solely from library functions and + argument variables. +
+ +Since the resource grammars are work in progress, their coverage is not +yet sufficient for complete data abstraction. In addition, there may of course +be bugs in the resource grammars that destroy grammaticality. The GF group is +grateful for bug reports, requests, and contributions! + +
+ +The most important exception to total data abstraction in practice is the +incompleteness of resource lexica. Since it is impossible to have +full coverage of all the words in a language, users often have to introduce +their own lexical entries, and thereby use literal strings in their GF code. +The safest and most convenient way of using this is via functions +defined in ParadigmsX.gf files. Using these functions guarantees +that the lexical entries created are type-correct. But nothing guards +against misspelling a word, picking a wrong inflectional pattern, or +a wrong inherent feature (such as gender). + + + +
The resource grammar documentation in gfdoc
+ +All documented GF grammars linked from this page +have been written in GF and then translated to HTML +using a light-weight documentation tool, +gfdoc. The tool is available as a part of the GF +source code package, in the Haskell file +util/GFDoc.hs that can be run in the Hugs interpreter +by the script util/gfdoc. The program also has the +flag +latex, which produces output in Latex instead of +HTML. + + + +The core resource API
+ +The API is divided into two modules, Combiantions and +its extension Structural. + ++ +The file Combinations.gf +gives the core resource type signatures of phrasal categories and +syntactic combination rules, together with some explanations +and examples. The examples are so far only in English, but their +equivalents are available in all of the languages for which the +API has been implemented. + +
+ +The file Structurals.gf +gives a list of structural words such as determiners, pronouns, +prepositions, and conjunctions. + +
+ +The file Structural.gf cannot be imported directly, but +via the generated files ResourceX.gf for each language X. +In these files, the fun/lin and cat/lincat judgements have been +translated into oper judgements. + + + +
The lexical paradigm modules
+ +The lexical paradigm modules define, for +each lexical category, a worst-case macro for adding words +of that category by giving a sufficient number of characteristic +forms. In addition, the most common regular paradigms are +included, where it is enough just to give one form to generate +all the others. + ++ +For example, the English paradigm module has the worst-case macro for nouns, +
+ mkN : (man,men,man's,men's : Str) -> Gender -> N ; +
+taking four forms and a gender (human or nonhuman, +as is also explained in the module). Its application ++ mkN "mouse" "mice" "mouse's" "mice's" nonhuman +
+defines all information that is needed for the noun mouse. +There are also some regular patterns, for instance, ++ nReg : Str -> Gender -> N ; -- dog, dogs + nKiss : Str -> Gender -> N ; -- kiss, kisses +
+examples of which are ++ nReg "car" nonhuman + nKiss "waitress" human +
+ ++ +Here are the documented versions of the paradigm modules: +
-
+
- English: ParadigmsEng.gf +
- Finnish: ParadigmsFin.gf +
- French: ParadigmsFra.gf +
- German: ParadigmsDeu.gf +
- Italian: ParadigmsIta.gf +
- Russian: ParadigmsRus.gf +
- Swedish: ParadigmsSwe.gf +
The derived resource libraries
+ +The core resource grammar is minimal in the sense that it defines the +smallest syntactic combinations and has no redundancy. For applications, it +is usually more convenient to use combinations of the minimal rules. +Some such combinations are given in the predication library, +which defines the simultaneous applications of one- and two-place +verbs and adjectives to all their argument noun phrases. It also +defines some other constructions useful for logical and mathematical +applications. + ++ +The API of the predication library is in the file +Predication.gf. +What is imported is one of the language-dependent files, +X/PredicationX.gf for each language X. + + + + +
Linguist's view on resource grammars
+ +GF and other grammar formalisms
+ +Linguists in particular might be interested in resource +grammars for their own sake, not as basis of applications. +Since few linguists are so far familiar with GF, we refer to the +GF Homepage +and especially to the +GF Tutorial. +What comes here is a brief summary of the relation of GF to +other record-based formalisms. + ++ +The records of GF are much like feature structures in PATR or HPSG. +The main differences are that +
-
+
- GF has a type system inherited from +functional programming languages; +
- GF records are primarily obtained as linearizations of trees, not +as parses of strings. +
+ {s = table {Sg => "cheval" ; Pl => "chevaux"} ; g = Masc} ; ++showing the full inflection table of the (abstract) noun cheval. +A PATR record +for the French word cheval would be ++ {s = "cheval" ; n = Sg ; g = Masc} ; ++showing just the information that can be gathered from the (concrete) +string cheval. +There is a rather straightforward sense in which the PATR record is an +instance of the GF record. + ++ +When generating language from syntax trees (or from logical formulas via +syntax trees), the record containing full inflection tables is an efficient +(linear-time) method of producing the correct forms. +This is important when text is generated in real time in +an interactive system. + + + +
The structure of core resource grammars
+ +As explained above, the application grammarian's view on resource grammars +is through API modules. They are collections of type signatures of functions. +It is the task of linguists to define these functions. +The definitions are in the end given +in the core resource grammars. + ++ +We have divided the core resource grammar for each language X +into the following parts: +
-
+
- Type system: TypesX.gf +
- Morphology: MorphoX.gf +
- Syntax: SyntaxX.gf +
+ +However, the languages we have studied have so much in common +that we have gathered a considerable set of categories and rules +in a multilingual resource grammar. Its parts are +
-
+
- Abstract syntax: Resource.gf +
- Language-dependent concrete syntax: ResourceX.gf for + each language. +
The code for the core resource grammars
+ +Each language has its resource code in a separate directory. +You can view the code as it is, or download it and run gfdoc +on each file. +-
+
- English: + english +
- Finnish: + Finnish +
- Shared Romance: + romance +
- French (building on Romance): + French +
- Italian (building on Romance): + italian +
- Russian: + russian +
- German: + german +
- Swedish: + swedish +
Compiling and using the resource
+ +To compile the resource into reusable operations, for all languages, type ++ make +
+in the resource/ directory. +This requires that you have a recent version of GF (>= 2.0). +What you get is a set of files with names ResourceX.gfr, +ResourceX.gfc, ParadigmsX.gfr, and ParadigmsX.gfc. +You need never consult any of these files, +but only look into the documentation. + + + +Examples of using the resource grammars
+ +A test suite
+ +The grammars TestResourceX.gf define a few expressions of each +lexical category and make it possible to test linearization, parsing, +random generation, and editing. + + +A database query language
+ +The grammars + +database/(Database | Restaurant)X.gf +make use of the resource. The RestaurantX.gf +grammars are just one possible application building on the generic +DatabaseX.gf grammars. +Notice that the +DatabaseX gramamrs are defined as instantiations of +the parametrized module DatabaseI. + + +Functional morphology
+ +Even though GF is a useful language for describing syntax and semantics, it +is not the optimal choice for morphology. +One reason is the absence of low-level +programming, such as string matching. Another reason is efficiency. +In connection with the resource grammar project, we have started another +project, +functional morphology, +which uses Haskell to implement +morphology. Haskell morphologies can then be used for generating +GF morphologies. + + +Further reading
+ +If you want to read an informal introduction to +resource grammars, see these +slides, written for a German computer science +audience. Or these +other slides, written for a Swedish +linguistic audience. + + + + +