diff --git a/lib/resource-1.0/doc/clt2006.html b/lib/resource-1.0/doc/clt2006.html index 5dac77644..6fdc5ab19 100644 --- a/lib/resource-1.0/doc/clt2006.html +++ b/lib/resource-1.0/doc/clt2006.html @@ -7,82 +7,12 @@

The GF Resource Grammar Library Version 1.0

Author: Aarne Ranta <aarne (at) cs.chalmers.se>
-Last update: Wed Mar 8 22:40:25 2006 +Last update: Sat Jan 13 17:48:13 2007
-

-
-

- - -

-
-

-

Plan

Purpose @@ -108,9 +38,7 @@ How to extend the API

-

Purpose

-

Library for applications

High-level access to grammatical rules @@ -135,7 +63,6 @@ Usability for different purposes

-

Not primarily code for a parser

Often in NLP, a grammar is just high-level code for a parser. @@ -162,7 +89,6 @@ Moreover, a grammar fine-tuned for parsing may not be reusable

-

Grammar as language definition

Linguistic ontology: abstract syntax @@ -198,7 +124,6 @@ Resource grammars have generation perspective, rather than parsing

-

Usability by non-linguists

Division of labour: resource grammars hide linguistic details @@ -240,7 +165,6 @@ Example-based grammar writing

-

Scientific interest

Linguistics @@ -267,9 +191,7 @@ Computer science

-

Background

-

History

2002: v. 0.2 @@ -308,7 +230,6 @@ Computer science

-

Authors

Janna Khegai (Russian modules, forthcoming), @@ -338,7 +259,6 @@ Jordi Saludes.

-

Related work

CLE (Core Language Engine, @@ -355,7 +275,6 @@ CLE (Core Language Engine,

-

Slightly less related work

LinGO Grammar Matrix @@ -388,9 +307,7 @@ Rosetta Machine Translation (B

-

Coverage

-

Languages

The current GF Resource Project covers ten languages: @@ -417,7 +334,6 @@ API 1.0 not yet implemented for Danish and Russian

-

Morphology and lexicon

Complete inflection engine @@ -448,7 +364,6 @@ provide a huge lexicon.

-

Syntactic structures

Texts: @@ -479,9 +394,12 @@ Noun phrases: proper names, pronouns, determiners, possessives, cardinals and ordinals

+Coordination: +lists of sentences, noun phrases, adverbs, adjectival phrases +

+

-

Quantitative measures

67 categories @@ -515,9 +433,7 @@ proper names, pronouns, determiners, possessives, cardinals and ordinals

-

Structure of the API

-

Language-independent ground API

@@ -525,7 +441,6 @@ proper names, pronouns, determiners, possessives, cardinals and ordinals

-

The structure of a text sentence

   John walks.
@@ -550,7 +465,6 @@ proper names, pronouns, determiners, possessives, cardinals and ordinals
 

 
 

-
 
The structure in the syntax editor

 

 
@@ -558,7 +472,6 @@ proper names, pronouns, determiners, possessives, cardinals and ordinals
 

 
 

-
 
Language-dependent paradigm modules

 
Regular paradigms

 

@@ -650,7 +563,6 @@ Goal: eliminate the user's need of worst-case functions.
 

 
 

-
 
Language-dependent syntax extensions

 

 Syntactic structures that are not shared by all languages.
@@ -673,7 +585,6 @@ Candidates:
 

 
 

-
 
Special-purpose APIs

 

 Mathematical
@@ -693,9 +604,7 @@ Shallow
 

 
 

-
 
How to use the resource as top-level grammar

-
 
Compiling

 

 It is a good idea to compile the library, so that it can be opened faster
@@ -722,7 +631,6 @@ files again. Just do some of
 

 
 

-
 
Parsing

 

 The default parser does not work! (It is obsolete anyway.)
@@ -753,7 +661,6 @@ Remedies:
 

 
 

-
 
Treebank generation

 

 Multilingual treebank entry = tree + linearizations
@@ -782,7 +689,6 @@ Updating a treebank
 

 
 

-
 
The multilingual treebank format

 

 Tree + linearizations
@@ -805,7 +711,6 @@ These can also be wrapped in XML tags (tb -xml)
 

 
 

-
 
Treebank-based parsing

 

 Brute-force method that helps if real parsing is more expensive.
@@ -827,7 +732,6 @@ Brute-force method that helps if real parsing is more expensive.
 

 
 

-
 
Morphology

 

 Use morphological analyser
@@ -855,7 +759,6 @@ Try out inflection patterns
 

 
 

-
 
Syntax editing

 

 The simplest way to start editing with all grammars is
@@ -871,7 +774,6 @@ parts of an application grammar remain to be implemented.
 

 
 

-
 
Efficient parsing via application grammar

 

 Get rid of discontinuous constituents (in particular, VP)
@@ -888,9 +790,7 @@ instead of PredVP np (ComplV2 v2 np')
 

 
 

-
 
How to use as library

-
 
Specialization through parametrized modules

 

 The application grammar is implemented with reference to
@@ -905,7 +805,6 @@ Example: tram
 

 
 

-
 
Compile-time transfer

 

 Instead of parametrized modules:
@@ -919,7 +818,6 @@ Example: imperative vs. infinitive in mathematical exercises
 

 
 

-
 
A natural division into modules

 

 Lexicon in language-dependent moduls
@@ -930,7 +828,6 @@ Combination rules in a parametrized module
 

 
 

-
 
Example-based grammar writing

 

 Example: animal
@@ -956,12 +853,10 @@ Example: animal
 

 
 

-
 
How to implement a new language

 

 See Resource-HOWTO
 

-
 
Ordinary modules

 

 Write a concrete syntax module for each abstract module in the API
@@ -975,7 +870,6 @@ Examples: English, Finnish, German, Russian
 

 
 

-
 
Parametrized modules

 

 Examples: Romance (French, Italian, Spanish), Scandinavian (Danish, Norwegian, Swedish)
@@ -1008,7 +902,6 @@ Problems:
 

 
 

-
 
The core API

 

 Everything else is variations of this
@@ -1033,7 +926,6 @@ Everything else is variations of this
 

 
 

-
 
The core API in Latin: parameters

 

 This toy Latin grammar shows in a nutshell how the core
@@ -1054,7 +946,6 @@ can be implemented.
 

 
 

-
 
The core API in Latin: linearization types

 
   lincat
@@ -1090,7 +981,6 @@ can be implemented.
 

 
 

-
 
The core API in Latin: predication and complementization

 
   lin
@@ -1115,7 +1005,6 @@ can be implemented.
 

 
 

-
 
The core API in Latin: determination and modification

 
     DetCN det cn = 
@@ -1139,7 +1028,6 @@ can be implemented.
 

 
 

-
 
How to proceed

 
    
 
  1. put up a directory with dummy modules by copying from e.g. English and
@@ -1159,7 +1047,6 @@ commenting out the contents
 
    
 
 
    
-
 
    How to extend the API
    
 
    
 Extend old modules or add a new one?
@@ -1173,6 +1060,6 @@ Exception: if you are working with a language-specific API extension,
 you can work directly in that module.
 
    
 
-
-
+
+
 
diff --git a/lib/resource-1.0/french/MorphoFre.gf b/lib/resource-1.0/french/MorphoFre.gf
index 2af5be809..21bab3d35 100644
--- a/lib/resource-1.0/french/MorphoFre.gf
+++ b/lib/resource-1.0/french/MorphoFre.gf
@@ -480,6 +480,7 @@ oper
             "yer" => conj1payer parler ;
             _ => case Predef.dp 2 parler of {
               "ir" => conj2finir parler ;
+              "re" => conj3rendre parler ;
               _ => conj1aimer parler
               }
             }
diff --git a/lib/resource-1.0/french/StructuralFre.gf b/lib/resource-1.0/french/StructuralFre.gf
index 36fa05883..170653a01 100644
--- a/lib/resource-1.0/french/StructuralFre.gf
+++ b/lib/resource-1.0/french/StructuralFre.gf
@@ -101,7 +101,9 @@ lin
     Masc Pl P3 ;
   this_Quant = {s = \\_ => 
     table {
-      Sg => \\g,c => prepCase c ++ genForms "ce" "cette" ! g ;  ---- cet ; ci
+      Sg => \\g,c => 
+        prepCase c ++ 
+        genForms (pre {"ce" ; "cet" / voyelle}) "cette" ! g ;  --- ci
       Pl => \\_,_ => "ces"
       }
     } ;