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

updated doc

Browse Source
This commit is contained in:
aarne
2007-07-08 16:53:52 +00:00
parent c7e85d60fb
commit 09d13581d2
48 changed files with 2317 additions and 1374 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
doc/index.html
View File

@@ -90,6 +90,13 @@ parser.
<h2>Grammar library documentation</h2>
<p>
<a href="lib/resource-1.0/doc/synopsis.html">Resource Gramamr Synopsis</a>.
With APIs and use examples, for Resource v. 1.2.
<p>
<a href="resource.pdf">
GF Resource Grammar Library</a>
user's manual, for API v 1.0.
@@ -98,7 +105,7 @@ user's manual, for API v 1.0.
<a href="../lib/resource-1.0/doc/index.html">
On-line resource grammar library documentation</a>
in progress for the forthcoming API v 1.0.
in progress for API v 1.0.
<p>

37
doc/old-news.html
View File

@@ -2,7 +2,42 @@
<html>
<body>
<h1>GF News 2004-2006</h1>
<h1>GF News 2004-2007</h1>
<p>
<i>June 27, 2007</i>. GF 2.8 forthcoming next week. Some highlights:
<ul>
<li> Resource Grammar Library v 1.2: <a href="lib/resource-1.0/doc/synopsis.html">synopsis</a>.
<li> new speech formats
<li> better semantics of <tt>variants</tt>
<li> lots of bug fixes
</ul>
<p>
<i>December 22, 2006</i>. GF 2.7 released. Some highlights:
<ul>
<li> <a href="doc/gf-history.html#javascript">JavaScript</a> and
<a href="doc/gf-history.html#voicexml">VoiceXML</a>
generation. These together support the generation of
a complete dialogue system from grammar.
<li> <a href="doc/gf-history.html#overloading">Overloading</a>
and new library APIs.
<li> New low-level format, called
<a href="src/GF/Canon/GFCC/doc/gfcc.html">GFCC</a>.
<li> <a href="doc/gf-history.html#gfcc2c">C code generation</a>:
for ultimate efficiency with the GFCC format.
<li> <a href="lib/resource-1.0/doc">Resource library version 1.1</a>:
extensions and bug fixes to 1.0.
</ul>
See <a href="doc/gf-history.html">GF history</a> for more details.
Download from
<a href=
"http://sourceforge.net/project/showfiles.php?group_id=132285">SourceForge</a>.
<p>

38
index.html
View File

@@ -1,5 +1,5 @@
<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">
<html><head><title>GF Version 2.7</title></head>
<html><head><title>GF Version 2.8</title></head>
<body bgcolor="#ffffff" text="#000000">
@@ -9,9 +9,9 @@
<h1>Grammatical Framework</h1>
<h2>Version 2.7</h2>
<h2>Version 2.8</h2>
December 22, 2006.
July 8, 2007.
<p>
@@ -58,36 +58,17 @@ December 22, 2006.
<p>
<i>June 27, 2007</i>. GF 2.8 forthcoming next week. Some highlights:
<i>July 8, 2007</i>. GF 2.8 released. Some highlights:
<ul>
<li> Resource Grammar Library v 1.2: <a href="lib/resource-1.0/doc/synopsis.html">synopsis</a>.
<li> New version of <a>href=doc/tutorial/"gf-tutorial2.html">tutorial</a>,
now with exercises and also as a
<a>href=doc/tutorial/"gf-tutorial2.pdf">pdf file</a>,
<li> new speech formats
<li> better semantics of <tt>variants</tt>
<li> lots of bug fixes
</ul>
<p>
<i>December 22, 2006</i>. GF 2.7 released. Some highlights:
<ul>
<li> <a href="doc/gf-history.html#javascript">JavaScript</a> and
<a href="doc/gf-history.html#voicexml">VoiceXML</a>
generation. These together support the generation of
a complete dialogue system from grammar.
<li> <a href="doc/gf-history.html#overloading">Overloading</a>
and new library APIs.
<li> New low-level format, called
<a href="src/GF/Canon/GFCC/doc/gfcc.html">GFCC</a>.
<li> <a href="doc/gf-history.html#gfcc2c">C code generation</a>:
for ultimate efficiency with the GFCC format.
<li> <a href="lib/resource-1.0/doc">Resource library version 1.1</a>:
extensions and bug fixes to 1.0.
</ul>
See <a href="doc/gf-history.html">GF history</a> for more details.
Download from
<a href=
"http://sourceforge.net/project/showfiles.php?group_id=132285">SourceForge</a>.
<p>
@@ -146,6 +127,11 @@ is to write an EBNF grammar in a file <tt>foo.ebnf</tt> and type
GF is open-source software licensed under
<a href="LICENSE">GNU General Public License (GPL)</a>.
<p>
The <a href="lib>"GF Grammar Libraries</a> are licensed under
<a href="lib/resource-1.0/LICENSE">GNU Lesser General Public License (LGPL)</a>.
<h2>Examples and demos</h2>

165
lib/LICENSE Normal file
View File

@@ -0,0 +1,165 @@
GNU LESSER GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
This version of the GNU Lesser General Public License incorporates
the terms and conditions of version 3 of the GNU General Public
License, supplemented by the additional permissions listed below.
0. Additional Definitions.
As used herein, "this License" refers to version 3 of the GNU Lesser
General Public License, and the "GNU GPL" refers to version 3 of the GNU
General Public License.
"The Library" refers to a covered work governed by this License,
other than an Application or a Combined Work as defined below.
An "Application" is any work that makes use of an interface provided
by the Library, but which is not otherwise based on the Library.
Defining a subclass of a class defined by the Library is deemed a mode
of using an interface provided by the Library.
A "Combined Work" is a work produced by combining or linking an
Application with the Library. The particular version of the Library
with which the Combined Work was made is also called the "Linked
Version".
The "Minimal Corresponding Source" for a Combined Work means the
Corresponding Source for the Combined Work, excluding any source code
for portions of the Combined Work that, considered in isolation, are
based on the Application, and not on the Linked Version.
The "Corresponding Application Code" for a Combined Work means the
object code and/or source code for the Application, including any data
and utility programs needed for reproducing the Combined Work from the
Application, but excluding the System Libraries of the Combined Work.
1. Exception to Section 3 of the GNU GPL.
You may convey a covered work under sections 3 and 4 of this License
without being bound by section 3 of the GNU GPL.
2. Conveying Modified Versions.
If you modify a copy of the Library, and, in your modifications, a
facility refers to a function or data to be supplied by an Application
that uses the facility (other than as an argument passed when the
facility is invoked), then you may convey a copy of the modified
version:
a) under this License, provided that you make a good faith effort to
ensure that, in the event an Application does not supply the
function or data, the facility still operates, and performs
whatever part of its purpose remains meaningful, or
b) under the GNU GPL, with none of the additional permissions of
this License applicable to that copy.
3. Object Code Incorporating Material from Library Header Files.
The object code form of an Application may incorporate material from
a header file that is part of the Library. You may convey such object
code under terms of your choice, provided that, if the incorporated
material is not limited to numerical parameters, data structure
layouts and accessors, or small macros, inline functions and templates
(ten or fewer lines in length), you do both of the following:
a) Give prominent notice with each copy of the object code that the
Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the object code with a copy of the GNU GPL and this license
document.
4. Combined Works.
You may convey a Combined Work under terms of your choice that,
taken together, effectively do not restrict modification of the
portions of the Library contained in the Combined Work and reverse
engineering for debugging such modifications, if you also do each of
the following:
a) Give prominent notice with each copy of the Combined Work that
the Library is used in it and that the Library and its use are
covered by this License.
b) Accompany the Combined Work with a copy of the GNU GPL and this license
document.
c) For a Combined Work that displays copyright notices during
execution, include the copyright notice for the Library among
these notices, as well as a reference directing the user to the
copies of the GNU GPL and this license document.
d) Do one of the following:
0) Convey the Minimal Corresponding Source under the terms of this
License, and the Corresponding Application Code in a form
suitable for, and under terms that permit, the user to
recombine or relink the Application with a modified version of
the Linked Version to produce a modified Combined Work, in the
manner specified by section 6 of the GNU GPL for conveying
Corresponding Source.
1) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (a) uses at run time
a copy of the Library already present on the user's computer
system, and (b) will operate properly with a modified version
of the Library that is interface-compatible with the Linked
Version.
e) Provide Installation Information, but only if you would otherwise
be required to provide such information under section 6 of the
GNU GPL, and only to the extent that such information is
necessary to install and execute a modified version of the
Combined Work produced by recombining or relinking the
Application with a modified version of the Linked Version. (If
you use option 4d0, the Installation Information must accompany
the Minimal Corresponding Source and Corresponding Application
Code. If you use option 4d1, you must provide the Installation
Information in the manner specified by section 6 of the GNU GPL
for conveying Corresponding Source.)
5. Combined Libraries.
You may place library facilities that are a work based on the
Library side by side in a single library together with other library
facilities that are not Applications and are not covered by this
License, and convey such a combined library under terms of your
choice, if you do both of the following:
a) Accompany the combined library with a copy of the same work based
on the Library, uncombined with any other library facilities,
conveyed under the terms of this License.
b) Give prominent notice with the combined library that part of it
is a work based on the Library, and explaining where to find the
accompanying uncombined form of the same work.
6. Revised Versions of the GNU Lesser General Public License.
The Free Software Foundation may publish revised and/or new versions
of the GNU Lesser General Public License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the
Library as you received it specifies that a certain numbered version
of the GNU Lesser General Public License "or any later version"
applies to it, you have the option of following the terms and
conditions either of that published version or of any later version
published by the Free Software Foundation. If the Library as you
received it does not specify a version number of the GNU Lesser
General Public License, you may choose any version of the GNU Lesser
General Public License ever published by the Free Software Foundation.
If the Library as you received it specifies that a proxy can decide
whether future versions of the GNU Lesser General Public License shall
apply, that proxy's public statement of acceptance of any version is
permanent authorization for you to choose that version for the
Library.

9
lib/index.txt
View File

@@ -24,10 +24,10 @@ give some introduction to this idea.
This library covers basic linguistic structures of
different languages.
[Version 1.1 resource-1.0/doc] released 22 December 2006
[Version 1.2 resource-1.0/doc] released 22 December 2006
(enhanced version of 1.0).
Covers Danish, English, Finnish, French, German, Italian, Norwegian,
Russian, Spanish, and Swedish.
Russian, Spanish, and Swedish, and to a smaller extent Arabic and Catalan.
Two older versions are also available:
[Version 0.9 resource/]
@@ -51,3 +51,8 @@ of predefined (hard-coded) functions.
for strings, tables, records, booleans.
==License==
All libraries in this directory and its subdirectories are
releaced under GNU Lesser General Public License (LGPL). See the file
[LICENSE ./LICENSE] for more details.

8
lib/resource-1.0/doc/gfdoc/Adjective.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Adjective: Adjectives and Adjectival Phrases</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2007-05-31 14:17:17 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -33,8 +33,8 @@ elliptic-relational.
(The superlative use is covered in <A HREF="Noun.html">Noun</A>.<CODE>SuperlA</CODE>.)
</P>
<PRE>
PositA : A -&gt; AP ; -- warm
ComparA : A -&gt; NP -&gt; AP ; -- warmer than Spain
PositA : A -&gt; AP ; -- warm
ComparA : A -&gt; NP -&gt; AP ; -- warmer than Spain
ComplA2 : A2 -&gt; NP -&gt; AP ; -- divisible by 2
ReflA2 : A2 -&gt; AP ; -- divisible by itself
UseA2 : A2 -&gt; A ; -- divisible
@@ -64,6 +64,6 @@ by <A HREF="Adverb.html">Adverb</A>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Adjective.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Adverb.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Adverb: Adverbs and Adverbial Phrases</H1>
<FONT SIZE="4">
<I>Last update: 2006-06-16 07:46:47 CEST</I><BR>
<I>Last update: 2006-06-15 09:19:39 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -69,6 +69,6 @@ Comparison adverbs also work as numeral adverbs.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Adverb.txt -->
</BODY></HTML>

24
lib/resource-1.0/doc/gfdoc/Cat.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Cat: the Category System</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2007-07-06 11:21:49 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -129,16 +129,16 @@ The determiner structure is
as defined in <A HREF="Noun.html">Noun</A>.
</P>
<PRE>
CN ; -- common noun (without determiner) e.g. "red house"
NP ; -- noun phrase (subject or object) e.g. "the red house"
Pron ; -- personal pronoun e.g. "she"
Det ; -- determiner phrase e.g. "those seven"
Predet; -- predeterminer (prefixed Quant) e.g. "all"
QuantSg;-- quantifier ('nucleus' of sing. Det) e.g. "every"
QuantPl;-- quantifier ('nucleus' of plur. Det) e.g. "many"
Quant ; -- quantifier with both sg and pl e.g. "this/these"
Num ; -- cardinal number (used with QuantPl) e.g. "seven"
Ord ; -- ordinal number (used in Det) e.g. "seventh"
CN ; -- common noun (without determiner) e.g. "red house"
NP ; -- noun phrase (subject or object) e.g. "the red house"
Pron ; -- personal pronoun e.g. "she"
Det ; -- determiner phrase e.g. "those seven"
Predet ; -- predeterminer (prefixed Quant) e.g. "all"
QuantSg ;-- quantifier ('nucleus' of sing. Det) e.g. "every"
QuantPl ;-- quantifier ('nucleus' of plur. Det) e.g. "many"
Quant ; -- quantifier with both sg and pl e.g. "this/these"
Num ; -- cardinal number (used with QuantPl) e.g. "seven"
Ord ; -- ordinal number (used in Det) e.g. "seventh"
</PRE>
<P></P>
<A NAME="toc7"></A>
@@ -190,6 +190,6 @@ additional lexicon modules.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Cat.txt -->
</BODY></HTML>

30
lib/resource-1.0/doc/gfdoc/Combinators.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Combinators: a High-Level Syntax API</H1>
<FONT SIZE="4">
<I>Last update: 2007-05-06 21:39:21 CEST</I><BR>
<I>Last update: 2007-05-31 11:49:38 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -45,19 +45,19 @@ to construct arguments of these functions.
<H2>Predication</H2>
<PRE>
pred : overload {
pred : V -&gt; NP -&gt; Cl ;
pred : V2 -&gt; NP -&gt; NP -&gt; Cl ;
pred : V3 -&gt; NP -&gt; NP -&gt; NP -&gt; Cl ;
pred : V -&gt; NP -&gt; NP -&gt; Cl ;
pred : A -&gt; NP -&gt; Cl ;
pred : A2 -&gt; NP -&gt; NP -&gt; Cl ;
pred : A -&gt; NP -&gt; NP -&gt; Cl ;
pred : N -&gt; NP -&gt; Cl ;
pred : CN -&gt; NP -&gt; Cl ;
pred : NP -&gt; NP -&gt; Cl ;
pred : N -&gt; NP -&gt; NP -&gt; Cl ;
pred : Adv -&gt; NP -&gt; Cl ;
pred : Prep -&gt; NP -&gt; NP -&gt; Cl
pred : V -&gt; NP -&gt; Cl ; -- x converges
pred : V2 -&gt; NP -&gt; NP -&gt; Cl ; -- x intersects y
pred : V3 -&gt; NP -&gt; NP -&gt; NP -&gt; Cl ; -- x intersects y at z
pred : V -&gt; NP -&gt; NP -&gt; Cl ; -- x and y intersect
pred : A -&gt; NP -&gt; Cl ; -- x is even
pred : A2 -&gt; NP -&gt; NP -&gt; Cl ; -- x is divisible by y
pred : A -&gt; NP -&gt; NP -&gt; Cl ; -- x and y are equal
pred : N -&gt; NP -&gt; Cl ; -- x is a maximum
pred : CN -&gt; NP -&gt; Cl ; -- x is a local maximum
pred : NP -&gt; NP -&gt; Cl ; -- x is the neutral element
pred : N -&gt; NP -&gt; NP -&gt; Cl ; -- x and y are inverses
pred : Adv -&gt; NP -&gt; Cl ; -- x is in scope
pred : Prep -&gt; NP -&gt; NP -&gt; Cl -- x is outside y
} ;
</PRE>
<P></P>
@@ -135,6 +135,6 @@ This is not in ground API, because it would destroy parsing.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc api/Combinators.txt -->
</BODY></HTML>

10
lib/resource-1.0/doc/gfdoc/Common.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Common: Structures with Common Implementations.</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2007-07-04 11:06:11 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -86,9 +86,9 @@ Many adverbs are constructed in <A HREF="Structural.html"><CODE>Structural</CODE
<A NAME="toc3"></A>
<H2>Tense, polarity, and anteriority</H2>
<PRE>
Tense ; -- tense: present, past, future, conditional
Pol ; -- polarity: positive, negative
Ant ; -- anteriority: simultaneous, anterior
Tense ; -- tense e.g. present, past, future
Pol ; -- polarity e.g. positive, negative
Ant ; -- anteriority e.g. simultaneous, anterior
fun
PPos, PNeg : Pol ; -- I sleep/don't sleep
@@ -102,6 +102,6 @@ Many adverbs are constructed in <A HREF="Structural.html"><CODE>Structural</CODE
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Common.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Conjunction.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Conjunction: Coordination</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2006-06-26 13:24:17 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -86,6 +86,6 @@ not given explicitly. But here are their type signatures:
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Conjunction.txt -->
</BODY></HTML>

1446
lib/resource-1.0/doc/gfdoc/Constructors.html
View File

File diff suppressed because it is too large Load Diff

7
lib/resource-1.0/doc/gfdoc/Grammar.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Grammar: the Main Module of the Resource Grammar</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2007-06-20 08:34:45 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -39,11 +39,10 @@ a lexicon.
Phrase,
Text,
Structural,
Idiom
** {} ;
Idiom ;
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Grammar.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Idiom.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Idiom: Idiomatic Expressions</H1>
<FONT SIZE="4">
<I>Last update: 2006-06-16 07:46:47 CEST</I><BR>
<I>Last update: 2006-06-15 09:19:39 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -47,6 +47,6 @@ often different even in closely related languages.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Idiom.txt -->
</BODY></HTML>

8
lib/resource-1.0/doc/gfdoc/IrregEng.gf
View File

@@ -37,7 +37,7 @@ flags optimize=values ;
deal_V = irregV "deal" "dealt" "dealt" ;
dig_V = irregDuplV "dig" "dug" "dug" ;
dive_V = irregV "dive" (variants {"dived" ; "dove"}) "dived" ;
do_V = mkV "do" "does" "did" "done" "doing" ;
do_V = mk5V "do" "does" "did" "done" "doing" ;
draw_V = irregV "draw" "drew" "drawn" ;
dream_V = irregV "dream" (variants {"dreamed" ; "dreamt"}) (variants {"dreamed" ; "dreamt"}) ;
drive_V = irregV "drive" "drove" "driven" ;
@@ -59,11 +59,11 @@ flags optimize=values ;
freeze_V = irregV "freeze" "froze" "frozen" ;
get_V = irregDuplV "get" "got" "gotten" ;
give_V = irregV "give" "gave" "given" ;
go_V = mkV "go" "goes" "went" "gone" "going" ;
go_V = mk5V "go" "goes" "went" "gone" "going" ;
grind_V = irregV "grind" "ground" "ground" ;
grow_V = irregV "grow" "grew" "grown" ;
hang_V = irregV "hang" "hung" "hung" ;
have_V = mkV "have" "has" "had" "had" "having" ;
have_V = mk5V "have" "has" "had" "had" "having" ;
hear_V = irregV "hear" "heard" "heard" ;
hide_V = irregV "hide" "hid" "hidden" ;
hit_V = irregDuplV "hit" "hit" "hit" ;
@@ -90,7 +90,7 @@ flags optimize=values ;
mistake_V = irregV "mistake" "mistook" "mistaken" ;
mow_V = irregV "mow" "mowed" (variants {"mowed" ; "mown"}) ;
overcome_V = irregV "overcome" "overcame" "overcome" ;
overdo_V = mkV "overdo" "overdoes" "overdid" "overdone" "overdoing" ;
overdo_V = mk5V "overdo" "overdoes" "overdid" "overdone" "overdoing" ;
overtake_V = irregV "overtake" "overtook" "overtaken" ;
overthrow_V = irregV "overthrow" "overthrew" "overthrown" ;
pay_V = irregV "pay" "paid" "paid" ;

36
lib/resource-1.0/doc/gfdoc/IrregGer.gf
View File

@@ -31,7 +31,11 @@ in {
lin dingen_V = irregV "dingen" "dingt" "dingte" "dang" "gedungen" ;
lin dreschen_V = irregV "dreschen" "drischt" "drosch" "drösche" "gedroschen" ;
lin dringen_V = irregV "dringen" "dringt" "drang" "dränge" "gedrungen" ;
lin dürfen_V = irregV "dürfen" "darf" "durfte" "dürfte" "gedurft" ;
lin dürfen_V = M.mkV
"dürfen" "darf" "darfst" "darf" "dürft" "dürf"
"durfte" "durftest" "durften" "durftet"
"dürfte" "gedurft" []
M.VHaben ** {lock_V = <>} ;
lin empfehlen_V = irregV "empfehlen" "empfiehlt" "empfahl"
(variants {"empföhle" ; "empfähle"}) "empfohlen" ;
lin erlöschen_V = irregV "erlöschen" "erlischt" "erlosch" "erlösche" "erloschen" ;
@@ -78,7 +82,11 @@ in {
lin klingen_V = irregV "klingen" "klingt" "klang" "klänge" "geklungen" ;
lin kneifen_V = irregV "kneifen" "kneift" "kniff" "kniffe" "gekniffen" ;
lin kommen_V = irregV "kommen" "kommt" "kam" "käme" "gekommen" ;
lin können_V = irregV "können" "kann" "konnte" "könnte" "gekonnt" ;
lin können_V = M.mkV
"können" "kann" "kannst" "kann" "könnt" "könn"
"konnte" "konntest" "konnten" "konntet"
"könnte" "gekonnt" []
M.VHaben ** {lock_V = <>} ;
lin kriechen_V = irregV "kriechen" "kriecht" "kroch" "kröche" "gekrochen" ;
lin küren_V = irregV "küren" "kürt" "kürte" "kor" "gekürt" ;
lin laden_V = irregV "laden" "lädt" "lud" "lüde" "geladen" ;
@@ -99,9 +107,12 @@ in {
"mochte" "mochtest" "mochten" "mochtet"
"möchte" "gemocht" []
M.VHaben ** {lock_V = <>} ;
lin müssen_V = irregV "müssen" "muß" "mußte" "müßte" "gemußt" ;
lin nehmen_V = mkV "nehmen" "nimmt" "nimm" "nahm" "nähme" "genommen" ;
lin müssen_V = M.mkV
"müssen" "muß" "mußt" "muß" "müßt" "müß"
"mußte" "mußtest" "mußten" "mußtet"
"müßte" "gemußt" []
M.VHaben ** {lock_V = <>} ;
lin nehmen_V = mk6V "nehmen" "nimmt" "nimm" "nahm" "nähme" "genommen" ;
lin nennen_V = irregV "nennen" "nennt" "nannte" "nennte" "genannt" ;
lin pfeifen_V = irregV "pfeifen" "pfeift" "pfiff" "pfiffe" "gepfiffen" ;
lin preisen_V = irregV "preisen" "preist" "pries" "priese" "gepriesen" ;
@@ -154,7 +165,12 @@ in {
lin sinken_V = irregV "sinken" "sinkt" "sank" "sänke" "gesunken" ;
lin sinnen_V = irregV "sinnen" "sinnt" "sann" "sänne" "gesonnen" ;
lin sitzen_V = irregV "sitzen" "sitzt" "saß" "säße" "gesessen" ;
lin sollen_V = irregV "sollen" "sollt" "sollte" "sollte" "gesollt" ;
lin sollen_V = M.mkV
"sollen" "soll" "sollst" "soll" "sollt" "soll"
"sollte" "solltest" "sollten" "solltet"
"sollte" "gesollt" []
M.VHaben ** {lock_V = <>} ;
lin speien_V = irregV "speien" "speit" "spie" "spie" "gespien" ;
lin spinnen_V = irregV "spinnen" "spinnt" "spann" (variants {"spönne" ; "spänne"}) "gesponnen" ;
lin spleißen_V = irregV "spleißen" "spleißt" "spliß" "spliße" "gesplissen" ;
@@ -188,7 +204,11 @@ in {
lin weisen_V = irregV "weisen" "weist" "wies" "wiese" "gewiesen" ;
lin wenden_V = irregV "wenden" "wendt" (variants {"wandte" ; "wendete"}) (variants {"wandte" ; "wendete"}) (variants {"gewandt" ; "gewendet"}) ;
lin werben_V = irregV "werben" "wirbt" "warb" "würbe" "geworben" ;
lin werden_V = irregV "werden" "wird" (variants {"wurde" ; "ward"}) "würde" "geworden" ;
lin werden_V = M.mkV
"werden" "werde" "wirst" "wird" "werdet" "werd"
"wurde" "wurdest" "wurden" "wurdet"
"würde" "geworden" []
M.VHaben ** {lock_V = <>} ;
lin werfen_V = irregV "werfen" "wirft" "warf" "würfe" "geworfen" ;
lin wiegen_V = irregV "wiegen" "wiegt" "wog" "wöge" "gewogen" ;
lin winden_V = irregV "winden" "windt" "wand" "wände" "gewunden" ;
@@ -196,7 +216,7 @@ in {
lin wollen_V = M.mkV
"wollen" "will" "willst" "will" "wollt" "woll"
"wollte" "wolltest" "wollten" "wolltet"
"wollte" "gewollen" []
"wollte" "gewollt" []
M.VHaben ** {lock_V = <>} ;

2
lib/resource-1.0/doc/gfdoc/IrregSwe.gf
View File

@@ -177,7 +177,7 @@ concrete IrregSwe of IrregSweAbs = CatSwe ** open ParadigmsSwe in {
utbrista_V = irregV "utbrista" "utbrast" "utbrustit" ;
utesluta_V = irregV "utesluta" "uteslöt" "uteslutit" ;
utskriva_V = irregV "utskriva" "utskrev" "utskrivit" ;
veta_V = mkV "veta" "vet" "vet" "visste" "vetat" (variants {}) ;
veta_V = mk6V "veta" "vet" "vet" "visste" "vetat" (variants {}) ;
vända_V = irregV "vända" "vände" "vänt" ;
vina_V = irregV "vina" "ven" "vinit" ;
vinna_V = irregV "vinna" "vann" "vunnit" ;

4
lib/resource-1.0/doc/gfdoc/Lang.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Lang: a Test Module for the Resource Grammar</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2006-06-26 13:24:17 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -34,6 +34,6 @@ which may be more suitable to open in applications.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Lang.txt -->
</BODY></HTML>

12
lib/resource-1.0/doc/gfdoc/Lexicon.html
View File

@@ -13,7 +13,7 @@
<HR NOSHADE SIZE=1>
<P></P>
<P>
Last update: 2006-07-02 00:15:01 CEST
Last update: 2007-06-04 14:10:04 CEST
</P>
<P>
Produced by
@@ -180,6 +180,7 @@ gfdoc - a rudimentary GF document generator.
important_A : A ;
industry_N : N ;
iron_N : N ;
john_PN : PN ;
jump_V : V ;
kill_V2 : V2 ;
king_N : N ;
@@ -209,7 +210,6 @@ gfdoc - a rudimentary GF document generator.
man_N : N ;
married_A2 : A2 ;
meat_N : N ;
meat_N : N ;
milk_N : N ;
moon_N : N ;
mother_N2 : N2 ;
@@ -246,10 +246,13 @@ gfdoc - a rudimentary GF document generator.
push_V2 : V2 ;
put_V2 : V2 ;
queen_N : N ;
question_N : N ;
radio_N : N ;
rain_N : N ;
rain_V0 : V ;
read_V2 : V2 ;
ready_A : A ;
reason_N : N ;
red_A : A ;
religion_N : N ;
restaurant_N : N ;
@@ -334,6 +337,7 @@ gfdoc - a rudimentary GF document generator.
think_V : V ;
throw_V2 : V2 ;
tie_V2 : V2 ;
today_Adv : Adv ;
tongue_N : N ;
tooth_N : N ;
train_N : N ;
@@ -341,6 +345,7 @@ gfdoc - a rudimentary GF document generator.
tree_N : N ;
turn_V : V ;
ugly_A : A ;
uncertain_A : A ;
understand_V2 : V2 ;
university_N : N ;
village_N : N ;
@@ -352,7 +357,6 @@ gfdoc - a rudimentary GF document generator.
wash_V2 : V2 ;
watch_V2 : V2 ;
water_N : N ;
water_N : N ;
wet_A : A ;
white_A : A ;
wide_A : A ;
@@ -376,6 +380,6 @@ gfdoc - a rudimentary GF document generator.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Lexicon.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Mathematical.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> The Mathematics API to the Resource Grammar</H1>
<FONT SIZE="4">
<I>Last update: 2006-03-03 17:06:11 CET</I><BR>
<I>Last update: 2006-02-28 09:26:58 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -67,6 +67,6 @@ Sentence,
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc mathematical/Mathematical.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Multi.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Multimodal additions to the resource grammar library</H1>
<FONT SIZE="4">
<I>Last update: 2006-05-31 02:54:54 CEST</I><BR>
<I>Last update: 2006-05-24 15:08:56 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -75,6 +75,6 @@ Building points from strings.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc multimodal/Multi.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Noun.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Noun: Nouns, noun phrases, and determiners</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2006-06-26 13:24:17 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -219,6 +219,6 @@ This is certainly overgenerating.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Noun.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Numeral.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Numerals</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2006-06-26 13:24:17 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -74,6 +74,6 @@ parts of a numeral, which is often incorrect - more work on
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Numeral.txt -->
</BODY></HTML>

160
lib/resource-1.0/doc/gfdoc/ParadigmsDan.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Danish Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2007-07-06 10:12:24 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -28,8 +28,8 @@
<LI><A HREF="#toc9">Adverbs</A>
<LI><A HREF="#toc10">Verbs</A>
<UL>
<LI><A HREF="#toc11">Verbs with 'være' as auxiliary</A>
<LI><A HREF="#toc12">Verbs with a particle</A>
<LI><A HREF="#toc11">Verbs with a particle.</A>
<LI><A HREF="#toc12">Verbs with 'være' as auxiliary</A>
<LI><A HREF="#toc13">Deponent verbs</A>
<LI><A HREF="#toc14">Two-place verbs</A>
<LI><A HREF="#toc15">Three-place verbs</A>
@@ -126,12 +126,8 @@ Prepositions used in many-argument functions are just strings.
<P></P>
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
Worst case: give all four forms. The gender is computed from the
last letter of the second form (if <I>n</I>, then <CODE>utrum</CODE>, otherwise <CODE>neutrum</CODE>).
</P>
<PRE>
mkN : (dreng,drengen,drenge,drengene : Str) -&gt; N ;
mkN : overload {
</PRE>
<P></P>
<P>
@@ -141,14 +137,14 @@ The heuristic is that all nouns are <CODE>utrum</CODE> with the
plural ending <I>er</I> or <I>r</I>.
</P>
<PRE>
regN : Str -&gt; N ;
mkN : (bil : Str) -&gt; N ;
</PRE>
<P></P>
<P>
Giving gender manually makes the heuristic more reliable.
</P>
<PRE>
regGenN : Str -&gt; Gender -&gt; N ;
mkN : (hus : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
@@ -156,7 +152,7 @@ This function takes the singular indefinite and definite forms; the
gender is computed from the definite form.
</P>
<PRE>
mk2N : (bil,bilen : Str) -&gt; N ;
mkN : (bil,bilen : Str) -&gt; N ;
</PRE>
<P></P>
<P>
@@ -164,7 +160,16 @@ This function takes the singular indefinite and definite and the plural
indefinite
</P>
<PRE>
mk3N : (bil,bilen,biler : Str) -&gt; N ;
mkN : (bil,bilen,biler : Str) -&gt; N ;
</PRE>
<P></P>
<P>
Worst case: give all four forms. The gender is computed from the
last letter of the second form (if <I>n</I>, then <CODE>utrum</CODE>, otherwise <CODE>neutrum</CODE>).
</P>
<PRE>
mkN : (dreng,drengen,drenge,drengene : Str) -&gt; N ;
} ;
</PRE>
<P></P>
<A NAME="toc3"></A>
@@ -216,46 +221,34 @@ and <CODE>PrepNP</CODE> constructions to build phrases like this.
Proper names, with a regular genitive, are formed as follows
</P>
<PRE>
mkPN : Str -&gt; Gender -&gt; PN ; -- Paris neutrum
regPN : Str -&gt; PN ; -- utrum gender
</PRE>
<P></P>
<P>
Sometimes you can reuse a common noun as a proper name, e.g. <I>Bank</I>.
</P>
<PRE>
nounPN : N -&gt; PN ;
</PRE>
<P></P>
<P>
To form a noun phrase that can also be plural and have an irregular
genitive, you can use the worst-case function.
</P>
<PRE>
mkNP : Str -&gt; Str -&gt; Number -&gt; Gender -&gt; NP ;
mkPN : overload {
mkPN : Str -&gt; PN ; -- utrum
mkPN : Str -&gt; Gender -&gt; PN ;
mkPN : N -&gt; PN ;
} ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<H2>Adjectives</H2>
<P>
Non-comparison one-place adjectives need three forms:
The regular pattern works for many adjectives, e.g. those ending
with <I>ig</I>. Two, five, or at worst five forms are sometimes needed.
</P>
<PRE>
mkA : (galen,galet,galne : Str) -&gt; A ;
mkA : overload {
mkA : (fin : Str) -&gt; A ;
mkA : (fin,fint : Str) -&gt; A ;
mkA : (galen,galet,galne : Str) -&gt; A ;
mkA : (stor,stort,store,storre,storst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
For regular adjectives, the other forms are derived.
If comparison is formed by <I>mer</I>, <I>mest</I>, as in general for
long adjective, the following pattern is used:
</P>
<PRE>
regA : Str -&gt; A ;
</PRE>
<P></P>
<P>
In most cases, two forms are enough.
</P>
<PRE>
mk2A : (stor,stort : Str) -&gt; A ;
mkA : A -&gt; A ; -- -/mer/mest norsk
} ;
</PRE>
<P></P>
<A NAME="toc8"></A>
@@ -267,44 +260,6 @@ Two-place adjectives need a preposition for their second argument.
mkA2 : A -&gt; Prep -&gt; A2 ;
</PRE>
<P></P>
<P>
Comparison adjectives may need as many as five forms.
</P>
<PRE>
mkADeg : (stor,stort,store,storre,storst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
The regular pattern works for many adjectives, e.g. those ending
with <I>ig</I>.
</P>
<PRE>
regADeg : Str -&gt; A ;
</PRE>
<P></P>
<P>
Just the comparison forms can be irregular.
</P>
<PRE>
irregADeg : (tung,tyngre,tyngst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Sometimes just the positive forms are irregular.
</P>
<PRE>
mk3ADeg : (galen,galet,galna : Str) -&gt; A ;
mk2ADeg : (bred,bredt : Str) -&gt; A ;
</PRE>
<P></P>
<P>
If comparison is formed by <I>mer</I>, <I>mest</I>, as in general for
long adjective, the following pattern is used:
</P>
<PRE>
compoundA : A -&gt; A ; -- -/mer/mest norsk
</PRE>
<P></P>
<A NAME="toc9"></A>
<H2>Adverbs</H2>
<P>
@@ -326,25 +281,22 @@ Adverbs modifying adjectives and sentences can also be formed.
<P></P>
<A NAME="toc10"></A>
<H2>Verbs</H2>
<P>
The worst case needs six forms.
</P>
<PRE>
mkV : (spise,spiser,spises,spiste,spist,spis : Str) -&gt; V ;
mkV : overload {
</PRE>
<P></P>
<P>
The 'regular verb' function is the first conjugation.
</P>
<PRE>
regV : (snakke : Str) -&gt; V ;
mkV : (snakke : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The almost regular verb function needs the infinitive and the preteritum.
</P>
<PRE>
mk2V : (leve,levde : Str) -&gt; V ;
mkV : (leve,levde : Str) -&gt; V ;
</PRE>
<P></P>
<P>
@@ -352,10 +304,27 @@ There is an extensive list of irregular verbs in the module <CODE>IrregDan</CODE
In practice, it is enough to give three forms, as in school books.
</P>
<PRE>
irregV : (drikke, drak, drukket : Str) -&gt; V ;
mkV : (drikke, drakk, drukket : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The worst case needs six forms.
</P>
<PRE>
mkV : (spise,spiser,spises,spiste,spist,spis : Str) -&gt; V ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<H3>Verbs with a particle.</H3>
<P>
The particle, such as in <I>lukke op</I>, is given as a string.
</P>
<PRE>
mkV : V -&gt; Str -&gt; V ;
} ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<H3>Verbs with 'være' as auxiliary</H3>
<P>
By default, the auxiliary is <I>have</I>. This function changes it to <I>være</I>.
@@ -364,15 +333,6 @@ By default, the auxiliary is <I>have</I>. This function changes it to <I>v
vaereV : V -&gt; V ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<H3>Verbs with a particle</H3>
<P>
The particle, such as in <I>passe på</I>, is given as a string.
</P>
<PRE>
partV : V -&gt; Str -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<H3>Deponent verbs</H3>
<P>
@@ -388,12 +348,14 @@ reflexive e.g. <I>forestille sig</I>.
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, except the special case with direct object.
(transitive verbs). Notice that a particle comes from the <CODE>V</CODE>.
(transitive verbs). Notice that, if a particle is needed, it comes from the <CODE>V</CODE>.
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
mkV2 : overload {
mkV2 : Str -&gt; V2 ;
mkV2 : V -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2 ;
} ;
</PRE>
<P></P>
<A NAME="toc15"></A>
@@ -443,6 +405,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc danish/ParadigmsDan.txt -->
</BODY></HTML>

256
lib/resource-1.0/doc/gfdoc/ParadigmsEng.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> English Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2007-01-08 17:30:04 CET</I><BR>
<I>Last update: 2007-06-25 18:09:50 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -18,22 +18,19 @@
<UL>
<LI><A HREF="#toc3">Compound nouns</A>
<LI><A HREF="#toc4">Relational nouns</A>
<LI><A HREF="#toc5">Relational common noun phrases</A>
<LI><A HREF="#toc6">Proper names and noun phrases</A>
<LI><A HREF="#toc5">Proper names and noun phrases</A>
</UL>
<LI><A HREF="#toc7">Adjectives</A>
<LI><A HREF="#toc6">Adjectives</A>
<UL>
<LI><A HREF="#toc8">Two-place adjectives</A>
<LI><A HREF="#toc7">Two-place adjectives</A>
</UL>
<LI><A HREF="#toc9">Adverbs</A>
<LI><A HREF="#toc10">Prepositions</A>
<LI><A HREF="#toc11">Verbs</A>
<LI><A HREF="#toc8">Adverbs</A>
<LI><A HREF="#toc9">Prepositions</A>
<LI><A HREF="#toc10">Verbs</A>
<UL>
<LI><A HREF="#toc12">Verbs with a particle.</A>
<LI><A HREF="#toc13">Reflexive verbs</A>
<LI><A HREF="#toc14">Two-place verbs</A>
<LI><A HREF="#toc15">Three-place verbs</A>
<LI><A HREF="#toc16">Other complement patterns</A>
<LI><A HREF="#toc11">Two-place verbs</A>
<LI><A HREF="#toc12">Three-place verbs</A>
<LI><A HREF="#toc13">Other complement patterns</A>
</UL>
</UL>
@@ -130,13 +127,6 @@ number of arguments.
</PRE>
<P></P>
<P>
Worst case: give all four forms.
</P>
<PRE>
mkN : (man,men,man's,men's : Str) -&gt; N ;
</PRE>
<P></P>
<P>
The regular function captures the variants for nouns ending with
<I>s</I>,<I>sh</I>,<I>x</I>,<I>z</I> or <I>y</I>: <I>kiss - kisses</I>, <I>flash - flashes</I>;
<I>fly - flies</I> (but <I>toy - toys</I>),
@@ -146,19 +136,17 @@ The regular function captures the variants for nouns ending with
</PRE>
<P></P>
<P>
In practice the worst case is just: give singular and plural nominative.
In practice the worst case is to give singular and plural nominative.
</P>
<PRE>
mkN : (man,men : Str) -&gt; N ;
</PRE>
<P></P>
<P>
All nouns created by the previous functions are marked as
<CODE>nonhuman</CODE>. If you want a <CODE>human</CODE> noun, wrap it with the following
function:
The theoretical worst case: give all four forms.
</P>
<PRE>
mkN : Gender -&gt; N -&gt; N ;
mkN : (man,men,man's,men's : Str) -&gt; N ;
</PRE>
<P></P>
<A NAME="toc3"></A>
@@ -201,60 +189,64 @@ Three-place relational nouns (<I>the connection from x to y</I>) need two prepos
</PRE>
<P></P>
<A NAME="toc5"></A>
<H3>Relational common noun phrases</H3>
<H3>Proper names and noun phrases</H3>
<P>
In some cases, you may want to make a complex <CODE>CN</CODE> into a
relational noun (e.g. <I>the old town hall of</I>).
Proper names, with a regular genitive, are formed from strings.
</P>
<PRE>
cnN2 : CN -&gt; Prep -&gt; N2 ;
cnN3 : CN -&gt; Prep -&gt; Prep -&gt; N3 ;
mkPN : overload {
mkPN : Str -&gt; PN ;
</PRE>
<P></P>
<P>
Sometimes a common noun can be reused as a proper name, e.g. <I>Bank</I>
</P>
<PRE>
mkPN : N -&gt; PN
} ;
</PRE>
<P></P>
<A NAME="toc6"></A>
<H3>Proper names and noun phrases</H3>
<P>
Proper names, with a regular genitive, are formed as follows
</P>
<H2>Adjectives</H2>
<PRE>
regPN : Str -&gt; PN ;
regGenPN : Str -&gt; Gender -&gt; PN ; -- John, John's
mkA : overload {
</PRE>
<P></P>
<P>
Sometimes you can reuse a common noun as a proper name, e.g. <I>Bank</I>.
For regular adjectives, the adverbial and comparison forms are derived. This holds
even for cases with the variations <I>happy - happily - happier - happiest</I>,
<I>free - freely - freer - freest</I>, and <I>rude - rudest</I>.
</P>
<PRE>
nounPN : N -&gt; PN ;
mkA : (happy : Str) -&gt; A ;
</PRE>
<P></P>
<P>
To form a noun phrase that can also be plural and have an irregular
genitive, you can use the worst-case function.
However, the duplication of the final consonant cannot be predicted,
but a separate case is used to give the comparative
</P>
<PRE>
mkNP : Str -&gt; Str -&gt; Number -&gt; Gender -&gt; NP ;
mkA : (fat,fatter : Str) -&gt; A ;
</PRE>
<P></P>
<P>
As many as four forms may be needed.
</P>
<PRE>
mkA : (good,better,best,well : Str) -&gt; A
} ;
</PRE>
<P></P>
<P>
To force comparison to be formed by <I>more - most</I>,
the following function is used:
</P>
<PRE>
compoundA : A -&gt; A ; -- -/more/most ridiculous
</PRE>
<P></P>
<A NAME="toc7"></A>
<H2>Adjectives</H2>
<P>
Non-comparison one-place adjectives need two forms: one for
the adjectival and one for the adverbial form (<I>free - freely</I>)
</P>
<PRE>
mkA : (free,freely : Str) -&gt; A ;
</PRE>
<P></P>
<P>
For regular adjectives, the adverbial form is derived. This holds
even for cases with the variation <I>happy - happily</I>.
</P>
<PRE>
regA : Str -&gt; A ;
</PRE>
<P></P>
<A NAME="toc8"></A>
<H3>Two-place adjectives</H3>
<P>
Two-place adjectives need a preposition for their second argument.
@@ -263,48 +255,7 @@ Two-place adjectives need a preposition for their second argument.
mkA2 : A -&gt; Prep -&gt; A2 ;
</PRE>
<P></P>
<P>
Comparison adjectives may two more forms.
</P>
<PRE>
ADeg : Type ;
mkADeg : (good,better,best,well : Str) -&gt; ADeg ;
</PRE>
<P></P>
<P>
The regular pattern recognizes two common variations:
<I>-e</I> (<I>rude</I> - <I>ruder</I> - <I>rudest</I>) and
<I>-y</I> (<I>happy - happier - happiest - happily</I>)
</P>
<PRE>
regADeg : Str -&gt; ADeg ; -- long, longer, longest
</PRE>
<P></P>
<P>
However, the duplication of the final consonant is nor predicted,
but a separate pattern is used:
</P>
<PRE>
duplADeg : Str -&gt; ADeg ; -- fat, fatter, fattest
</PRE>
<P></P>
<P>
If comparison is formed by <I>more</I>, <I>most</I>, as in general for
long adjective, the following pattern is used:
</P>
<PRE>
compoundADeg : A -&gt; ADeg ; -- -/more/most ridiculous
</PRE>
<P></P>
<P>
From a given <CODE>ADeg</CODE>, it is possible to get back to <CODE>A</CODE>.
</P>
<PRE>
adegA : ADeg -&gt; A ;
</PRE>
<P></P>
<A NAME="toc9"></A>
<A NAME="toc8"></A>
<H2>Adverbs</H2>
<P>
Adverbs are not inflected. Most lexical ones have position
@@ -322,7 +273,7 @@ Adverbs modifying adjectives and sentences can also be formed.
mkAdA : Str -&gt; AdA ;
</PRE>
<P></P>
<A NAME="toc10"></A>
<A NAME="toc9"></A>
<H2>Prepositions</H2>
<P>
A preposition as used for rection in the lexicon, as well as to
@@ -336,76 +287,91 @@ build <CODE>PP</CODE>s in the resource API, just requires a string.
<P>
(These two functions are synonyms.)
</P>
<A NAME="toc11"></A>
<A NAME="toc10"></A>
<H2>Verbs</H2>
<P>
Verbs are constructed by the function <CODE>mkV</CODE>, which takes a varying
number of arguments.
</P>
<PRE>
mkV : overload {
</PRE>
<P></P>
<P>
The regular verb function recognizes the special cases where the last
character is <I>y</I> (<I>cry-cries</I> but <I>buy-buys</I>) or a sibilant
(<I>kiss-</I>kisses<I>, //jazz-jazzes</I>, <I>rush-rushes</I>, <I>munch - munches</I>, //
<I>fix - fixes</I>).
</P>
<PRE>
mkV : (cry : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Give the present and past forms for regular verbs where
the last letter is duplicated in some forms,
e.g. <I>rip - ripped - ripping</I>.
</P>
<PRE>
mkV : (stop, stopped : Str) -&gt; V ;
</PRE>
<P></P>
<P>
There is an extensive list of irregular verbs in the module <CODE>IrregularEng</CODE>.
In practice, it is enough to give three forms,
e.g. <I>drink - drank - drunk</I>.
</P>
<PRE>
mkV : (drink, drank, drunk : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Irregular verbs with duplicated consonant in the present participle.
</P>
<PRE>
mkV : (run, ran, run, running : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Except for <I>be</I>, the worst case needs five forms: the infinitive and
the third person singular present, the past indicative, and the
past and present participles.
</P>
<PRE>
mkV : (go, goes, went, gone, going : Str) -&gt; V ;
mkV : (go, goes, went, gone, going : Str) -&gt; V
};
</PRE>
<P></P>
<P>
The regular verb function recognizes the special cases where the last
character is <I>y</I> (<I>cry - cries</I> but <I>buy - buys</I>) or <I>s</I>, <I>sh</I>, <I>x</I>, <I>z</I>
(<I>fix - fixes</I>, etc).
</P>
<PRE>
regV : Str -&gt; V ;
</PRE>
<P></P>
<P>
The following variant duplicates the last letter in the forms like
<I>rip - ripped - ripping</I>.
</P>
<PRE>
regDuplV : Str -&gt; V ;
</PRE>
<P></P>
<P>
There is an extensive list of irregular verbs in the module <CODE>IrregularEng</CODE>.
In practice, it is enough to give three forms,
e.g. <I>drink - drank - drunk</I>, with a variant indicating consonant
duplication in the present participle.
</P>
<PRE>
irregV : (drink, drank, drunk : Str) -&gt; V ;
irregDuplV : (get, got, gotten : Str) -&gt; V ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<H3>Verbs with a particle.</H3>
<P>
Verbs with a particle.
The particle, such as in <I>switch on</I>, is given as a string.
</P>
<PRE>
partV : V -&gt; Str -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<H3>Reflexive verbs</H3>
<P>
Reflexive verbs.
By default, verbs are not reflexive; this function makes them that.
</P>
<PRE>
reflV : V -&gt; V ;
</PRE>
<P></P>
<A NAME="toc14"></A>
<A NAME="toc11"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, except the special case with direct object.
(transitive verbs). Notice that a particle comes from the <CODE>V</CODE>.
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
mkV2 : overload {
mkV2 : V -&gt; Prep -&gt; V2 ; -- believe in
mkV2 : V -&gt; V2 -- kill
};
</PRE>
<P></P>
<A NAME="toc15"></A>
<A NAME="toc12"></A>
<H3>Three-place verbs</H3>
<P>
Three-place (ditransitive) verbs need two prepositions, of which
@@ -417,7 +383,7 @@ the first one or both can be absent.
dirdirV3 : V -&gt; V3 ; -- give,_,_
</PRE>
<P></P>
<A NAME="toc16"></A>
<A NAME="toc13"></A>
<H3>Other complement patterns</H3>
<P>
Verbs and adjectives can take complements such as sentences,
@@ -441,17 +407,17 @@ questions, verb phrases, and adjectives.
</PRE>
<P></P>
<P>
Notice: categories <CODE>V2S, V2V, V2A, V2Q</CODE> are in v 1.0 treated
Notice: categories <CODE>V2S, V2V, V2Q</CODE> are in v 1.0 treated
just as synonyms of <CODE>V2</CODE>, and the second argument is given
as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
<CODE>V0</CODE> is just <CODE>V</CODE>.
</P>
<PRE>
V0, V2S, V2V, V2A, V2Q : Type ;
V0, V2S, V2V, V2Q : Type ;
AS, A2S, AV, A2V : Type ;
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc english/ParadigmsEng.txt -->
</BODY></HTML>

115
lib/resource-1.0/doc/gfdoc/ParadigmsFin.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Finnish Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2006-11-21 14:49:06 CET</I><BR>
<I>Last update: 2007-07-08 15:18:54 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -117,8 +117,6 @@ stems, vowel alternation, and vowel harmony.
</P>
<PRE>
oper
mkN : (talo, talon, talona, taloa, taloon,
taloina,taloissa,talojen,taloja,taloihin : Str) -&gt; N ;
</PRE>
<P></P>
<P>
@@ -127,22 +125,21 @@ nominative) and analyses it to pick the correct paradigm.
It does automatic grade alternation, and is hence not usable
for words like <I>auto</I> (whose genitive would become <I>audon</I>).
</P>
<PRE>
regN : (talo : Str) -&gt; N ;
</PRE>
<P></P>
<P>
If <CODE>regN</CODE> does not give the correct result, one can try and give
two or three forms as follows. Examples of the use of these
functions are given in <CODE>BasicFin</CODE>. Most notably, <CODE>reg2N</CODE> is used
If the one-argument paradigm does not give the correct result, one can try and give
two or three forms. Most notably, the two-argument variant is used
for nouns like <I>kivi - kiviä</I>, which would otherwise become like
<I>rivi - rivejä</I>. <CODE>regN3</CODE> is used e.g. for
<I>rivi - rivejä</I>. Three arguments are used e.g. for
<I>sydän - sydämen - sydämiä</I>, which would otherwise become
<I>sydän - sytämen</I>.
</P>
<PRE>
reg2N : (savi,savia : Str) -&gt; N ;
reg3N : (vesi,veden,vesiä : Str) -&gt; N ;
mkN : overload {
mkN : (talo : Str) -&gt; N ;
mkN : (savi,savia : Str) -&gt; N ;
mkN : (vesi,veden,vesiä : Str) -&gt; N ;
mkN : (olo,oln,olona,oloa,oloon,oloina,oloissa,olojen,oloja,oloihin : Str) -&gt; N
} ;
</PRE>
<P></P>
<P>
@@ -291,12 +288,14 @@ have only their last part inflected.
</PRE>
<P></P>
<P>
Nouns used as functions need a case, of which by far the commonest is
Nouns used as functions need a case, of which the default is
the genitive.
</P>
<PRE>
mkN2 : N -&gt; Prep -&gt; N2 ;
genN2 : N -&gt; N2 ;
mkN2 = overload {
mkN2 : N -&gt; N2 = genN2 ;
mkN2 : N -&gt; Prep -&gt; N2 = mmkN2
} ;
mkN3 : N -&gt; Prep -&gt; Prep -&gt; N3 ;
</PRE>
@@ -306,18 +305,28 @@ Proper names can be formed by using declensions for nouns.
The plural forms are filtered away by the compiler.
</P>
<PRE>
regPN : Str -&gt; PN ;
mkPN : N -&gt; PN ;
mkNP : N -&gt; Number -&gt; NP ;
mkPN : overload {
mkPN : Str -&gt; PN ;
mkPN : N -&gt; PN
} ;
</PRE>
<P></P>
<A NAME="toc3"></A>
<H2>Adjectives</H2>
<P>
Non-comparison one-place adjectives are just like nouns.
The regular adjectives are based on <CODE>regN</CODE> in the positive.
Comparison adjectives have three forms.
The comparative and the superlative
are always inflected in the same way, so the nominative of them is actually
enough (except for the superlative <I>paras</I> of <I>hyvä</I>).
</P>
<PRE>
mkA : N -&gt; A ;
mkA : overload {
mkA : Str -&gt; A ;
mkA : N -&gt; A ;
mkA : N -&gt; (kivempaa,kivinta : Str) -&gt; A
} ;
</PRE>
<P></P>
<P>
@@ -327,22 +336,6 @@ Two-place adjectives need a case for the second argument.
mkA2 : A -&gt; Prep -&gt; A2 ;
</PRE>
<P></P>
<P>
Comparison adjectives have three forms. The comparative and the superlative
are always inflected in the same way, so the nominative of them is actually
enough (except for the superlative <I>paras</I> of <I>hyvä</I>).
</P>
<PRE>
mkADeg : (kiva : N) -&gt; (kivempaa,kivinta : Str) -&gt; A ;
</PRE>
<P></P>
<P>
The regular adjectives are based on <CODE>regN</CODE> in the positive.
</P>
<PRE>
regA : (punainen : Str) -&gt; A ;
</PRE>
<P></P>
<A NAME="toc4"></A>
<H2>Verbs</H2>
<P>
@@ -350,26 +343,22 @@ The grammar does not cover the potential mood and some nominal
forms. One way to see the coverage is to linearize a verb to
a table.
The worst case needs twelve forms, as shown in the following.
</P>
<PRE>
mkV : (tulla,tulee,tulen,tulevat,tulkaa,tullaan,
tuli,tulin,tulisi,tullut,tultu,tullun : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The following heuristics cover more and more verbs.
</P>
<PRE>
regV : (soutaa : Str) -&gt; V ;
reg2V : (soutaa,souti : Str) -&gt; V ;
reg3V : (soutaa,soudan,souti : Str) -&gt; V ;
mkV : overload {
mkV : (soutaa : Str) -&gt; V ;
mkV : (soutaa,souti : Str) -&gt; V ;
mkV : (soutaa,soudan,souti : Str) -&gt; V ;
mkV : (tulla,tulee,tulen,tulevat,tulkaa,tullaan,tuli,tulin,tulisi,tullut,tultu,tullun : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The subject case of verbs is by default nominative. This dunction can change it.
The subject case of verbs is by default nominative. This function can change it.
</P>
<PRE>
subjcaseV : V -&gt; Case -&gt; V ;
mkV : V -&gt; Case -&gt; V
} ;
</PRE>
<P></P>
<P>
@@ -429,26 +418,18 @@ The verbs <I>be</I> is special.
<A NAME="toc5"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a case, and can have a pre- or postposition.
Two-place verbs need an object case, and can have a pre- or postposition.
The default is direct (accusative) object. There is also a special case
with case only. The string-only argument case yields a regular verb with
accusative object.
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
</PRE>
<P></P>
<P>
If the complement needs just a case, the following special function can be used.
</P>
<PRE>
caseV2 : V -&gt; Case -&gt; V2 ;
</PRE>
<P></P>
<P>
Verbs with a direct (accusative) object
are special, since their complement case is finally decided in syntax.
But this is taken care of in <CODE>VerbFin</CODE>.
</P>
<PRE>
dirV2 : V -&gt; V2 ;
mkV2 : overload {
mkV2 : Str -&gt; V2 ;
mkV2 : V -&gt; V2 ;
mkV2 : V -&gt; Case -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2 ;
} ;
</PRE>
<P></P>
<A NAME="toc6"></A>
@@ -498,6 +479,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc finnish/ParadigmsFin.txt -->
</BODY></HTML>

186
lib/resource-1.0/doc/gfdoc/ParadigmsFre.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> French Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2007-07-06 09:17:50 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -24,14 +24,13 @@
<LI><A HREF="#toc7">Adjectives</A>
<UL>
<LI><A HREF="#toc8">Two-place adjectives</A>
<LI><A HREF="#toc9">Comparison adjectives</A>
</UL>
<LI><A HREF="#toc10">Adverbs</A>
<LI><A HREF="#toc11">Verbs</A>
<LI><A HREF="#toc9">Adverbs</A>
<LI><A HREF="#toc10">Verbs</A>
<UL>
<LI><A HREF="#toc12">Two-place verbs</A>
<LI><A HREF="#toc13">Three-place verbs</A>
<LI><A HREF="#toc14">Other complement patterns</A>
<LI><A HREF="#toc11">Two-place verbs</A>
<LI><A HREF="#toc12">Three-place verbs</A>
<LI><A HREF="#toc13">Other complement patterns</A>
</UL>
</UL>
@@ -122,32 +121,35 @@ amalgamate with the following word (the 'genitive' <I>de</I> and the
<P></P>
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
Worst case: give both two forms and the gender.
</P>
<PRE>
mkN : (oeil,yeux : Str) -&gt; Gender -&gt; N ;
mkN : overload {
</PRE>
<P></P>
<P>
The regular function takes the singular form,
and computes the plural and the gender by a heuristic. The plural
The regular function uses heuristics to compute the
plural and the gender from the singular. The plural
heuristic currently
covers the cases <I>pas-pas</I>, <I>prix-prix</I>, <I>nez-nez</I>,
<I>bijou-bijoux</I>, <I>cheveu-cheveux</I>, <I>plateau-plateaux</I>, <I>cheval-chevaux</I>.
The gender heuristic is less reliable: it treats as feminine all
nouns ending with <I>e</I> and <I>ion</I>, all others as masculine.
If in doubt, use the <CODE>cc</CODE> command to test!
</P>
<PRE>
regN : Str -&gt; N ;
mkN : (cheval : Str) -&gt; N ;
</PRE>
<P></P>
<P>
Adding gender information widens the scope of the foregoing function.
Adding gender information widens the scope of the regular pattern.
</P>
<PRE>
regGenN : Str -&gt; Gender -&gt; N ;
mkN : (foie : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
In the worst case, both singular and plural forms and the gender are needed.
</P>
<PRE>
mkN : (oeil,yeux : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<A NAME="toc3"></A>
@@ -159,7 +161,8 @@ They could be formed in syntax, but we give a shortcut here since
they are frequent in lexica.
</P>
<PRE>
compN : N -&gt; Str -&gt; N ;
mkN : N -&gt; Str -&gt; N
} ;
</PRE>
<P></P>
<A NAME="toc4"></A>
@@ -198,51 +201,65 @@ and <CODE>PrepNP</CODE> constructions to build phrases like this.
<A NAME="toc6"></A>
<H3>Proper names and noun phrases</H3>
<P>
Proper names need a string and a gender.
Proper names need a string and a gender. If no gender is given, the
feminine is used for strings ending with <I>e</I>, the masculine for other strings.
</P>
<PRE>
mkPN : Str -&gt; Gender -&gt; PN ; -- Jean
regPN : Str -&gt; PN ; -- feminine if "-e", masculine otherwise
</PRE>
<P></P>
<P>
To form a noun phrase that can also be plural,
you can use the worst-case function.
</P>
<PRE>
mkNP : Str -&gt; Gender -&gt; Number -&gt; NP ;
mkPN : overload {
mkPN : Str -&gt; PN ;
mkPN : Str -&gt; Gender -&gt; PN
} ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<H2>Adjectives</H2>
<P>
Non-comparison one-place adjectives need four forms in the worst
case (masc and fem singular, masc plural, adverbial).
</P>
<PRE>
mkA : (banal,banale,banaux,banalement : Str) -&gt; A ;
mkA : overload {
</PRE>
<P></P>
<P>
For regular adjectives, all other forms are derived from the
For regular adjectives, all forms are derived from the
masculine singular. The heuristic takes into account certain
deviant endings: <I>banal- -banaux</I>, <I>chinois- -chinois</I>,
deviant endings: <I>banal-banale-banaux</I>, <I>chinois-chinoise-chinois</I>,
<I>heureux-heureuse-heureux</I>, <I>italien-italienne</I>, <I>jeune-jeune</I>,
<I>amer-amère</I>, <I>carré- - -carrément</I>, <I>joli- - -joliment</I>.
</P>
<PRE>
regA : Str -&gt; A ;
mkA : (cher : Str) -&gt; A ;
</PRE>
<P></P>
<P>
These functions create postfix adjectives. To switch
Often just the feminine singular is deviant.
</P>
<PRE>
mkA : (sec,seche : Str) -&gt; A ;
</PRE>
<P></P>
<P>
This is the worst-case paradigm for the positive forms.
</P>
<PRE>
mkA : (banal,banale,banaux,banalement : Str) -&gt; A ;
</PRE>
<P></P>
<P>
If comparison forms are irregular (i.e. not formed by <I>plus</I>, e.g.
<I>bon-meilleur</I>), the positive and comparative can be given as separate
adjectives.
</P>
<PRE>
mkA : A -&gt; A -&gt; A
} ;
</PRE>
<P></P>
<P>
The functions create by default postfix adjectives. To switch
them to prefix ones (i.e. ones placed before the noun in
modification, as in <I>petite maison</I>), the following function is
provided.
</P>
<PRE>
prefA : A -&gt; A ;
prefixA : A -&gt; A ;
</PRE>
<P></P>
<A NAME="toc8"></A>
@@ -255,32 +272,6 @@ Two-place adjectives need a preposition for their second argument.
</PRE>
<P></P>
<A NAME="toc9"></A>
<H3>Comparison adjectives</H3>
<P>
Comparison adjectives are in the worst case put up from two
adjectives: the positive (<I>bon</I>), and the comparative (<I>meilleure</I>).
</P>
<PRE>
mkADeg : A -&gt; A -&gt; A ;
</PRE>
<P></P>
<P>
If comparison is formed by <I>plus</I>, as usual in French,
the following pattern is used:
</P>
<PRE>
compADeg : A -&gt; A ;
</PRE>
<P></P>
<P>
For prefixed adjectives, the following function is
provided.
</P>
<PRE>
prefA : A -&gt; A ;
</PRE>
<P></P>
<A NAME="toc10"></A>
<H2>Adverbs</H2>
<P>
Adverbs are not inflected. Most lexical ones have position
@@ -304,24 +295,20 @@ Adverbs modifying adjectives and sentences can also be formed.
mkAdA : Str -&gt; AdA ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<A NAME="toc10"></A>
<H2>Verbs</H2>
<P>
Irregular verbs are given in the module <CODE>VerbsFre</CODE>.
Irregular verbs are given in the module <CODE>IrregFre</CODE>.
If a verb should be missing in that list, the module
<CODE>BeschFre</CODE> gives all the patterns of the <I>Bescherelle</I> book.
</P>
<P>
Regular verbs are ones with the infinitive <I>er</I> or <I>ir</I>, the
latter with plural present indicative forms as <I>finissons</I>.
The regular verb function is the first conjugation recognizes
The regular verb function in the first conjugation recognizes
these endings, as well as the variations among
<I>aimer, céder, placer, peser, jeter, placer, manger, assiéger, payer</I>.
</P>
<PRE>
regV : Str -&gt; V ;
</PRE>
<P></P>
<P>
Sometimes, however, it is not predictable which variant of the <I>er</I>
conjugation is to be selected. Then it is better to use the function
@@ -329,50 +316,63 @@ that gives the third person singular present indicative and future
((<I>il</I>) <I>jette</I>, <I>jettera</I>) as second argument.
</P>
<PRE>
reg3V : (jeter,jette,jettera : Str) -&gt; V ;
mkV : overload {
mkV : (finir : Str) -&gt; V ;
mkV : (jeter,jette,jettera : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The function <CODE>regV</CODE> gives all verbs the compound auxiliary <I>avoir</I>.
To change it to <I>être</I>, use the following function. Reflexive implies <I>être</I>.
The <CODE>IrregFre</CODE> list gives some verbs as two-place. These verbs can be
reused as one-place verbs.
</P>
<PRE>
mkV : V2 -&gt; V
} ;
</PRE>
<P></P>
<P>
The function <CODE>mkV</CODE> gives the default compound auxiliary <I>avoir</I>.
To change it to <I>être</I>, use the following function.
</P>
<PRE>
etreV : V -&gt; V ;
</PRE>
<P></P>
<P>
This function turns a verb into reflexive, which implies the auxiliary <I>être</I>.
</P>
<PRE>
reflV : V -&gt; V ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<A NAME="toc11"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, except the special case with direct object.
(transitive verbs).
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
mkV2 = overload {
mkV2 : V -&gt; V2 = dirV2 ;
mkV2 : V -&gt; Prep -&gt; V2 = mmkV2
} ;
</PRE>
<P></P>
<P>
You can reuse a <CODE>V2</CODE> verb in <CODE>V</CODE>.
</P>
<PRE>
v2V : V2 -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<A NAME="toc12"></A>
<H3>Three-place verbs</H3>
<P>
Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
</P>
<PRE>
mkV3 : V -&gt; Prep -&gt; Prep -&gt; V3 ; -- parler, à, de
dirV3 : V -&gt; Prep -&gt; V3 ; -- donner,_,à
dirdirV3 : V -&gt; V3 ; -- donner,_,_
mkV3 : overload {
mkV3 : V -&gt; V3 ; -- donner,_,_
mkV3 : V -&gt; Prep -&gt; V3 ; -- placer,_,dans
mkV3 : V -&gt; Prep -&gt; Prep -&gt; V3 -- parler, à, de
} ;
</PRE>
<P></P>
<A NAME="toc14"></A>
<A NAME="toc13"></A>
<H3>Other complement patterns</H3>
<P>
Verbs and adjectives can take complements such as sentences,
@@ -409,6 +409,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc french/ParadigmsFre.txt -->
</BODY></HTML>

163
lib/resource-1.0/doc/gfdoc/ParadigmsGer.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> German Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2007-03-22 14:10:09 CET</I><BR>
<I>Last update: 2007-06-08 17:51:31 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -38,7 +38,7 @@ gfdoc - a rudimentary GF document generator.
(c) Aarne Ranta (<A HREF="mailto:aarne@cs.chalmers.se">aarne@cs.chalmers.se</A>) 2002 under GNU GPL.
</P>
<P>
Aarne Ranta &amp; Harald Hammarström 2003--2006
Aarne Ranta, Harald Hammarström and Björn Bringert2003--2007
</P>
<P>
This is an API for the user of the resource grammar
@@ -50,19 +50,14 @@ Closed categories (determiners, pronouns, conjunctions) are
accessed through the resource syntax API, <CODE>Structural.gf</CODE>.
</P>
<P>
The main difference with <CODE>MorphoGer.gf</CODE> is that the types
referred to are compiled resource grammar types. We have moreover
had the design principle of always having existing forms, rather
than stems, as string arguments of the paradigms.
</P>
<P>
The structure of functions for each word class <CODE>C</CODE> is the following:
first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function <CODE>mkC</CODE>, which serves as an
escape to construct the most irregular words of type <CODE>C</CODE>.
However, this function should only seldom be needed: we have a
separate module <A HREF="../../german/IrregGer.gf"><CODE>IrregGer</CODE></A>
which covers irregularly inflected verbs.
cases, from the most regular (with just one argument) to the worst.
The name of this function is <CODE>mkC</CODE>.
</P>
<P>
There is also a module <A HREF="../../german/IrregGer.gf"><CODE>IrregGer</CODE></A>
which covers irregular verbs.
</P>
<PRE>
resource ParadigmsGer = open
@@ -111,13 +106,8 @@ To abstract over number names, we define the following.
<P></P>
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
Worst case: give all four singular forms, two plural forms (others + dative),
and the gender.
</P>
<PRE>
mkN : (x1,_,_,_,_,x6 : Str) -&gt; Gender -&gt; N ;
-- mann, mann, manne, mannes, männer, männern
mkN : overload {
</PRE>
<P></P>
<P>
@@ -127,7 +117,7 @@ feminine with plural ending <I>-n, -en</I>, and the rest are masculines
with the plural <I>-e</I> (without Umlaut).
</P>
<PRE>
regN : Str -&gt; N ;
mkN : (Stufe : Str) -&gt; N ;
</PRE>
<P></P>
<P>
@@ -136,21 +126,35 @@ dictionary. It takes the singular and plural nominative and the
gender, and infers the other forms from these.
</P>
<PRE>
reg2N : (x1,x2 : Str) -&gt; Gender -&gt; N ;
mkN : (Bild,Bilder : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
Worst case: give all four singular forms, two plural forms (others + dative),
and the gender.
</P>
<PRE>
mkN : (x1,_,_,_,_,x6 : Str) -&gt; Gender -&gt; N
-- mann, mann, manne, mannes, männer, männern
};
</PRE>
<P></P>
<P>
Relational nouns need a preposition. The most common is <I>von</I> with
the dative. Some prepositions are constructed in <A HREF="StructuralGer.html">StructuralGer</A>.
the dative, and there is a special case for regular nouns.
</P>
<PRE>
mkN2 : N -&gt; Prep -&gt; N2 ;
vonN2 : N -&gt; N2 ;
mkN2 : overload {
mkN2 : Str -&gt; N2 ;
mkN2 : N -&gt; N2 ;
mkN2 : N -&gt; Prep -&gt; N2
} ;
</PRE>
<P></P>
<P>
Use the function <CODE>mkPrep</CODE> or see the section on prepositions below to
form other prepositions.
Some prepositions are moreover constructed in <A HREF="StructuralGer.html">StructuralGer</A>.
</P>
<P>
Three-place relational nouns (<I>die Verbindung von x nach y</I>) need two prepositions.
@@ -162,22 +166,34 @@ Three-place relational nouns (<I>die Verbindung von x nach y</I>) need two prepo
<A NAME="toc3"></A>
<H3>Proper names and noun phrases</H3>
<P>
Proper names, with a regular genitive, are formed as follows
The regular genitive is <I>s</I>, omitted after <I>s</I>.
Proper names, with an <I>s</I> genitive and other cases like the
nominative, are formed from a string. Final <I>s</I> (<I>Johannes-Johannes</I>) is
taken into account.
</P>
<PRE>
mkPN : (karolus, karoli : Str) -&gt; PN ; -- karolus, karoli
regPN : (Johann : Str) -&gt; PN ;
-- Johann, Johanns ; Johannes, Johannes
mkPN : overload {
mkPN : Str -&gt; PN ;
</PRE>
<P></P>
<P>
If only the genitive differs, two strings are needed.
</P>
<PRE>
mkPN : (nom,gen : Str) -&gt; PN ;
</PRE>
<P></P>
<P>
In the worst case, all four forms are needed.
</P>
<PRE>
mkPN : (nom,acc,dat,gen : Str) -&gt; PN
} ;
</PRE>
<P></P>
<A NAME="toc4"></A>
<H2>Adjectives</H2>
<P>
Adjectives need three forms, one for each degree.
</P>
<PRE>
mkA : (x1,_,x3 : Str) -&gt; A ; -- gut,besser,beste
mkA : overload {
</PRE>
<P></P>
<P>
@@ -185,7 +201,16 @@ The regular adjective formation works for most cases, and includes
variations such as <I>teuer - teurer</I>, <I>böse - böser</I>.
</P>
<PRE>
regA : Str -&gt; A ;
mkA : Str -&gt; A ;
</PRE>
<P></P>
<P>
In the worst case, adjectives need three forms - one for each degree.
</P>
<PRE>
mkA : (gut,besser,beste : Str) -&gt; A -- gut,besser,beste
};
</PRE>
<P></P>
<P>
@@ -205,7 +230,7 @@ Two-place adjectives are formed by adding a preposition to an adjective.
<A NAME="toc5"></A>
<H2>Adverbs</H2>
<P>
Adverbs are just strings.
Adverbs are formed from strings.
</P>
<PRE>
mkAdv : Str -&gt; Adv ;
@@ -239,6 +264,24 @@ A couple of common prepositions (always with the dative).
<P></P>
<A NAME="toc7"></A>
<H2>Verbs</H2>
<PRE>
mkV : overload {
</PRE>
<P></P>
<P>
Regular verbs (<I>weak verbs</I>) need just the infinitive form.
</P>
<PRE>
mkV : (führen : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Irregular verbs use Ablaut and, in the worst cases, also Umlaut.
</P>
<PRE>
mkV : (sehen,sieht,sah,sähe,gesehen : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The worst-case constructor needs six forms:
</P>
@@ -252,21 +295,15 @@ The worst-case constructor needs six forms:
</UL>
<PRE>
mkV : (x1,_,_,_,_,x6 : Str) -&gt; V ; -- geben, gibt, gib, gab, gäbe, gegeben
mkV : (geben, gibt, gib, gab, gäbe, gegeben : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Weak verbs are sometimes called regular verbs.
To add a movable suffix e.g. <I>auf(fassen)</I>.
</P>
<PRE>
regV : Str -&gt; V ; -- führen
</PRE>
<P></P>
<P>
Irregular verbs use Ablaut and, in the worst cases, also Umlaut.
</P>
<PRE>
irregV : (x1,_,_,_,x5 : Str) -&gt; V ; -- sehen, sieht, sah, sähe, gesehen
mkV : Str -&gt; V -&gt; V
};
</PRE>
<P></P>
<P>
@@ -278,13 +315,6 @@ prefixed by <I>be-, ver-</I>.
</PRE>
<P></P>
<P>
To add a movable suffix e.g. <I>auf(fassen)</I>.
</P>
<PRE>
prefixV : Str -&gt; V -&gt; V ;
</PRE>
<P></P>
<P>
To change the auxiliary from <I>haben</I> (default) to <I>sein</I> and
vice-versa.
</P>
@@ -302,15 +332,30 @@ Reflexive verbs can take reflexive pronouns of different cases.
<P></P>
<A NAME="toc8"></A>
<H3>Two-place verbs</H3>
<PRE>
mkV2 : overload {
</PRE>
<P></P>
<P>
Two-place verbs need a preposition, except the special case with direct object
(accusative, transitive verbs). There is also a case for dative objects.
Two-place verbs with a preposition.
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
datV2 : V -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2 ;
</PRE>
<P></P>
<P>
Two-place verbs with direct object (accusative, transitive verbs).
</P>
<PRE>
mkV2 : V -&gt; V2 ;
</PRE>
<P></P>
<P>
Two-place verbs with object in the given case.
</P>
<PRE>
mkV2 : V -&gt; Case -&gt; V2
};
</PRE>
<P></P>
<A NAME="toc9"></A>
@@ -360,6 +405,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc german/ParadigmsGer.txt -->
</BODY></HTML>

200
lib/resource-1.0/doc/gfdoc/ParadigmsIta.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Italian Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2006-12-15 17:11:19 CET</I><BR>
<I>Last update: 2007-07-06 09:18:06 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -16,22 +16,20 @@
<LI><A HREF="#toc1">Parameters</A>
<LI><A HREF="#toc2">Nouns</A>
<UL>
<LI><A HREF="#toc3">Compound nouns</A>
<LI><A HREF="#toc4">Relational nouns</A>
<LI><A HREF="#toc5">Relational common noun phrases</A>
<LI><A HREF="#toc6">Proper names and noun phrases</A>
<LI><A HREF="#toc3">Relational nouns</A>
<LI><A HREF="#toc4">Relational common noun phrases</A>
<LI><A HREF="#toc5">Proper names and noun phrases</A>
</UL>
<LI><A HREF="#toc7">Adjectives</A>
<LI><A HREF="#toc6">Adjectives</A>
<UL>
<LI><A HREF="#toc8">Two-place adjectives</A>
<LI><A HREF="#toc9">Comparison adjectives</A>
<LI><A HREF="#toc7">Two-place adjectives</A>
</UL>
<LI><A HREF="#toc10">Adverbs</A>
<LI><A HREF="#toc11">Verbs</A>
<LI><A HREF="#toc8">Adverbs</A>
<LI><A HREF="#toc9">Verbs</A>
<UL>
<LI><A HREF="#toc12">Two-place verbs</A>
<LI><A HREF="#toc13">Three-place verbs</A>
<LI><A HREF="#toc14">Other complement patterns</A>
<LI><A HREF="#toc10">Two-place verbs</A>
<LI><A HREF="#toc11">Three-place verbs</A>
<LI><A HREF="#toc12">Other complement patterns</A>
</UL>
</UL>
@@ -132,11 +130,8 @@ The following prepositions also have special contracted forms.
<P></P>
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
Worst case: give both two forms and the gender.
</P>
<PRE>
mkN : (uomo,uomini : Str) -&gt; Gender -&gt; N ;
mkN : overload {
</PRE>
<P></P>
<P>
@@ -146,45 +141,45 @@ The heuristic says that the gender is feminine for nouns
ending with <I>a</I>, and masculine for all other words.
</P>
<PRE>
regN : Str -&gt; N ;
mkN : (cane : Str) -&gt; N ;
</PRE>
<P></P>
<P>
To force a different gender, use one of the following functions.
To force a different gender, give it explicitly.
</P>
<PRE>
mascN : N -&gt; N ;
femN : N -&gt; N ;
mkN : (carne : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<A NAME="toc3"></A>
<H3>Compound nouns</H3>
<P>
Some nouns are ones where the first part is inflected as a noun but
Worst case: give both two forms and the gender.
</P>
<PRE>
mkN : (uomo,uomini : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
In <B>compound nouns</B>, the first part is inflected as a noun but
the second part is not inflected. e.g. <I>numero di telefono</I>.
They could be formed in syntax, but we give a shortcut here since
they are frequent in lexica.
</P>
<PRE>
compN : N -&gt; Str -&gt; N ;
mkN : N -&gt; Str -&gt; N
} ;
</PRE>
<P></P>
<A NAME="toc4"></A>
<A NAME="toc3"></A>
<H3>Relational nouns</H3>
<P>
Relational nouns (<I>figlio di x</I>) need a case and a preposition.
The default is regular nouns with the genitive <I>di</I>.
</P>
<PRE>
mkN2 : N -&gt; Prep -&gt; N2 ;
</PRE>
<P></P>
<P>
The most common cases are the genitive <I>di</I> and the dative <I>a</I>,
with the empty preposition.
</P>
<PRE>
diN2 : N -&gt; N2 ;
aN2 : N -&gt; N2 ;
mkN2 : overload {
mkN2 : Str -&gt; N2 ;
mkN2 : N -&gt; Prep -&gt; N2
} ;
</PRE>
<P></P>
<P>
@@ -194,7 +189,7 @@ Three-place relational nouns (<I>la connessione di x a y</I>) need two prepositi
mkN3 : N -&gt; Prep -&gt; Prep -&gt; N3 ;
</PRE>
<P></P>
<A NAME="toc5"></A>
<A NAME="toc4"></A>
<H3>Relational common noun phrases</H3>
<P>
In some cases, you may want to make a complex <CODE>CN</CODE> into a
@@ -202,53 +197,62 @@ relational noun (e.g. <I>la vecchia chiesa di</I>). However, <CODE>N2</CODE> and
<CODE>N3</CODE> are purely lexical categories. But you can use the <CODE>AdvCN</CODE>
and <CODE>PrepNP</CODE> constructions to build phrases like this.
</P>
<A NAME="toc6"></A>
<A NAME="toc5"></A>
<H3>Proper names and noun phrases</H3>
<P>
Proper names need a string and a gender.
Proper names need a string and a gender. The gender is by default feminine if
the name ends with an <I>a</I>, and masculine otherwise.
</P>
<PRE>
mkPN : Str -&gt; Gender -&gt; PN ;
regPN : Str -&gt; PN ; -- feminine if "-a", otherwise masculine
mkPN : overload {
mkPN : Str -&gt; PN ;
mkPN : Str -&gt; Gender -&gt; PN
} ;
</PRE>
<P></P>
<P>
To form a noun phrase that can also be plural,
you can use the worst-case function.
</P>
<PRE>
mkNP : Str -&gt; Gender -&gt; Number -&gt; NP ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<A NAME="toc6"></A>
<H2>Adjectives</H2>
<P>
Non-comparison one-place adjectives need five forms in the worst
case (masc and fem singular, masc plural, adverbial).
</P>
<PRE>
mkA : (solo,sola,soli,sole, solamente : Str) -&gt; A ;
mkA : overload {
</PRE>
<P></P>
<P>
For regular adjectives, all other forms are derived from the
masculine singular.
For regular adjectives, all forms are derived from the
masculine singular. Comparison is formed by <I>più</I>.
</P>
<PRE>
regA : Str -&gt; A ;
mkA : (bianco : Str) -&gt; A ;
</PRE>
<P></P>
<P>
These functions create postfix adjectives. To switch
Five forms are needed in the worst
case (masc and fem singular, masc plural, adverbial), given that
comparison is formed by <I>più</I>.
</P>
<PRE>
mkA : (solo,sola,soli,sole,solamente : Str) -&gt; A ;
</PRE>
<P></P>
<P>
With irregular comparison, there are as it were two adjectives:
the positive (<I>buono</I>) and the comparative (<I>migliore</I>).
</P>
<PRE>
mkA : A -&gt; A -&gt; A
} ;
</PRE>
<P></P>
<P>
All the functions above create postfix adjectives. To switch
them to prefix ones (i.e. ones placed before the noun in
modification, as in <I>vecchia chiesa</I>), the following function is
provided.
</P>
<PRE>
prefA : A -&gt; A ;
prefixA : A -&gt; A = prefA ;
</PRE>
<P></P>
<A NAME="toc8"></A>
<A NAME="toc7"></A>
<H3>Two-place adjectives</H3>
<P>
Two-place adjectives need a preposition for their second argument.
@@ -257,33 +261,7 @@ Two-place adjectives need a preposition for their second argument.
mkA2 : A -&gt; Prep -&gt; A2 ;
</PRE>
<P></P>
<A NAME="toc9"></A>
<H3>Comparison adjectives</H3>
<P>
Comparison adjectives are in the worst case put up from two
adjectives: the positive (<I>buono</I>), and the comparative (<I>migliore</I>).
</P>
<PRE>
mkADeg : A -&gt; A -&gt; A ;
</PRE>
<P></P>
<P>
If comparison is formed by <I>più</I>, as usual in Italian,
the following pattern is used:
</P>
<PRE>
compADeg : A -&gt; A ;
</PRE>
<P></P>
<P>
The regular pattern is the same as <CODE>regA</CODE> for plain adjectives,
with comparison by <I>più</I>.
</P>
<PRE>
regADeg : Str -&gt; A ;
</PRE>
<P></P>
<A NAME="toc10"></A>
<A NAME="toc8"></A>
<H2>Adverbs</H2>
<P>
Adverbs are not inflected. Most lexical ones have position
@@ -307,8 +285,12 @@ Adverbs modifying adjectives and sentences can also be formed.
mkAdA : Str -&gt; AdA ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<A NAME="toc9"></A>
<H2>Verbs</H2>
<PRE>
mkV : overload {
</PRE>
<P></P>
<P>
Regular verbs are ones with the infinitive <I>are</I> or <I>ire</I>, the
latter with singular present indicative forms as <I>finisco</I>.
@@ -317,7 +299,7 @@ these endings, as well as the variations among
<I>amare, cominciare, mangiare, legare, cercare</I>.
</P>
<PRE>
regV : Str -&gt; V ;
mkV : Str -&gt; V ;
</PRE>
<P></P>
<P>
@@ -325,7 +307,17 @@ The module <CODE>BeschIta</CODE> gives (almost) all the patterns of the <I>Besch
book. To use them in the category <CODE>V</CODE>, wrap them with the function
</P>
<PRE>
verboV : Verbo -&gt; V ;
mkV : Verbo -&gt; V ;
</PRE>
<P></P>
<P>
If <CODE>BeschIta</CODE> does not give the desired result or feels difficult
to consult, here is a worst-case function for <I>-ire</I> and <I>-ere</I> verbs,
taking 11 arguments.
</P>
<PRE>
mkV : (udire,odo,ode,udiamo,udiro,udii,udisti,udi,udirono,odi,udito : Str) -&gt; V
} ;
</PRE>
<P></P>
<P>
@@ -338,26 +330,18 @@ Reflexive implies <I>essere</I>.
reflV : V -&gt; V ;
</PRE>
<P></P>
<P>
If <CODE>BeschIta</CODE> does not give the desired result or feels difficult
to consult, here is a worst-case function for <I>-ire</I> and <I>-ere</I> verbs,
taking 11 arguments.
</P>
<PRE>
mkV :
(udire,odo,ode,udiamo,udiro,udii,udisti,udi,udirono,odi,udito : Str) -&gt; V ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<A NAME="toc10"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, except the special case with direct object.
(transitive verbs). Notice that a particle comes from the <CODE>V</CODE>.
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
mkV2 : overload {
mkV2 : Str -&gt; V2 ;
mkV2 : V -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2
} ;
</PRE>
<P></P>
<P>
@@ -367,7 +351,7 @@ You can reuse a <CODE>V2</CODE> verb in <CODE>V</CODE>.
v2V : V2 -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<A NAME="toc11"></A>
<H3>Three-place verbs</H3>
<P>
Three-place (ditransitive) verbs need two prepositions, of which
@@ -379,7 +363,7 @@ the first one or both can be absent.
dirdirV3 : V -&gt; V3 ; -- dare,_,_
</PRE>
<P></P>
<A NAME="toc14"></A>
<A NAME="toc12"></A>
<H3>Other complement patterns</H3>
<P>
Verbs and adjectives can take complements such as sentences,
@@ -416,6 +400,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc italian/ParadigmsIta.txt -->
</BODY></HTML>

169
lib/resource-1.0/doc/gfdoc/ParadigmsNor.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Norwegian Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2007-07-06 10:10:01 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -28,8 +28,8 @@
<LI><A HREF="#toc9">Adverbs</A>
<LI><A HREF="#toc10">Verbs</A>
<UL>
<LI><A HREF="#toc11">Verbs with 'være' as auxiliary</A>
<LI><A HREF="#toc12">Verbs with a particle.</A>
<LI><A HREF="#toc11">Verbs with a particle.</A>
<LI><A HREF="#toc12">Verbs with 'være' as auxiliary</A>
<LI><A HREF="#toc13">Deponent verbs.</A>
<LI><A HREF="#toc14">Two-place verbs</A>
<LI><A HREF="#toc15">Three-place verbs</A>
@@ -129,37 +129,24 @@ Prepositions used in many-argument functions are just strings.
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
Worst case: give all four forms. The gender is computed from the
last letter of the second form (if <I>n</I>, then <CODE>utrum</CODE>, otherwise <CODE>neutrum</CODE>).
</P>
<PRE>
mkN : (dreng,drengen,drenger,drengene : Str) -&gt; N ;
</PRE>
<P></P>
<P>
The regular function takes the singular indefinite form
and computes the other forms and the gender by a heuristic.
The heuristic is that nouns ending <I>e</I> are feminine like <I>kvinne</I>,
all others are masculine like <I>bil</I>.
If in doubt, use the <CODE>cc</CODE> command to test!
</P>
<PRE>
regN : Str -&gt; N ;
</PRE>
<P></P>
<P>
Giving gender manually makes the heuristic more reliable.
</P>
<PRE>
regGenN : Str -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
This function takes the singular indefinite and definite forms; the
One can also compute the gender from the definite form.
gender is computed from the definite form.
If in doubt, use the <CODE>cc</CODE> command to test!
In the worst case, give all four forms. The gender is computed from the
last letter of the second form (if <I>n</I>, then <CODE>utrum</CODE>, otherwise <CODE>neutrum</CODE>).
</P>
<PRE>
mk2N : (bil,bilen : Str) -&gt; N ;
mkN : overload {
mkN : Str -&gt; N ;
mkN : Str -&gt; Gender -&gt; N ;
mkN : (bil,bilen : Str) -&gt; N ;
mkN : (dreng,drengen,drenger,drengene : Str) -&gt; N
} ;
</PRE>
<P></P>
<A NAME="toc3"></A>
@@ -209,48 +196,37 @@ and <CODE>PrepNP</CODE> constructions to build phrases like this.
<H3>Proper names and noun phrases</H3>
<P>
Proper names, with a regular genitive, are formed as follows
</P>
<PRE>
regPN : Str -&gt; PN ; -- utrum
regGenPN : Str -&gt; Gender -&gt; PN ;
</PRE>
<P></P>
<P>
Sometimes you can reuse a common noun as a proper name, e.g. <I>Bank</I>.
</P>
<PRE>
nounPN : N -&gt; PN ;
</PRE>
<P></P>
<P>
To form a noun phrase that can also be plural and have an irregular
genitive, you can use the worst-case function.
</P>
<PRE>
mkNP : Str -&gt; Str -&gt; Number -&gt; Gender -&gt; NP ;
mkPN : overload {
mkPN : Str -&gt; PN ; -- masculine
mkPN : Str -&gt; Gender -&gt; PN ;
mkPN : N -&gt; PN ;
} ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<H2>Adjectives</H2>
<P>
Non-comparison one-place adjectives need three forms:
The regular pattern works for many adjectives, e.g. those ending
with <I>ig</I>. Two, five, or at worst five forms are sometimes needed.
</P>
<PRE>
mkA : (galen,galet,galne : Str) -&gt; A ;
mkA : overload {
mkA : (fin : Str) -&gt; A ;
mkA : (fin,fint : Str) -&gt; A ;
mkA : (galen,galet,galne : Str) -&gt; A ;
mkA : (stor,stort,store,storre,storst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
For regular adjectives, the other forms are derived.
If comparison is formed by <I>mer</I>, <I>mest</I>, as in general for
long adjective, the following pattern is used:
</P>
<PRE>
regA : Str -&gt; A ;
</PRE>
<P></P>
<P>
In most cases, two forms are enough.
</P>
<PRE>
mk2A : (stor,stort : Str) -&gt; A ;
mkA : A -&gt; A ; -- -/mer/mest norsk
} ;
</PRE>
<P></P>
<A NAME="toc8"></A>
@@ -262,44 +238,6 @@ Two-place adjectives need a preposition for their second argument.
mkA2 : A -&gt; Prep -&gt; A2 ;
</PRE>
<P></P>
<P>
Comparison adjectives may need as many as five forms.
</P>
<PRE>
mkADeg : (stor,stort,store,storre,storst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
The regular pattern works for many adjectives, e.g. those ending
with <I>ig</I>.
</P>
<PRE>
regADeg : Str -&gt; A ;
</PRE>
<P></P>
<P>
Just the comparison forms can be irregular.
</P>
<PRE>
irregADeg : (tung,tyngre,tyngst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Sometimes just the positive forms are irregular.
</P>
<PRE>
mk3ADeg : (galen,galet,galne : Str) -&gt; A ;
mk2ADeg : (bred,bredt : Str) -&gt; A ;
</PRE>
<P></P>
<P>
If comparison is formed by <I>mer</I>, <I>mest</I>, as in general for
long adjective, the following pattern is used:
</P>
<PRE>
compoundA : A -&gt; A ; -- -/mer/mest norsk
</PRE>
<P></P>
<A NAME="toc9"></A>
<H2>Adverbs</H2>
<P>
@@ -320,25 +258,22 @@ Adverbs modifying adjectives and sentences can also be formed.
<P></P>
<A NAME="toc10"></A>
<H2>Verbs</H2>
<P>
The worst case needs six forms.
</P>
<PRE>
mkV : (spise,spiser,spises,spiste,spist,spis : Str) -&gt; V ;
mkV : overload {
</PRE>
<P></P>
<P>
The 'regular verb' function is the first conjugation.
</P>
<PRE>
regV : (snakke : Str) -&gt; V ;
mkV : (snakke : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The almost regular verb function needs the infinitive and the preteritum.
</P>
<PRE>
mk2V : (leve,levde : Str) -&gt; V ;
mkV : (leve,levde : Str) -&gt; V ;
</PRE>
<P></P>
<P>
@@ -346,10 +281,27 @@ There is an extensive list of irregular verbs in the module <CODE>IrregNor</CODE
In practice, it is enough to give three forms, as in school books.
</P>
<PRE>
irregV : (drikke, drakk, drukket : Str) -&gt; V ;
mkV : (drikke, drakk, drukket : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The worst case needs six forms.
</P>
<PRE>
mkV : (spise,spiser,spises,spiste,spist,spis : Str) -&gt; V ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<H3>Verbs with a particle.</H3>
<P>
The particle, such as in <I>lukke opp</I>, is given as a string.
</P>
<PRE>
mkV : V -&gt; Str -&gt; V ;
} ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<H3>Verbs with 'være' as auxiliary</H3>
<P>
By default, the auxiliary is <I>have</I>. This function changes it to <I>være</I>.
@@ -358,15 +310,6 @@ By default, the auxiliary is <I>have</I>. This function changes it to <I>v
vaereV : V -&gt; V ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<H3>Verbs with a particle.</H3>
<P>
The particle, such as in <I>lukke opp</I>, is given as a string.
</P>
<PRE>
partV : V -&gt; Str -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<H3>Deponent verbs.</H3>
<P>
@@ -382,12 +325,14 @@ reflexive e.g. <I>forestille seg</I>.
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, except the special case with direct object.
(transitive verbs). Notice that a particle comes from the <CODE>V</CODE>.
(transitive verbs). Notice that, if a particle is needed, it comes from the <CODE>V</CODE>.
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
mkV2 : overload {
mkV2 : Str -&gt; V2 ;
mkV2 : V -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2 ;
} ;
</PRE>
<P></P>
<A NAME="toc15"></A>
@@ -437,6 +382,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc norwegian/ParadigmsNor.txt -->
</BODY></HTML>

130
lib/resource-1.0/doc/gfdoc/ParadigmsRus.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Russian Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2006-09-07 16:12:56 CEST</I><BR>
<I>Last update: 2007-07-06 10:39:50 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -18,6 +18,10 @@
<LI><A HREF="#toc3">Adjectives</A>
<LI><A HREF="#toc4">Adverbs</A>
<LI><A HREF="#toc5">Verbs</A>
<UL>
<LI><A HREF="#toc6">Two-place verbs</A>
<LI><A HREF="#toc7">Three-place verbs</A>
</UL>
</UL>
<P></P>
@@ -105,6 +109,11 @@ To abstract over number names, we define the following.
singular : Number ;
plural : Number ;
Animacy: Type ;
animate: Animacy;
inanimate: Animacy;
</PRE>
<P></P>
<A NAME="toc2"></A>
@@ -113,12 +122,22 @@ To abstract over number names, we define the following.
Best case: indeclinabe nouns: <I>кофе</I>, <I>пальто</I>, <I>ВУЗ</I>.
</P>
<PRE>
Animacy: Type ;
animate: Animacy;
inanimate: Animacy;
mkIndeclinableNoun: Str -&gt; Gender -&gt; Animacy -&gt; N ;
mkN : overload {
</PRE>
<P></P>
<P>
The regular function captures the variants for some popular nouns
endings below:
</P>
<PRE>
mkN : Str -&gt; N ;
</PRE>
<P></P>
<P>
This function is for indeclinable nouns.
</P>
<PRE>
mkN : Str -&gt; Gender -&gt; Animacy -&gt; N ;
</PRE>
<P></P>
<P>
@@ -132,19 +151,15 @@ to the Nominative or the Genetive one) is actually of no help,
since there are a lot of exceptions and the gain is just one form less.
</P>
<PRE>
mkN : (nomSg, genSg, datSg, accSg, instSg, preposSg,
nomPl, genPl, datPl, accPl, instPl, preposPl: Str) -&gt; Gender -&gt; Animacy -&gt; N ;
-- мужчина, мужчины, мужчине, мужчину, мужчиной, мужчине
-- мужчины, мужчин, мужчинам, мужчин, мужчинами, мужчинах
mkN : (nomSg,_,_,_,_,_,_,_,_,_,_,prepPl : Str) -&gt; Gender -&gt; Animacy -&gt; N ;
</PRE>
<P></P>
<P>
The regular function captures the variants for some popular nouns
endings below:
мужчина, мужчины, мужчине, мужчину, мужчиной, мужчине
мужчины, мужчин, мужчинам, мужчин, мужчинами, мужчинах
</P>
<PRE>
regN : Str -&gt; N ;
} ;
</PRE>
<P></P>
<P>
@@ -206,17 +221,11 @@ Nouns used as functions need a preposition. The most common is with Genitive.
Proper names.
</P>
<PRE>
mkPN : Str -&gt; Gender -&gt; Animacy -&gt; PN ; -- "Иван", "Маша"
nounPN : N -&gt; PN ;
</PRE>
<P></P>
<P>
On the top level, it is maybe <CODE>CN</CODE> that is used rather than <CODE>N</CODE>, and
<CODE>NP</CODE> rather than <CODE>PN</CODE>.
</P>
<PRE>
mkCN : N -&gt; CN ;
mkNP : Str -&gt; Gender -&gt; Animacy -&gt; NP ;
mkPN : overload {
mkPN : Str -&gt; PN ;
mkPN : Str -&gt; Gender -&gt; Animacy -&gt; PN ; -- "Иван", "Маша"
mkPN : N -&gt; PN ;
} ;
</PRE>
<P></P>
<A NAME="toc3"></A>
@@ -230,20 +239,16 @@ Instructive | Prepositional)
Instructive | Prepositional)
Notice that 4 short forms, which exist for some adjectives are not included
in the current description, otherwise there would be 32 forms for
positive degree.
positive degree.
The regular function captures the variants for some popular adjective
endings below. The first string agrument is the masculine singular form,
the second is comparative:
Invariable adjective is a special case, with only on string needed.
</P>
<PRE>
regA : Str -&gt; Str -&gt; A ;
</PRE>
<P></P>
<P>
Invariable adjective is a special case.
</P>
<PRE>
<PRE>
mkA : overload {
mkA : Str -&gt; A ; -- khaki, mini, hindi, netto
mkA : Str -&gt; Str -&gt; A ;
} ;
</PRE>
<P></P>
@@ -274,10 +279,6 @@ only one superlative form (syntactic) we can produce the
only one superlative form (syntactic) we can produce the
comparison adjective with only one extra argument -
non-syntactic comparative form.
Syntactic forms are based on the positive forms.
mkADeg : A -&gt; Str -&gt; ADeg ;
On top level, there are adjectival phrases. The most common case is
just to use a one-place adjective.
Syntactic forms are based on the positive forms.
</P>
<A NAME="toc4"></A>
@@ -322,20 +323,6 @@ Notice, that some forms are never used for some verbs.
perfective: Aspect ;
</PRE>
<P></P>
<P>
The worst case need 6 forms of the present tense in indicative mood
(<I>я бегу</I>, <I>ты бежишь</I>, <I>он бежит</I>, <I>мы бежим</I>, <I>вы бежите</I>, <I>они бегут</I>),
a past form (singular, masculine: <I>я бежал</I>), an imperative form
(singular, second person: <I>беги</I>), an infinitive (<I>бежать</I>).
Inherent aspect should also be specified.
mkVerbum : Aspect -&gt; (presentSgP1,presentSgP2,presentSgP3,
</P>
<PRE>
mkV : Aspect -&gt; (presentSgP1,presentSgP2,presentSgP3,
presentPlP1,presentPlP2,presentPlP3,
pastSgMasculine,imperative,infinitive: Str) -&gt; V ;
</PRE>
<P></P>
<P>
Common conjugation patterns are two conjugations:
first - verbs ending with <I>-ать/-ять</I> and second - <I>-ить/-еть</I>.
@@ -347,20 +334,45 @@ first person from with second person form:
<I>я люб-лю</I>, <I>ты люб-ишь</I>. Stems shoud be the same.
So the definition for verb <I>любить</I> looks like:
regV Imperfective Second <I>люб</I> <I>лю</I> <I>любил</I> <I>люби</I> <I>любить</I>;
</P>
<P>
There is no one-argument case.
</P>
<PRE>
regV :Aspect -&gt; Conjugation -&gt; (stemPresentSgP1,endingPresentSgP1,
<PRE>
mkV : overload {
mkV : Aspect -&gt; Conjugation -&gt; (stemPrsSgP1,endPrsSgP1,pastSgP1,imp,inf : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The worst case need 6 forms of the present tense in indicative mood
(<I>я бегу</I>, <I>ты бежишь</I>, <I>он бежит</I>, <I>мы бежим</I>, <I>вы бежите</I>, <I>они бегут</I>),
a past form (singular, masculine: <I>я бежал</I>), an imperative form
(singular, second person: <I>беги</I>), an infinitive (<I>бежать</I>).
Inherent aspect should also be specified.
</P>
<PRE>
mkV : Aspect -&gt; (presSgP1,presSgP2,presSgP3,presPlP1,presPlP2,presPlP3,pastSgMasc,imp,inf: Str) -&gt; V ;
} ;
</PRE>
<P></P>
<A NAME="toc6"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs, and the special case with direct object. Notice that
a particle can be included in a <CODE>V</CODE>.
</P>
<PRE>
mkV2 : V -&gt; Str -&gt; Case -&gt; V2 ; -- "войти в дом"; "в", accusative
mkV3 : V -&gt; Str -&gt; Str -&gt; Case -&gt; Case -&gt; V3 ; -- "сложить письмо в конверт"
<PRE>
mkV2 : overload {
mkV2 : V -&gt; V2 ; -- "видеть", "любить"
mkV2 : V -&gt; Str -&gt; Case -&gt; V2 ; -- "войти в дом"; "в", accusative
} ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<H3>Three-place verbs</H3>
<PRE>
tvDirDir : V -&gt; V3 ;
mkV3 : V -&gt; Str -&gt; Str -&gt; Case -&gt; Case -&gt; V3 ; -- "сложить письмо в конверт"
</PRE>
<P></P>
@@ -368,6 +380,6 @@ The definitions should not bother the user of the API. So they are
The definitions should not bother the user of the API. So they are
hidden from the document.
</P>
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc russian/ParadigmsRus.txt -->

152
lib/resource-1.0/doc/gfdoc/ParadigmsSpa.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Spanish Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2007-03-19 18:25:03 CET</I><BR>
<I>Last update: 2007-07-06 09:19:56 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -24,14 +24,13 @@
<LI><A HREF="#toc7">Adjectives</A>
<UL>
<LI><A HREF="#toc8">Two-place adjectives</A>
<LI><A HREF="#toc9">Comparison adjectives</A>
</UL>
<LI><A HREF="#toc10">Adverbs</A>
<LI><A HREF="#toc11">Verbs</A>
<LI><A HREF="#toc9">Adverbs</A>
<LI><A HREF="#toc10">Verbs</A>
<UL>
<LI><A HREF="#toc12">Two-place verbs</A>
<LI><A HREF="#toc13">Three-place verbs</A>
<LI><A HREF="#toc14">Other complement patterns</A>
<LI><A HREF="#toc11">Two-place verbs</A>
<LI><A HREF="#toc12">Three-place verbs</A>
<LI><A HREF="#toc13">Other complement patterns</A>
</UL>
</UL>
@@ -124,12 +123,8 @@ amalgamate with the following word (the 'genitive' <I>de</I> and the
<P></P>
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
Worst case: two forms (singular + plural),
and the gender.
</P>
<PRE>
mkN : (_,_ : Str) -&gt; Gender -&gt; N ; -- bastón, bastones, masculine
mkN : overload {
</PRE>
<P></P>
<P>
@@ -142,15 +137,22 @@ those ending with <I>z</I> have <I>ces</I> in plural; all other nouns
have <I>es</I> as plural ending. The accent is not dealt with.
</P>
<PRE>
regN : Str -&gt; N ;
mkN : (luz : Str) -&gt; N ;
</PRE>
<P></P>
<P>
To force a different gender, use one of the following functions.
A different gender can be forced.
</P>
<PRE>
mascN : N -&gt; N ;
femN : N -&gt; N ;
mkN : Str -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
The worst case has two forms (singular + plural) and the gender.
</P>
<PRE>
mkN : (baston,bastones : Str) -&gt; Gender -&gt; N
} ;
</PRE>
<P></P>
<A NAME="toc3"></A>
@@ -202,47 +204,55 @@ and <CODE>PrepNP</CODE> constructions to build phrases like this.
<H3>Proper names and noun phrases</H3>
<P>
Proper names need a string and a gender.
The default gender is feminine for names ending with <I>a</I>, otherwise masculine.
</P>
<PRE>
mkPN : Str -&gt; Gender -&gt; PN ; -- Juan
regPN : Str -&gt; PN ; -- feminine for "-a", otherwise masculine
</PRE>
<P></P>
<P>
To form a noun phrase that can also be plural,
you can use the worst-case function.
</P>
<PRE>
mkNP : Str -&gt; Gender -&gt; Number -&gt; NP ;
mkPN : overload {
mkPN : (Anna : Str) -&gt; PN ;
mkPN : (Pilar : Str) -&gt; Gender -&gt; PN
} ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<H2>Adjectives</H2>
<PRE>
mkA : overload {
</PRE>
<P></P>
<P>
Non-comparison one-place adjectives need five forms in the worst
For regular adjectives, all forms are derived from the
masculine singular. The types of adjectives that are recognized are
<I>alto</I>, <I>fuerte</I>, <I>util</I>. Comparison is formed by <I>mas</I>.
</P>
<PRE>
mkA : (util : Str) -&gt; A ;
</PRE>
<P></P>
<P>
One-place adjectives compared with <I>mas</I> need five forms in the worst
case (masc and fem singular, masc plural, adverbial).
</P>
<PRE>
mkA : (solo,sola,solos,solas, solamiento : Str) -&gt; A ;
mkA : (solo,sola,solos,solas,solamiento : Str) -&gt; A ;
</PRE>
<P></P>
<P>
For regular adjectives, all other forms are derived from the
masculine singular. The types of adjectives that are recognized are
<I>alto</I>, <I>fuerte</I>, <I>util</I>.
In the worst case, two separate adjectives are given:
the positive (<I>bueno</I>), and the comparative (<I>mejor</I>).
</P>
<PRE>
regA : Str -&gt; A ;
mkA : (bueno : A) -&gt; (mejor : A) -&gt; A
} ;
</PRE>
<P></P>
<P>
These functions create postfix adjectives. To switch
The functions above create postfix adjectives. To switch
them to prefix ones (i.e. ones placed before the noun in
modification, as in <I>bueno vino</I>), the following function is
provided.
</P>
<PRE>
prefA : A -&gt; A ;
prefixA : A -&gt; A ;
</PRE>
<P></P>
<A NAME="toc8"></A>
@@ -255,32 +265,6 @@ Two-place adjectives need a preposition for their second argument.
</PRE>
<P></P>
<A NAME="toc9"></A>
<H3>Comparison adjectives</H3>
<P>
Comparison adjectives are in the worst case put up from two
adjectives: the positive (<I>bueno</I>), and the comparative (<I>mejor</I>).
</P>
<PRE>
mkADeg : A -&gt; A -&gt; A ;
</PRE>
<P></P>
<P>
If comparison is formed by <I>mas</I>, as usual in Spanish,
the following pattern is used:
</P>
<PRE>
compADeg : A -&gt; A ;
</PRE>
<P></P>
<P>
The regular pattern is the same as <CODE>regA</CODE> for plain adjectives,
with comparison by <I>mas</I>.
</P>
<PRE>
regADeg : Str -&gt; A ;
</PRE>
<P></P>
<A NAME="toc10"></A>
<H2>Adverbs</H2>
<P>
Adverbs are not inflected. Most lexical ones have position
@@ -304,8 +288,12 @@ Adverbs modifying adjectives and sentences can also be formed.
mkAdA : Str -&gt; AdA ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<A NAME="toc10"></A>
<H2>Verbs</H2>
<PRE>
mkV : overload {
</PRE>
<P></P>
<P>
Regular verbs are ones inflected like <I>cortar</I>, <I>deber</I>, or <I>vivir</I>.
The regular verb function is the first conjugation (<I>ar</I>) recognizes
@@ -314,15 +302,25 @@ the variations corresponding to the patterns
the complete set of <I>Bescherelle</I> conjugations.
</P>
<PRE>
regV : Str -&gt; V ;
mkV : (pagar : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The module <CODE>BeschSpa</CODE> gives all the patterns of the <I>Bescherelle</I>
Verbs with vowel alternatition in the stem - easiest to give with
two forms, e.g. <I>mostrar///</I>muestro//.
</P>
<PRE>
mkV : (mostrar,muestro : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Most irreguler verbs are found in <CODE>IrregSpa</CODE>. If this is not enough,
the module <CODE>BeschSpa</CODE> gives all the patterns of the <I>Bescherelle</I>
book. To use them in the category <CODE>V</CODE>, wrap them with the function
</P>
<PRE>
verboV : Verbum -&gt; V ;
mkV : Verbum -&gt; V
} ;
</PRE>
<P></P>
<P>
@@ -340,24 +338,18 @@ in masculine singular form as second argument.
special_ppV : V -&gt; Str -&gt; V ;
</PRE>
<P></P>
<P>
Verbs with vowel alternatition in the stem - easiest to give with
two forms, e.g. <I>mostrar///</I>muestro//.
</P>
<PRE>
regAltV : (mostrar,muestro : Str) -&gt; V ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<A NAME="toc11"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, except the special case with direct object.
(transitive verbs). Notice that a particle comes from the <CODE>V</CODE>.
(transitive verbs).
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
mkV2 : overload {
mkV2 : Str -&gt; V2 ;
mkV2 : V -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2
} ;
</PRE>
<P></P>
<P>
@@ -367,7 +359,7 @@ You can reuse a <CODE>V2</CODE> verb in <CODE>V</CODE>.
v2V : V2 -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<A NAME="toc12"></A>
<H3>Three-place verbs</H3>
<P>
Three-place (ditransitive) verbs need two prepositions, of which
@@ -379,7 +371,7 @@ the first one or both can be absent.
dirdirV3 : V -&gt; V3 ; -- dar,(dative),(accusative)
</PRE>
<P></P>
<A NAME="toc14"></A>
<A NAME="toc13"></A>
<H3>Other complement patterns</H3>
<P>
Verbs and adjectives can take complements such as sentences,
@@ -416,6 +408,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc spanish/ParadigmsSpa.txt -->
</BODY></HTML>

229
lib/resource-1.0/doc/gfdoc/ParadigmsSwe.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Swedish Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2007-03-06 17:30:03 CET</I><BR>
<I>Last update: 2007-07-06 09:20:11 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -16,23 +16,21 @@
<LI><A HREF="#toc1">Parameters</A>
<LI><A HREF="#toc2">Nouns</A>
<UL>
<LI><A HREF="#toc3">Compound nouns</A>
<LI><A HREF="#toc4">Relational nouns</A>
<LI><A HREF="#toc5">Relational common noun phrases</A>
<LI><A HREF="#toc6">Proper names and noun phrases</A>
<LI><A HREF="#toc3">Relational nouns</A>
<LI><A HREF="#toc4">Relational common noun phrases</A>
<LI><A HREF="#toc5">Proper names and noun phrases</A>
</UL>
<LI><A HREF="#toc7">Adjectives</A>
<LI><A HREF="#toc6">Adjectives</A>
<UL>
<LI><A HREF="#toc8">Two-place adjectives</A>
<LI><A HREF="#toc7">Two-place adjectives</A>
</UL>
<LI><A HREF="#toc9">Adverbs</A>
<LI><A HREF="#toc10">Verbs</A>
<LI><A HREF="#toc8">Adverbs</A>
<LI><A HREF="#toc9">Verbs</A>
<UL>
<LI><A HREF="#toc11">Verbs with a particle.</A>
<LI><A HREF="#toc12">Deponent verbs.</A>
<LI><A HREF="#toc13">Two-place verbs</A>
<LI><A HREF="#toc14">Three-place verbs</A>
<LI><A HREF="#toc15">Other complement patterns</A>
<LI><A HREF="#toc10">Deponent verbs.</A>
<LI><A HREF="#toc11">Two-place verbs</A>
<LI><A HREF="#toc12">Three-place verbs</A>
<LI><A HREF="#toc13">Other complement patterns</A>
</UL>
</UL>
@@ -116,7 +114,7 @@ To abstract over case names, we define the following.
</PRE>
<P></P>
<P>
Prepositions used in many-argument functions are just strings.
Prepositions used in many-argument functions can be constructed from strings.
</P>
<PRE>
mkPrep : Str -&gt; Prep ;
@@ -126,74 +124,66 @@ Prepositions used in many-argument functions are just strings.
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
Worst case: give all four forms. The gender is computed from the
last letter of the second form (if <I>n</I>, then <CODE>utrum</CODE>, otherwise <CODE>neutrum</CODE>).
The following overloaded paradigm takes care of all noun formation.
</P>
<PRE>
mkN : (apa,apan,apor,aporna : Str) -&gt; N ;
mkN : overload {
</PRE>
<P></P>
<P>
The regular function takes the singular indefinite form and computes the other
forms and the gender by a heuristic. The heuristic is currently
to treat all words ending with <I>a</I> like <I>flicka</I>, with <I>e</I> like <I>rike</I>,
and otherwise like <I>bil</I>.
If in doubt, use the <CODE>cc</CODE> command to test!
The one-argument case takes the singular indefinite form and computes
the other forms and the gender by a simple heuristic. The heuristic is currently
to treat all words ending with <I>a</I> like <I>apa-apor</I>, with <I>e</I> like <I>rike-riken</I>,
and otherwise like <I>bil-bilar</I>.
</P>
<PRE>
regN : Str -&gt; N ;
mkN : (apa : Str) -&gt; N ;
</PRE>
<P></P>
<P>
Adding the gender manually greatly improves the correction of <CODE>regN</CODE>.
The case with a string and gender makes it possible to treat
<I>lik</I> (neutrum) and <I>pojke</I> (utrum).
</P>
<PRE>
regGenN : Str -&gt; Gender -&gt; N ;
mkN : (lik : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
In practice the worst case is often just: give singular and plural indefinite.
Giving two forms - the singular and plural indefinite - is sufficient for
most nouns. The paradigm deals correctly with the vowel contractions in
<I>nyckel - nycklar</I> such as <I>pojke - pojkar</I>.
</P>
<PRE>
mk2N : (nyckel,nycklar : Str) -&gt; N ;
mkN : (nyckel,nycklar : Str) -&gt; N ;
</PRE>
<P></P>
<P>
This heuristic takes just the plural definite form and infers the others.
It does not work if there are changes in the stem.
In the worst case, four forms are needed.
</P>
<PRE>
mk1N : (bilarna : Str) -&gt; N ;
mkN : (museum,museet,museer,museerna : Str) -&gt; N
} ;
</PRE>
<P></P>
<A NAME="toc3"></A>
<H3>Compound nouns</H3>
<P>
All the functions above work quite as well to form compound nouns,
All the functions above work quite as well to form <B>compound nouns</B>,
such as <I>fotboll</I>.
</P>
<A NAME="toc4"></A>
<A NAME="toc3"></A>
<H3>Relational nouns</H3>
<P>
Relational nouns (<I>dotter till x</I>) need a preposition.
Relational nouns (<I>kung av x</I>) are nouns with a preposition.
As a special case, we provide regular nouns (formed with one-argument <CODE>mkN</CODE>)
with the preposition <I>av</I>.
</P>
<PRE>
mkN2 : N -&gt; Prep -&gt; N2 ;
mkN2 : overload {
mkN2 : Str -&gt; N2 ;
mkN2 : N -&gt; Prep -&gt; N2
} ;
</PRE>
<P></P>
<P>
The most common preposition is <I>av</I>, and the following is a
shortcut for regular, <CODE>nonhuman</CODE> relational nouns with <I>av</I>.
</P>
<PRE>
regN2 : Str -&gt; Gender -&gt; N2 ;
</PRE>
<P></P>
<P>
Use the function <CODE>mkPreposition</CODE> or see the section on prepositions below to
form other prepositions.
</P>
<P>
Three-place relational nouns (<I>förbindelse från x till y</I>)
need two prepositions.
</P>
@@ -201,7 +191,7 @@ need two prepositions.
mkN3 : N -&gt; Prep -&gt; Prep -&gt; N3 ;
</PRE>
<P></P>
<A NAME="toc5"></A>
<A NAME="toc4"></A>
<H3>Relational common noun phrases</H3>
<P>
In some cases, you may want to make a complex <CODE>CN</CODE> into a
@@ -209,71 +199,82 @@ relational noun (e.g. <I>den f
<CODE>N3</CODE> are purely lexical categories. But you can use the <CODE>AdvCN</CODE>
and <CODE>PrepNP</CODE> constructions to build phrases like this.
</P>
<A NAME="toc6"></A>
<A NAME="toc5"></A>
<H3>Proper names and noun phrases</H3>
<P>
Proper names, with a regular genitive, are formed as follows
Proper names, with a regular genitive, are formed from strings and
have the default gender utrum.
</P>
<PRE>
regGenPN : Str -&gt; Gender -&gt; PN ;
regPN : Str -&gt; PN ; -- utrum
mkPN : overload {
mkPN : Str -&gt; PN ;
mkPN : Str -&gt; Gender -&gt; PN ;
</PRE>
<P></P>
<P>
Sometimes you can reuse a common noun as a proper name, e.g. <I>Bank</I>.
In the worst case, the genitive form is irregular.
</P>
<PRE>
nounPN : N -&gt; PN ;
mkPN : (jesus,jesu : Str) -&gt; Gender -&gt; PN
} ;
</PRE>
<P></P>
<P>
To form a noun phrase that can also be plural and have an irregular
genitive, you can use the worst-case function.
</P>
<PRE>
mkNP : Str -&gt; Str -&gt; Number -&gt; Gender -&gt; NP ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<A NAME="toc6"></A>
<H2>Adjectives</H2>
<P>
Adjectives may need as many as seven forms.
Adjectives need one to seven forms.
</P>
<PRE>
mkA : (liten, litet, lilla, sma, mindre, minst, minsta : Str) -&gt; A ;
mkA : overload {
</PRE>
<P></P>
<P>
The regular pattern works for many adjectives, e.g. those ending
with <I>ig</I>.
Most adjectives are formed simply by adding endings to a stem.
</P>
<PRE>
regA : Str -&gt; A ;
mkA : (billig : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Just the comparison forms can be irregular.
Some adjectives have a deviant neuter form. The following pattern
also recognizes the neuter formation <I>galen-galet</I> and forms the
proper plural and comparison forms <I>galna-galnare-galnast</I>.
</P>
<PRE>
irregA : (tung,tyngre,tyngst : Str) -&gt; A ;
mkA : (bred,brett : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Sometimes just the positive forms are irregular.
Umlaut in comparison forms is
</P>
<PRE>
mk3A : (galen,galet,galna : Str) -&gt; A ;
mk2A : (bred,brett : Str) -&gt; A ;
mkA : (tung,tyngre,tyngst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Comparison forms may be compound (<I>mera svensk</I> - <I>mest svensk</I>).
A few adjectives need 5 forms.
</P>
<PRE>
mkA : (god,gott,goda,battre,bast : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Hardly any other adjective than <I>liten</I> needs the full 7 forms.
</P>
<PRE>
mkA : (liten,litet,lilla,sma,mindre,minst,minsta : Str) -&gt; A
} ;
</PRE>
<P></P>
<P>
Comparison forms may be compound (<I>mera svensk</I> - <I>mest svensk</I>);
this behaviour can be forced on any adjective.
</P>
<PRE>
compoundA : A -&gt; A ;
</PRE>
<P></P>
<A NAME="toc8"></A>
<A NAME="toc7"></A>
<H3>Two-place adjectives</H3>
<P>
Two-place adjectives need a preposition for their second argument.
@@ -282,7 +283,7 @@ Two-place adjectives need a preposition for their second argument.
mkA2 : A -&gt; Prep -&gt; A2 ;
</PRE>
<P></P>
<A NAME="toc9"></A>
<A NAME="toc8"></A>
<H2>Adverbs</H2>
<P>
Adverbs are not inflected. Most lexical ones have position
@@ -301,89 +302,97 @@ Adverbs modifying adjectives and sentences can also be formed.
mkAdA : Str -&gt; AdA ;
</PRE>
<P></P>
<A NAME="toc10"></A>
<A NAME="toc9"></A>
<H2>Verbs</H2>
<P>
The worst case needs five forms.
All verbs can be defined by the overloaded paradigm <CODE>mkV</CODE>.
</P>
<PRE>
mkV : (supa,super,sup,söp,supit,supen : Str) -&gt; V ;
mkV : overload {
</PRE>
<P></P>
<P>
The 'regular verb' function is inspired by Lexin. It uses the
The 'regular verb' (= one-place) case is inspired by Lexin. It uses the
present tense indicative form. The value is the first conjugation if the
argument ends with <I>ar</I> (<I>tala</I> - <I>talar</I> - <I>talade</I> - <I>talat</I>),
the second with <I>er</I> (<I>leka</I> - <I>leker</I> - <I>lekte</I> - <I>lekt</I>, with the
variations like <I>gräva</I>, <I>vända</I>, <I>tyda</I>, <I>hyra</I>), and
variations like in <I>gräva</I>, <I>vända</I>, <I>tyda</I>, <I>hyra</I>), and
the third in other cases (<I>bo</I> - <I>bor</I> - <I>bodde</I> - <I>bott</I>).
It is also possible to give the infinite form to it; they are treated
as if they were implicitly suffixed by <I>r</I>. Moreover, deponent verbs
are recognized from the final <I>s</I> (<I>hoppas</I>).
</P>
<PRE>
regV : (talar : Str) -&gt; V ;
mkV : (stämmer : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The almost regular verb function needs the infinitive and the preteritum.
It is not really more powerful than the new implementation of
<CODE>regV</CODE> based on the indicative form.
Most irregular verbs need just the conventional three forms.
</P>
<PRE>
mk2V : (leka,lekte : Str) -&gt; V ;
mkV : (dricka,drack,druckit : Str) -&gt; V ;
</PRE>
<P></P>
<P>
There is an extensive list of irregular verbs in the module <CODE>IrregSwe</CODE>.
In practice, it is enough to give three forms, as in school books.
In the worst case, six forms are given.
</P>
<PRE>
irregV : (dricka, drack, druckit : Str) -&gt; V ;
mkV : (gå,går,gå,gick,gått,gången : Str) -&gt; V ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<H3>Verbs with a particle.</H3>
<P>
The particle, such as in <I>passa på</I>, is given as a string.
Particle verbs, such as <I>passa på</I>, are formed by adding a string to a verb.
</P>
<PRE>
partV : V -&gt; Str -&gt; V ;
mkV : V -&gt; Str -&gt; V
} ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<A NAME="toc10"></A>
<H3>Deponent verbs.</H3>
<P>
Some words are used in passive forms only, e.g. <I>hoppas</I>, some as
reflexive e.g. <I>ångra sig</I>.
reflexive e.g. <I>ångra sig</I>. Regular deponent verbs are also
handled by <CODE>mkV</CODE> and recognized from the ending <I>s</I>.
</P>
<PRE>
depV : V -&gt; V ;
reflV : V -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<A NAME="toc11"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, except the special case with direct object.
(transitive verbs). Notice that a particle comes from the <CODE>V</CODE>.
Two-place verbs need a preposition, which default to the 'empty preposition'
i.e. direct object. (transitive verbs). The simplest case is a regular
verb (as in <CODE>mkV</CODE>) with a direct object.
Notice that, if a particle is needed, it comes from the <CODE>V</CODE>.
</P>
<PRE>
mkV2 : V -&gt; Prep -&gt; V2 ;
dirV2 : V -&gt; V2 ;
mkV2 : overload {
mkV2 : Str -&gt; V2 ;
mkV2 : V -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2
} ;
</PRE>
<P></P>
<A NAME="toc14"></A>
<A NAME="toc12"></A>
<H3>Three-place verbs</H3>
<P>
Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
the first one or both can be absent. The simplest case is a regular
verb (as in <CODE>mkV</CODE>) with no prepositions.
</P>
<PRE>
mkV3 : V -&gt; Prep -&gt; Prep -&gt; V3 ; -- tala, med, om
dirV3 : V -&gt; Prep -&gt; V3 ; -- ge, (acc),till
dirdirV3 : V -&gt; V3 ; -- ge, (dat), (acc)
mkV3 : overload {
mkV3 : Str -&gt; V3 ;
mkV3 : V -&gt; V3 ;
mkV3 : V -&gt; Prep -&gt; V3 ;
mkV3 : V -&gt; Prep -&gt; Prep -&gt; V3
} ;
</PRE>
<P></P>
<A NAME="toc15"></A>
<A NAME="toc13"></A>
<H3>Other complement patterns</H3>
<P>
Verbs and adjectives can take complements such as sentences,
@@ -418,6 +427,6 @@ as an adverb. Likewise <CODE>AS, A2S, AV, A2V</CODE> are just <CODE>A</CODE>.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc swedish/ParadigmsSwe.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Phrase.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Phrase: Phrases and Utterances</H1>
<FONT SIZE="4">
<I>Last update: 2006-12-15 17:11:19 CET</I><BR>
<I>Last update: 2006-12-13 09:36:48 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -81,6 +81,6 @@ which may be overgenerating (e.g. <I>I</I>).
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Phrase.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Precedence.html
View File

@@ -13,7 +13,7 @@
<HR NOSHADE SIZE=1>
<P></P>
<P>
Last update: 2006-03-03 17:05:26 CET
Last update: 2005-11-23 09:16:18 CET
</P>
<P>
Produced by
@@ -175,6 +175,6 @@ make a string a into non/left/right -associative infix operator, of precedence p
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc ../prelude/Precedence.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Predef.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Predefined functions for concrete syntax</H1>
<FONT SIZE="4">
<I>Last update: 2006-09-05 15:15:35 CEST</I><BR>
<I>Last update: 2006-09-01 16:37:08 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -62,6 +62,6 @@ This type of booleans is for internal use only.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc ../prelude/Predef.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/PredefAbs.html
View File

@@ -13,7 +13,7 @@
<HR NOSHADE SIZE=1>
<P></P>
<P>
Last update: 2006-06-16 07:46:47 CEST
Last update: 2006-06-02 17:49:44 CEST
</P>
<P>
Produced by
@@ -27,6 +27,6 @@ gfdoc - a rudimentary GF document generator.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc ../prelude/PredefAbs.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Predication.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> A Small Predication Library</H1>
<FONT SIZE="4">
<I>Last update: 2006-03-03 17:06:11 CET</I><BR>
<I>Last update: 2006-02-28 09:26:58 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -108,6 +108,6 @@ This is similar to a family except that the argument is a type.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc mathematical/Predication.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Prelude.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> The GF Prelude</H1>
<FONT SIZE="4">
<I>Last update: 2006-03-03 17:06:11 CET</I><BR>
<I>Last update: 2006-02-27 09:41:31 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -217,6 +217,6 @@ Zero, one, two, or more (elements in a list etc)
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc ../prelude/Prelude.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Question.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Question: Questions and Interrogative Pronouns</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2006-06-26 13:24:17 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -59,6 +59,6 @@ More <CODE>IP</CODE>, <CODE>IDet</CODE>, and <CODE>IAdv</CODE> are defined in
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Question.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Relative.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Relative clauses and pronouns</H1>
<FONT SIZE="4">
<I>Last update: 2006-07-02 00:15:01 CEST</I><BR>
<I>Last update: 2006-06-26 13:24:17 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -56,6 +56,6 @@ or suffixing (depending on language) prepositional phrases.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Relative.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Sentence.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Sentence: Sentences, Clauses, and Imperatives</H1>
<FONT SIZE="4">
<I>Last update: 2007-01-08 17:30:04 CET</I><BR>
<I>Last update: 2006-12-18 16:59:02 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -119,6 +119,6 @@ An adverb can be added to the beginning of a sentence.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Sentence.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Structural.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Structural: Structural Words</H1>
<FONT SIZE="4">
<I>Last update: 2006-12-01 13:43:01 CET</I><BR>
<I>Last update: 2006-11-27 16:41:30 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -138,6 +138,6 @@ This is an alphabetical list of structural words
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Structural.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Symbol.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Symbolic expressions</H1>
<FONT SIZE="4">
<I>Last update: 2006-12-01 13:43:01 CET</I><BR>
<I>Last update: 2006-11-23 12:18:08 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -86,6 +86,6 @@ This produces <I>x, y and z</I>, in English.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc mathematical/Symbol.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Symbolic.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Symbolic: Noun Phrases with mathematical symbols</H1>
<FONT SIZE="4">
<I>Last update: 2007-01-08 17:30:04 CET</I><BR>
<I>Last update: 2006-12-22 14:08:31 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -38,6 +38,6 @@ gfdoc - a rudimentary GF document generator.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc api/Symbolic.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Text.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Text: Texts</H1>
<FONT SIZE="4">
<I>Last update: 2006-06-16 07:46:47 CEST</I><BR>
<I>Last update: 2006-06-15 09:19:39 CEST</I><BR>
</FONT></CENTER>
<P></P>
@@ -38,6 +38,6 @@ Any punctuation mark can be attached to any kind of phrase.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Text.txt -->
</BODY></HTML>

4
lib/resource-1.0/doc/gfdoc/Verb.html
View File

@@ -6,7 +6,7 @@
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> The construction of verb phrases</H1>
<FONT SIZE="4">
<I>Last update: 2006-03-03 17:06:11 CET</I><BR>
<I>Last update: 2006-02-27 09:41:31 CET</I><BR>
</FONT></CENTER>
<P></P>
@@ -118,6 +118,6 @@ work in all the languages we cover.
</PRE>
<P></P>
<!-- html code generated by txt2tags 2.4 (http://txt2tags.sf.net) -->
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc abstract/Verb.txt -->
</BODY></HTML>

2
lib/resource-1.0/doc/index.html
View File

@@ -7,7 +7,7 @@
<P ALIGN="center"><CENTER><H1>GF Resource Grammar Library v. 1.2</H1>
<FONT SIZE="4">
<I>Author: Aarne Ranta &lt;aarne (at) cs.chalmers.se&gt;</I><BR>
Last update: Sun Jul 8 17:07:04 2007
Last update: Sun Jul 8 18:49:50 2007
</FONT></CENTER>
<P>