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

The GF Resource Grammar Library Version 1.0

Author: Aarne Ranta <aarne (at) cs.chalmers.se>
-Last update: Wed Mar 8 22:35:06 2006 +Last update: Wed Mar 8 22:40:25 2006
+

+
+

+ + +

+
+

+

Plan

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

+

Purpose

+

Library for applications

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

+

Not primarily code for a parser

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

+

Grammar as language definition

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

+

Usability by non-linguists

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

+

Scientific interest

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

+

Background

+

History

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

+

Authors

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

+

Related work

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

+

Slightly less related work

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

+

Coverage

+

Languages

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

+

Morphology and lexicon

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

+

Syntactic structures

Texts: @@ -396,6 +481,7 @@ proper names, pronouns, determiners, possessives, cardinals and ordinals

+

Quantitative measures

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

+

Structure of the API

+

Language-independent ground API

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

+

The structure of a text sentence

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

 
 

+
 
The structure in the syntax editor

 

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

 
 

+
 
Language-dependent paradigm modules

 
Regular paradigms

 

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

 
 

+
 
Language-dependent syntax extensions

 

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

 
 

+
 
Special-purpose APIs

 

 Mathematical
@@ -600,7 +693,9 @@ 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
@@ -627,6 +722,7 @@ files again. Just do some of
 

 
 

+
 
Parsing

 

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

 
 

+
 
Treebank generation

 

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

 
 

+
 
The multilingual treebank format

 

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

 
 

+
 
Treebank-based parsing

 

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

 
 

+
 
Morphology

 

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

 
 

+
 
Syntax editing

 

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

 
 

+
 
Efficient parsing via application grammar

 

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

 
 

+
 
How to use as library

+
 
Specialization through parametrized modules

 

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

 
 

+
 
Compile-time transfer

 

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

 
 

+
 
A natural division into modules

 

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

 
 

+
 
Example-based grammar writing

 

 Example: animal
@@ -849,10 +956,12 @@ 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
@@ -866,6 +975,7 @@ Examples: English, Finnish, German, Russian
 

 
 

+
 
Parametrized modules

 

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

 
 

+
 
The core API

 

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

 
 

+
 
The core API in Latin: parameters

 

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

 
 

+
 
The core API in Latin: linearization types

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

 
 

+
 
The core API in Latin: predication and complementization

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

 
 

+
 
The core API in Latin: determination and modification

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

 
 

+
 
How to proceed

 
    
 
  1. put up a directory with dummy modules by copying from e.g. English and
@@ -1043,6 +1159,7 @@ commenting out the contents
 
    
 
 
    
+
 
    How to extend the API
    
 
    
 Extend old modules or add a new one?
@@ -1057,5 +1174,5 @@ you can work directly in that module.
 
    
 
 
-
+