GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-04-09 04:59:31 -06:00
Code Issues Packages Projects Releases Wiki Activity

romance bug fix ; postfixes in clt slides

Browse Source
This commit is contained in:
aarne
2006-03-08 21:35:28 +00:00
parent 1ce8ef0ba9
commit dd1adef3ca
5 changed files with 117 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

72
lib/resource-1.0/doc/clt2006.html
View File

@@ -7,7 +7,7 @@
<P ALIGN="center"><CENTER><H1>The GF Resource Grammar Library Version 1.0</H1>
<FONT SIZE="4">
<I>Author: Aarne Ranta &lt;aarne (at) cs.chalmers.se&gt;</I><BR>
Last update: Wed Mar 8 12:04:15 2006
Last update: Wed Mar 8 22:35:06 2006
</FONT></CENTER>
<P>
@@ -105,11 +105,11 @@ Rendering in different languages: <B>concrete syntax</B>
<PRE>
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
</PRE>
<P>
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.
</P>
@@ -517,7 +518,7 @@ Regular verbs are actually implemented the
<A HREF="http://lexin.nada.kth.se/sve-sve.shtml">Lexin</A> way
</P>
<PRE>
regV : (talar : Str) -&gt; N
regV : (talar : Str) -&gt; V
</PRE>
<P></P>
<P>
@@ -684,6 +685,28 @@ Updating a treebank
<P>
<!-- NEW -->
</P>
<H3>The multilingual treebank format</H3>
<P>
Tree + linearizations
</P>
<PRE>
&gt; 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
</PRE>
<P>
These can also be wrapped in XML tags (<CODE>tb -xml</CODE>)
</P>
<P>
<!-- NEW -->
</P>
<H3>Treebank-based parsing</H3>
<P>
Brute-force method that helps if real parsing is more expensive.
@@ -734,24 +757,31 @@ Try out inflection patterns
</P>
<H3>Syntax editing</H3>
<P>
We start a demo by
The simplest way to start editing with all grammars is
</P>
<PRE>
gfeditor langs.gfcm
gfeditor langs.gfcm
</PRE>
<P></P>
<P>
<IMG ALIGN="middle" SRC="editor.png" BORDER="0" ALT="">
The forthcoming IDE will extend the syntax editor with
a <CODE>Paradigms</CODE> file browser and a control on what
parts of an application grammar remain to be implemented.
</P>
<P>
<!-- NEW -->
</P>
<H3>Efficient parsing via application grammar</H3>
<P>
Get rid of discontinuous constituents
Get rid of discontinuous constituents (in particular, <CODE>VP</CODE>)
</P>
<P>
Examples: <CODE>mathematical/Predication</CODE>, <CODE>examples/bronzeage</CODE>
Example: <A HREF="gfdoc/Predication.html"><CODE>mathematical/Predication</CODE></A>:
</P>
<PRE>
predV2 : V2 -&gt; NP -&gt; NP -&gt; Cl
</PRE>
<P>
instead of <CODE>PredVP np (ComplV2 v2 np')</CODE>
</P>
<P>
<!-- NEW -->
@@ -798,6 +828,24 @@ Combination rules in a parametrized module
<P>
Example: <A HREF="../../../examples/animal/QuestionsI.gfe">animal</A>
</P>
<PRE>
--# -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" ;
}
</PRE>
<P></P>
<P>
<!-- NEW -->
</P>
@@ -1008,6 +1056,6 @@ Exception: if you are working with a language-specific API extension,
you can work directly in that module.
</P>
<!-- html code generated by txt2tags 2.0 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags clt2006.txt -->
</BODY></HTML>

66
lib/resource-1.0/doc/clt2006.txt
View File

@@ -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.

2
lib/resource-1.0/french/StructuralFre.gf
View File

@@ -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à" ;

3
lib/resource-1.0/romance/AdjectiveRomance.gf
View File

@@ -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
} ;

2
lib/resource-1.0/romance/SentenceRomance.gf
View File

@@ -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 = {