diff --git a/lib/resource-1.0/doc/clt2006.html b/lib/resource-1.0/doc/clt2006.html index 59ba11e8b..af1615f10 100644 --- a/lib/resource-1.0/doc/clt2006.html +++ b/lib/resource-1.0/doc/clt2006.html @@ -7,7 +7,7 @@

The GF Resource Grammar Library Version 1.0

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

@@ -105,11 +105,11 @@ Rendering in different languages: concrete syntax 

     AdjCN (PositA even_A) (UseN number_N)
   
-    even number, even sums
+    even number, even numbers
   
-    jämnt tal, jämna summor
+    jämnt tal, jämna tal
   
-    nombre pair, sommes paires
+    nombre pair, nombres pairs

Abstract away from inflection, agreement, word order. @@ -237,6 +237,7 @@ Bjorn Bringert (many Swadesh lexica), Inger Andersson and Therese Söderberg (Spanish morphology), Ludmilla Bogavac (Russian morphology), Carlos Gonzalia (Spanish cardinals), +Harald Hammarström (German morphology), Partik Jansson (Swedish cardinals), Aarne Ranta.

@@ -517,7 +518,7 @@ Regular verbs are actually implemented the Lexin way 

-    regV : (talar : Str) -> N
+    regV : (talar : Str) -> V

@@ -684,6 +685,28 @@ Updating a treebank

+

The multilingual treebank format

+

+Tree + linearizations +

+
+    > gr -cat=Cl | tb
+    PredVP (UsePron they_Pron) (PassV2 seek_V2)
+    They are sought
+    Elles sont cherchées
+    Son buscadas
+    Vengono cercate
+    De blir sökta
+    De blir lette
+    Sie werden gesucht
+    Heidät etsitään
+
+

+These can also be wrapped in XML tags (tb -xml) +

+

+ +

Treebank-based parsing

Brute-force method that helps if real parsing is more expensive. @@ -734,24 +757,31 @@ Try out inflection patterns

Syntax editing

-We start a demo by +The simplest way to start editing with all grammars is 

-  gfeditor langs.gfcm
+    gfeditor langs.gfcm
-

- +The forthcoming IDE will extend the syntax editor with +a Paradigms file browser and a control on what +parts of an application grammar remain to be implemented.

Efficient parsing via application grammar

-Get rid of discontinuous constituents +Get rid of discontinuous constituents (in particular, VP)

-Examples: mathematical/Predication, examples/bronzeage +Example: mathematical/Predication: +

+
+    predV2 : V2 -> NP -> NP -> Cl
+
+

+instead of PredVP np (ComplV2 v2 np')

@@ -798,6 +828,24 @@ Combination rules in a parametrized module

Example: animal

+
+  --# -resource=present/LangEng.gf
+  --# -path=.:present:prelude
+  
+  -- to compile: gf -examples QuestionsI.gfe
+  
+  incomplete concrete QuestionsI of Questions = open Lang in {
+    lincat
+      Phrase = Phr ;
+      Entity = N ;
+      Action = V2 ;
+    lin 
+      Who  love_V2 man_N           = in Phr "who loves men" ;
+      Whom man_N love_V2           = in Phr "whom does the man love" ;
+      Answer woman_N love_V2 man_N = in Phr "the woman loves men" ;
+  }
+
+

@@ -1008,6 +1056,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/doc/clt2006.txt b/lib/resource-1.0/doc/clt2006.txt index 8677dacbf..f8e5f9037 100644 --- a/lib/resource-1.0/doc/clt2006.txt +++ b/lib/resource-1.0/doc/clt2006.txt @@ -84,11 +84,11 @@ Rendering in different languages: **concrete syntax** ``` AdjCN (PositA even_A) (UseN number_N) - even number, even sums + even number, even numbers - jämnt tal, jämna summor + jämnt tal, jämna tal - nombre pair, sommes paires + nombre pair, nombres pairs ``` Abstract away from inflection, agreement, word order. @@ -183,6 +183,7 @@ Bjorn Bringert (many Swadesh lexica), Inger Andersson and Therese Söderberg (Spanish morphology), Ludmilla Bogavac (Russian morphology), Carlos Gonzalia (Spanish cardinals), +Harald Hammarström (German morphology), Partik Jansson (Swedish cardinals), Aarne Ranta. @@ -426,7 +427,7 @@ There are also special constructs taking other forms: Regular verbs are actually implemented the [Lexin http://lexin.nada.kth.se/sve-sve.shtml] way ``` - regV : (talar : Str) -> N + regV : (talar : Str) -> V ``` @@ -562,6 +563,24 @@ Updating a treebank rf old.xml | tb -trees | tb -xml | wf new.xml -- read old from file, write new to file ``` +#NEW + +===The multilingual treebank format=== + +Tree + linearizations +``` + > gr -cat=Cl | tb + PredVP (UsePron they_Pron) (PassV2 seek_V2) + They are sought + Elles sont cherchées + Son buscadas + Vengono cercate + De blir sökta + De blir lette + Sie werden gesucht + Heidät etsitään +``` +These can also be wrapped in XML tags (``tb -xml``) #NEW @@ -611,19 +630,26 @@ Try out inflection patterns ===Syntax editing=== -We start a demo by -``` gfeditor langs.gfcm - -[editor.png] +The simplest way to start editing with all grammars is +``` + gfeditor langs.gfcm +``` +The forthcoming IDE will extend the syntax editor with +a ``Paradigms`` file browser and a control on what +parts of an application grammar remain to be implemented. #NEW ===Efficient parsing via application grammar=== -Get rid of discontinuous constituents +Get rid of discontinuous constituents (in particular, ``VP``) -Examples: ``mathematical/Predication``, ``examples/bronzeage`` +Example: [``mathematical/Predication`` gfdoc/Predication.html]: +``` + predV2 : V2 -> NP -> NP -> Cl +``` +instead of ``PredVP np (ComplV2 v2 np')`` #NEW @@ -664,6 +690,23 @@ Combination rules in a parametrized module ===Example-based grammar writing=== Example: [animal ../../../examples/animal/QuestionsI.gfe] +``` +--# -resource=present/LangEng.gf +--# -path=.:present:prelude + +-- to compile: gf -examples QuestionsI.gfe + +incomplete concrete QuestionsI of Questions = open Lang in { + lincat + Phrase = Phr ; + Entity = N ; + Action = V2 ; + lin + Who love_V2 man_N = in Phr "who loves men" ; + Whom man_N love_V2 = in Phr "whom does the man love" ; + Answer woman_N love_V2 man_N = in Phr "the woman loves men" ; +} +``` #NEW @@ -853,6 +896,3 @@ for all languages at once. 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/StructuralFre.gf b/lib/resource-1.0/french/StructuralFre.gf index fc2ffdef6..e2520d482 100644 --- a/lib/resource-1.0/french/StructuralFre.gf +++ b/lib/resource-1.0/french/StructuralFre.gf @@ -86,7 +86,7 @@ lin Pl => \\_,_ => "ces" } } ; - that_NP = mkNP ["ceci"] Masc Sg ; + that_NP = mkNP ["cela"] Masc Sg ; there7from_Adv = ss ["de là"] ; there7to_Adv = ss "là" ; --- y there_Adv = ss "là" ; diff --git a/lib/resource-1.0/romance/AdjectiveRomance.gf b/lib/resource-1.0/romance/AdjectiveRomance.gf index 32b8fb2c7..5ff9babb0 100644 --- a/lib/resource-1.0/romance/AdjectiveRomance.gf +++ b/lib/resource-1.0/romance/AdjectiveRomance.gf @@ -21,7 +21,8 @@ incomplete concrete AdjectiveRomance of Adjective = ReflA2 adj = { s = \\af => - adj.s ! Posit ! af ++ adj.c2.s ++ reflPron Sg P3 adj.c2.c ; --- agr + adj.s ! Posit ! af ++ adj.c2.s ++ + adj.c2.s ++ prepCase adj.c2.c ++ reflPron Sg P3 Nom ; --- agr isPre = False } ; diff --git a/lib/resource-1.0/romance/SentenceRomance.gf b/lib/resource-1.0/romance/SentenceRomance.gf index 3ed93c4d7..dbaeee2e5 100644 --- a/lib/resource-1.0/romance/SentenceRomance.gf +++ b/lib/resource-1.0/romance/SentenceRomance.gf @@ -19,7 +19,7 @@ incomplete concrete SentenceRomance of Sentence = SlashVVV2 np vv v2 = mkClause (np.s ! Aton Nom) np.a - (insertComplement (\\a => prepCase vv.c2.c ++ v2.s ! VInfin) (predV v2)) ** + (insertComplement (\\a => prepCase vv.c2.c ++ v2.s ! VInfin) (predV vv)) ** {c2 = v2.c2} ; AdvSlash slash adv = {