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

working on CLT sem

Browse Source
This commit is contained in:
aarne
2006-03-07 21:04:12 +00:00
parent aad2498741
commit 1710d0c995
4 changed files with 97 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
lib/compiled.tgz
View File

Binary file not shown.

58
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: Tue Mar 7 16:01:46 2006
Last update: Tue Mar 7 21:50:28 2006
</FONT></CENTER>
<P>
@@ -145,6 +145,7 @@ Linguistics
</P>
<UL>
<LI>definition of linguistic ontology
<LI>describing language on this level of abstraction
<LI>coping with different problems in different languages
<LI>sharing concrete-syntax code between languages
<LI>creating a resource for other NLP applications
@@ -207,6 +208,8 @@ Computer science
<P>
Janna Khegai (Russian modules, forthcoming),
Bjorn Bringert (many Swadesh lexica),
Inger Andersson and Therese Söderberg (Spanish morphology),
Ludmilla Bogavac (Russian morphology),
Carlos Gonzalia (Spanish cardinals),
Partik Jansson (Swedish cardinals),
Aarne Ranta.
@@ -242,6 +245,10 @@ CLE (Core Language Engine,
<LI>grammar specialization via explanation-based learning
</UL>
<P>
<!-- NEW -->
</P>
<H3>Slightly less related work</H3>
<P>
<A HREF="http://www.delph-in.net/matrix/">LinGO Grammar Matrix</A>
</P>
@@ -315,7 +322,7 @@ Basic lexicon
</P>
<UL>
<LI>100 structural words
<LI>350 content words, mainly for testing
<LI>340 content words, mainly for testing
<LI>these include the 207 <A HREF="http://en.wiktionary.org/wiki/Swadesh_List">Swadesh words</A>
</UL>
@@ -341,7 +348,7 @@ declaratives, questions, imperatives, vocatives
</P>
<P>
Tense, mood, and polarity:
present, past, future, conditional ; similtaneous, anterior ; positive, negative
present, past, future, conditional ; simultaneous, anterior ; positive, negative
</P>
<P>
Questions:
@@ -373,10 +380,10 @@ proper names, pronouns, determiners, possessives, cardinals and ordinals
100 structural words
</P>
<P>
350 content words in a test lexicon
340 content words in a test lexicon
</P>
<P>
Lines of source code (4/3/2006):
35 kLines of source code (4/3/2006):
</P>
<PRE>
abstract 1131
@@ -407,20 +414,20 @@ Lines of source code (4/3/2006):
<PRE>
John walks.
TFullStop : Phr -&gt; Text -&gt; Text
(PhrUtt : PConj -&gt; Utt -&gt; Voc -&gt; Phr
NoPConj
(UttS : S -&gt; Utt
TFullStop : Phr -&gt; Text -&gt; Text | TQuestMark, TExclMark
(PhrUtt : PConj -&gt; Utt -&gt; Voc -&gt; Phr | PhrYes, PhrNo, ...
NoPConj | but_PConj, ...
(UttS : S -&gt; Utt | UttQS, UttImp, UttNP, ...
(UseCl : Tense -&gt; Anter -&gt; Pol -&gt; Cl -&gt; S
TPres
ASimul
PPos
(PredVP : NP -&gt; VP -&gt; Cl
(PredVP : NP -&gt; VP -&gt; Cl | ImpersNP, ExistNP, ...
(UsePN : PN -&gt; NP
john_PN)
(UseV : V -&gt; VP
(UseV : V -&gt; VP | ComplV2, UseComp, ...
walk_V))))
NoVoc)
NoVoc) | VocNP, please_Voc, ...
TEmpty
</PRE>
<P></P>
@@ -519,10 +526,6 @@ Goal: eliminate the user's need of worst-case functions.
</P>
<H3>Language-dependent syntax extensions</H3>
<P>
<!-- NEW -->
</P>
<H3>Special-purpose APIs</H3>
<P>
Syntactic structures that are not shared by all languages.
</P>
<P>
@@ -539,10 +542,26 @@ Candidates:
<P>
<!-- NEW -->
</P>
<H3>How to use as top-level grammar</H3>
<H3>Special-purpose APIs</H3>
<P>
Mathematical
</P>
<P>
Multimodal
</P>
<P>
Present
</P>
<P>
Minimal
</P>
<P>
Shallow
</P>
<P>
<!-- NEW -->
</P>
<H3>How to use the resource as top-level grammar</H3>
<H3>Compiling</H3>
<P>
It is a good idea to compile the library, so that it can be opened faster
@@ -580,9 +599,6 @@ The MCFG parser works in some languages, after waiting appr. 20 seconds
p -mcfg -lang=LangEng -cat=S "I would see her"
p -mcfg -lang=LangSwe -cat=S "jag skulle se henne"
p -mcfg -lang=LangNor -cat=S "jeg ville se henne"
</PRE>
<P>
Parsing in <CODE>present/</CODE> versions is quicker.
@@ -727,6 +743,6 @@ We start a demo by
</P>
<H3>Extend old modules or add a new one?</H3>
<!-- 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>

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

@@ -114,6 +114,7 @@ Example-based grammar writing
Linguistics
- definition of linguistic ontology
- describing language on this level of abstraction
- coping with different problems in different languages
- sharing concrete-syntax code between languages
- creating a resource for other NLP applications
@@ -162,6 +163,8 @@ Computer science
Janna Khegai (Russian modules, forthcoming),
Bjorn Bringert (many Swadesh lexica),
Inger Andersson and Therese Söderberg (Spanish morphology),
Ludmilla Bogavac (Russian morphology),
Carlos Gonzalia (Spanish cardinals),
Partik Jansson (Swedish cardinals),
Aarne Ranta.
@@ -194,6 +197,10 @@ CLE (Core Language Engine,
- grammar specialization via explanation-based learning
#NEW
===Slightly less related work===
[LinGO Grammar Matrix http://www.delph-in.net/matrix/]
- English, German, Japanese, Spanish, ...
- uses HPSG, implementation in LKB
@@ -250,7 +257,7 @@ Complete inflection engine
Basic lexicon
- 100 structural words
- 350 content words, mainly for testing
- 340 content words, mainly for testing
- these include the 207 [Swadesh words http://en.wiktionary.org/wiki/Swadesh_List]
@@ -273,7 +280,7 @@ Phrases:
declaratives, questions, imperatives, vocatives
Tense, mood, and polarity:
present, past, future, conditional ; similtaneous, anterior ; positive, negative
present, past, future, conditional ; simultaneous, anterior ; positive, negative
Questions:
yes-no, "wh" ; direct, indirect
@@ -300,9 +307,9 @@ proper names, pronouns, determiners, possessives, cardinals and ordinals
100 structural words
350 content words in a test lexicon
340 content words in a test lexicon
Lines of source code (4/3/2006):
35 kLines of source code (4/3/2006):
```
abstract 1131
english 2344
@@ -334,20 +341,20 @@ Lines of source code (4/3/2006):
```
John walks.
TFullStop : Phr -> Text -> Text
(PhrUtt : PConj -> Utt -> Voc -> Phr
NoPConj
(UttS : S -> Utt
TFullStop : Phr -> Text -> Text | TQuestMark, TExclMark
(PhrUtt : PConj -> Utt -> Voc -> Phr | PhrYes, PhrNo, ...
NoPConj | but_PConj, ...
(UttS : S -> Utt | UttQS, UttImp, UttNP, ...
(UseCl : Tense -> Anter -> Pol -> Cl -> S
TPres
ASimul
PPos
(PredVP : NP -> VP -> Cl
(PredVP : NP -> VP -> Cl | ImpersNP, ExistNP, ...
(UsePN : PN -> NP
john_PN)
(UseV : V -> VP
(UseV : V -> VP | ComplV2, UseComp, ...
walk_V))))
NoVoc)
NoVoc) | VocNP, please_Voc, ...
TEmpty
```
@@ -435,10 +442,6 @@ Goal: eliminate the user's need of worst-case functions.
===Language-dependent syntax extensions===
#NEW
===Special-purpose APIs===
Syntactic structures that are not shared by all languages.
Not implemented yet.
@@ -448,12 +451,24 @@ Candidates:
- ``Fre`` question forms: ``est-ce que tu dors ?``
#NEW
===Special-purpose APIs===
Mathematical
Multimodal
Present
Minimal
Shallow
#NEW
===How to use as top-level grammar===
#NEW
===How to use the resource as top-level grammar===
===Compiling===
@@ -487,9 +502,6 @@ The MCFG parser works in some languages, after waiting appr. 20 seconds
p -mcfg -lang=LangEng -cat=S "I would see her"
p -mcfg -lang=LangSwe -cat=S "jag skulle se henne"
p -mcfg -lang=LangNor -cat=S "jeg ville se henne"
```
Parsing in ``present/`` versions is quicker.
@@ -559,8 +571,6 @@ Try out inflection patterns
```
#NEW
#NEW
@@ -576,6 +586,9 @@ We start a demo by
===Efficient parsing via application grammar===
Get rid of discontinuous constituents
Examples: ``mathematical/Predication``, ``examples/bronzeage``
#NEW
@@ -584,19 +597,38 @@ We start a demo by
===Specialization through parametrized modules===
The application grammar is implemented with reference to
the resource API
Individual languages are instantiations
Example: [tram ../../examples/tram/TramI.gfe]
#NEW
===Compile-time transfer===
Instead of parametrized modules:
select resource functions differently for different languages
Example: imperative vs. infinitive in mathematical exercises
#NEW
===A natural division into modules===
Lexicon in language-dependent moduls
Combination rules in a parametrized module
#NEW
===Example-based grammar writing===
Example: [animal ../../examples/animal/QuestionsI.gfe]
#NEW

4
lib/resource-1.0/french/LexiconFre.gf
View File

@@ -348,5 +348,9 @@ lin
wash_V2 = dirV2 (regV "laver") ;
wipe_V2 = dirV2 (regV "essuyer") ;
hold_V2 = dirV2 tenir_V2 ;
split_V2 = dirV2 fendre_V2 ;
lie_V = reflV étendre_V2 ;
sit_V = reflV asseoir_V2 ;
} ;