diff --git a/doc/resource.pdf b/doc/resource.pdf index befd7156f..99dfc6ecc 100644 Binary files a/doc/resource.pdf and b/doc/resource.pdf differ diff --git a/lib/resource-1.0/TODO b/lib/resource-1.0/TODO index 4c1aa1a79..e3a22e242 100644 --- a/lib/resource-1.0/TODO +++ b/lib/resource-1.0/TODO @@ -12,7 +12,7 @@ TODO in Resource 1.0 implementation %Ita: clitic order and changes -Ita: infinitive contractions +%Ita: infinitive contractions %Ita: articles in possessives diff --git a/lib/resource-1.0/doc/Resource-HOWTO.html b/lib/resource-1.0/doc/Resource-HOWTO.html index 58e05bd46..66a3bff65 100644 --- a/lib/resource-1.0/doc/Resource-HOWTO.html +++ b/lib/resource-1.0/doc/Resource-HOWTO.html @@ -7,7 +7,7 @@
-http://www.cs.chalmers.se/~aarne/GF/doc/resource.pdf.
+http://www.cs.chalmers.se/~aarne/GF/doc/resource.pdf.
A tutorial on GF, also introducing the idea of resource grammars, is found in diff --git a/lib/resource-1.0/doc/gfdoc/Adjective.html b/lib/resource-1.0/doc/gfdoc/Adjective.html index b164fc120..0afa60ed5 100644 --- a/lib/resource-1.0/doc/gfdoc/Adjective.html +++ b/lib/resource-1.0/doc/gfdoc/Adjective.html @@ -6,7 +6,7 @@
Sentence and question complements defined for all adjectival -phrases, although the semantics is only clear for some adjective. +phrases, although the semantics is only clear for some adjectives.
SentAP : AP -> SC -> AP ; -- great that she won, uncertain if she did
diff --git a/lib/resource-1.0/doc/gfdoc/Adverb.html b/lib/resource-1.0/doc/gfdoc/Adverb.html
index 2f707f31b..eee0f5516 100644
--- a/lib/resource-1.0/doc/gfdoc/Adverb.html
+++ b/lib/resource-1.0/doc/gfdoc/Adverb.html
@@ -6,7 +6,7 @@
Adverb: Adverbs and Adverbial Phrases
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-14 22:56:30 CEST
diff --git a/lib/resource-1.0/doc/gfdoc/Cat.html b/lib/resource-1.0/doc/gfdoc/Cat.html
index 25ac55973..04d37d0f1 100644
--- a/lib/resource-1.0/doc/gfdoc/Cat.html
+++ b/lib/resource-1.0/doc/gfdoc/Cat.html
@@ -6,7 +6,7 @@
Cat: the Category System
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:10:58 CEST
@@ -41,7 +41,7 @@ it is enough that both Verb and Noun use the same type
which is given here in Cat.
-Some categories are inherited from Common.
+Some categories are inherited from Common.
The reason they are defined there is that they have the same
implementation in all languages in the resource (typically,
just a string). These categories are
@@ -132,7 +132,7 @@ as defined in Noun.
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. "all the seven"
+ 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"
diff --git a/lib/resource-1.0/doc/gfdoc/Common.html b/lib/resource-1.0/doc/gfdoc/Common.html
index 8fc32086b..9a348ba29 100644
--- a/lib/resource-1.0/doc/gfdoc/Common.html
+++ b/lib/resource-1.0/doc/gfdoc/Common.html
@@ -6,7 +6,7 @@
Common: Structures with Common Implementations.
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:13:55 CEST
@@ -30,11 +30,11 @@ gfdoc - a rudimentary GF document generator.
This module defines the categories that uniformly have the linearization
{s : Str} in all languages.
Moreover, this module defines the abstract parameters of tense, polarity, and
-anteriority, which are used in Phrase to generate different
-forms of sentences. Together they give 2 x 4 x 4 = 16 sentence forms.
+anteriority, which are used in Phrase to generate different
+forms of sentences. Together they give 4 x 2 x 2 = 16 sentence forms.
These tenses are defined for all languages in the library. More tenses
can be defined in the language extensions, e.g. the pass simple of
-Romance languages.
+Romance languages in ExtraRomance.
abstract Common = {
@@ -45,14 +45,14 @@ Romance languages.
Top-level units
-Constructed in Text: Text.
+Constructed in Text: Text.
Text ; -- text consisting of several phrases e.g. "He is here. Why?"
-Constructed in Phrase:
+Constructed in Phrase:
Phr ; -- phrase in a text e.g. "but be quiet please"
@@ -62,7 +62,7 @@ Constructed in Phrase:
-Constructed in Sentence:
+Constructed in Sentence:
SC ; -- embedded sentence or question e.g. "that it rains"
@@ -71,8 +71,8 @@ Constructed in Sentence:
Adverbs
-Constructed in Adverb.
-Many adverbs are constructed in Structural.
+Constructed in Adverb.
+Many adverbs are constructed in Structural.
Adv ; -- verb-phrase-modifying adverb, e.g. "in the house"
diff --git a/lib/resource-1.0/doc/gfdoc/Conjunction.html b/lib/resource-1.0/doc/gfdoc/Conjunction.html
index 18246dd77..b2caa31b3 100644
--- a/lib/resource-1.0/doc/gfdoc/Conjunction.html
+++ b/lib/resource-1.0/doc/gfdoc/Conjunction.html
@@ -6,7 +6,7 @@
Conjunction: Coordination
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:17:31 CEST
@@ -37,9 +37,9 @@ and define two general patterns:
-Note. This module uses right-recursive lists. If backward
-compatibility with API 0.9 is needed, use
-SeqConjunction.
+VP conjunctions are not covered here, because their applicability
+depends on language. Some special cases are defined in
+Extra.
abstract Conjunction = Cat ** {
diff --git a/lib/resource-1.0/doc/gfdoc/Grammar.html b/lib/resource-1.0/doc/gfdoc/Grammar.html
index b4c131f87..d324f7076 100644
--- a/lib/resource-1.0/doc/gfdoc/Grammar.html
+++ b/lib/resource-1.0/doc/gfdoc/Grammar.html
@@ -6,7 +6,7 @@
Grammar: the Main Module of the Resource Grammar
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:08:55 CEST
@@ -21,8 +21,8 @@ gfdoc - a rudimentary GF document generator.
(c) Aarne Ranta (aarne@cs.chalmers.se) 2002 under GNU GPL.
-This grammar a collection of the different grammar modules,
-To test the resource, import Lang, which also contains
+This grammar is a collection of the different grammar modules,
+To test the resource, import Lang, which also contains
a lexicon.
diff --git a/lib/resource-1.0/doc/gfdoc/Idiom.html b/lib/resource-1.0/doc/gfdoc/Idiom.html
index e808d2c24..ce6b849fa 100644
--- a/lib/resource-1.0/doc/gfdoc/Idiom.html
+++ b/lib/resource-1.0/doc/gfdoc/Idiom.html
@@ -6,7 +6,7 @@
Idiom: Idiomatic Expressions
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-14 22:57:19 CEST
diff --git a/lib/resource-1.0/doc/gfdoc/IrregEng.gf b/lib/resource-1.0/doc/gfdoc/IrregEng.gf
index fa5cc2936..bea851f70 100644
--- a/lib/resource-1.0/doc/gfdoc/IrregEng.gf
+++ b/lib/resource-1.0/doc/gfdoc/IrregEng.gf
@@ -59,7 +59,7 @@ flags optimize=values ;
freeze_V = irregV "freeze" "froze" "frozen" ;
get_V = irregDuplV "get" "got" "gotten" ;
give_V = irregV "give" "gave" "given" ;
- go_V = irregV "go" "went" "gone" ;
+ go_V = mkV "go" "goes" "went" "gone" "going" ;
grind_V = irregV "grind" "ground" "ground" ;
grow_V = irregV "grow" "grew" "grown" ;
hang_V = irregV "hang" "hung" "hung" ;
diff --git a/lib/resource-1.0/doc/gfdoc/Lang.html b/lib/resource-1.0/doc/gfdoc/Lang.html
index fc9167189..16c2d9e24 100644
--- a/lib/resource-1.0/doc/gfdoc/Lang.html
+++ b/lib/resource-1.0/doc/gfdoc/Lang.html
@@ -6,7 +6,7 @@
Lang: a Test Module for the Resource Grammar
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:09:20 CEST
@@ -23,7 +23,7 @@ gfdoc - a rudimentary GF document generator.
This grammar is for testing the resource as included in the
language-independent API, consisting of a grammar and a lexicon.
-The grammar without a lexicon is Grammar,
+The grammar without a lexicon is Grammar,
which may be more suitable to open in applications.
diff --git a/lib/resource-1.0/doc/gfdoc/Mathematical.html b/lib/resource-1.0/doc/gfdoc/Mathematical.html
index 70ef813ac..d0d812f52 100644
--- a/lib/resource-1.0/doc/gfdoc/Mathematical.html
+++ b/lib/resource-1.0/doc/gfdoc/Mathematical.html
@@ -6,7 +6,7 @@
The Mathematics API to the Resource Grammar
-Last update: 2006-02-28 09:26:58 CET
+Last update: 2006-02-25 21:36:45 CET
diff --git a/lib/resource-1.0/doc/gfdoc/Multi.html b/lib/resource-1.0/doc/gfdoc/Multi.html
index e94882d8b..65eb56347 100644
--- a/lib/resource-1.0/doc/gfdoc/Multi.html
+++ b/lib/resource-1.0/doc/gfdoc/Multi.html
@@ -6,7 +6,7 @@
Multimodal additions to the resource grammar library
-Last update: 2006-05-24 15:08:56 CEST
+Last update: 2006-05-23 23:36:59 CEST
diff --git a/lib/resource-1.0/doc/gfdoc/Noun.html b/lib/resource-1.0/doc/gfdoc/Noun.html
index 90b866dd7..47d42c0a9 100644
--- a/lib/resource-1.0/doc/gfdoc/Noun.html
+++ b/lib/resource-1.0/doc/gfdoc/Noun.html
@@ -6,7 +6,7 @@
Noun: Nouns, noun phrases, and determiners
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:19:41 CEST
@@ -50,7 +50,7 @@ The three main types of noun phrases are
-Pronouns are defined in the module Structural.
+Pronouns are defined in the module Structural.
A noun phrase already formed can be modified by a Predeterminer.
@@ -91,7 +91,8 @@ Quantifiers that have both forms can be used in both ways.
Pronouns have possessive forms. Genitives of other kinds
of noun phrases are not given here, since they are not possible
-in e.g. Romance languages.
+in e.g. Romance languages. They can be found in
+Extra.
PossPron : Pron -> Quant ; -- my (house)
@@ -188,7 +189,7 @@ The semantics is typically derivative of the relational meaning.
Nouns can be modified by adjectives, relative clauses, and adverbs
-(the last rule will give rise to many 'PP attachement' ambiguities
+(the last rule will give rise to many 'PP attachment' ambiguities
when used in connection with verb phrases).
diff --git a/lib/resource-1.0/doc/gfdoc/Numeral.html b/lib/resource-1.0/doc/gfdoc/Numeral.html
index 6406bf1a0..3e6048a91 100644
--- a/lib/resource-1.0/doc/gfdoc/Numeral.html
+++ b/lib/resource-1.0/doc/gfdoc/Numeral.html
@@ -6,7 +6,7 @@
Numerals
-Last update: 2006-01-25 12:10:58 CET
+Last update: 2006-06-22 19:22:05 CEST
@@ -27,12 +27,19 @@ The implementations are adapted from the
which defines numerals for 88 languages.
The resource grammar implementations add to this inflection (if needed)
and ordinal numbers.
-Note. Number 1 as defined
+
+
+Note 1. Number 1 as defined
in the category Numeral here should not be used in the formation of
noun phrases, and should therefore be removed. Instead, one should use
Structural.one_Quant. This makes the grammar simpler
because we can assume that numbers form plural noun phrases.
+
+Note 2. The implementations introduce spaces between
+parts of a numeral, which is often incorrect - more work on
+(un)lexing is needed to solve this problem.
+
abstract Numeral = Cat ** {
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsDan.html b/lib/resource-1.0/doc/gfdoc/ParadigmsDan.html
index 812675114..a34e49998 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsDan.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsDan.html
@@ -6,7 +6,7 @@
Danish Lexical Paradigms
-Last update: 2006-06-15 14:44:29 CEST
+Last update: 2006-06-22 20:53:41 CEST
@@ -28,7 +28,7 @@
-Aarne Ranta 2003 +Aarne Ranta 2005 - 2006
-This is an API to the user of the resource grammar +This is an API for the user of the resource grammar for adding lexical items. It gives functions for forming expressions of open categories: nouns, adjectives, verbs.
@@ -69,8 +69,8 @@ first we give a handful of patterns that aim to cover all regular cases. Then we give a worst-case functionmkC, which serves as an
escape to construct the most irregular words of type C.
However, this function should only seldom be needed: we have a
-separate module IrregularEng, which covers all irregularly inflected
-words.
+separate module IrregDan,
+which haves a list of irregular verbs.
resource ParadigmsDan =
@@ -131,14 +131,14 @@ Worst case: give all four forms. The gender is computed from the
last letter of the second form (if n, then utrum, otherwise neutrum).
- mkN : (dreng,drengen,drenger,drengene : Str) -> N ;
+ mkN : (dreng,drengen,drenge,drengene : Str) -> N ;
The regular function takes the singular indefinite form
and computes the other forms and the gender by a heuristic.
The heuristic is that all nouns are utrum with the
-plural ending er///r//.
+plural ending er or r.
regN : Str -> N ;
@@ -171,20 +171,20 @@ indefinite
Compound nouns
All the functions above work quite as well to form compound nouns,
-such as fotboll.
+such as fodbold.
Relational nouns
-Relational nouns (daughter of x) need a preposition.
+Relational nouns (datter til x) need a preposition.
mkN2 : N -> Prep -> N2 ;
-The most common preposition is av, and the following is a
-shortcut for regular, nonhuman relational nouns with av.
+The most common preposition is af, and the following is a
+shortcut for regular relational nouns with af.
regN2 : Str -> Gender -> N2 ;
@@ -195,7 +195,7 @@ Use the function mkPrep or see the section on prepositions below to
form other prepositions.
-Three-place relational nouns (the connection from x to y)
+Three-place relational nouns (forbindelse fra x til y)
need two prepositions.
@@ -206,7 +206,7 @@ need two prepositions.
Relational common noun phrases
In some cases, you may want to make a complex CN into a
-relational noun (e.g. the old town hall of). However, N2 and
+relational noun (e.g. tidligere kone til). However, N2 and
N3 are purely lexical categories. But you can use the AdvCN
and PrepNP constructions to build phrases like this.
@@ -298,7 +298,7 @@ Sometimes just the positive forms are irregular.
-If comparison is formed by mer, //mest, as in general for//
+If comparison is formed by mer, mest, as in general for
long adjective, the following pattern is used:
@@ -309,7 +309,8 @@ long adjective, the following pattern is used:
Adverbs
Adverbs are not inflected. Most lexical ones have position
-after the verb. Some can be preverbal (e.g. always).
+after the verb. Some can be close to the verb like the negation
+ikke (e.g. altid).
mkAdv : Str -> Adv ;
@@ -351,11 +352,11 @@ There is an extensive list of irregular verbs in the module IrregDan
- irregV : (drikke, drakk, drukket : Str) -> V ;
+ irregV : (drikke, drak, drukket : Str) -> V ;
-Verbs with //vre// as auxiliary
+Verbs with 'vre' as auxiliary
By default, the auxiliary is have. This function changes it to vre.
@@ -366,7 +367,7 @@ By default, the auxiliary is have. This function changes it to v
Verbs with a particle
-The particle, such as in switch on, is given as a string.
+The particle, such as in passe p, is given as a string.
partV : V -> Str -> V ;
@@ -375,8 +376,8 @@ The particle, such as in switch on, is given as a string.
Deponent verbs
-Some words are used in passive forms only, e.g. hoppas, some as
-reflexive e.g. ngra sig.
+Some words are used in passive forms only, e.g. undres, some as
+reflexive e.g. forestille sig.
depV : V -> V ;
@@ -402,8 +403,8 @@ Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
- mkV3 : V -> Prep -> Prep -> V3 ; -- speak, with, about
- dirV3 : V -> Prep -> V3 ; -- give,_,to
+ mkV3 : V -> Prep -> Prep -> V3 ; -- snakke, med, om
+ dirV3 : V -> Prep -> V3 ; -- give,_,til
dirdirV3 : V -> V3 ; -- give,_,_
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsEng.html b/lib/resource-1.0/doc/gfdoc/ParadigmsEng.html
index 884d264fa..b9ec2e2dd 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsEng.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsEng.html
@@ -6,7 +6,7 @@
English Lexical Paradigms
-Last update: 2006-06-15 16:21:43 CEST
+Last update: 2006-06-22 20:54:15 CEST
@@ -49,7 +49,7 @@ gfdoc - a rudimentary GF document generator.
Aarne Ranta 2003--2005
-This is an API to the user of the resource grammar
+This is an API for the user of the resource grammar
for adding lexical items. It gives functions for forming
expressions of open categories: nouns, adjectives, verbs.
@@ -69,11 +69,8 @@ first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
escape to construct the most irregular words of type C.
However, this function should only seldom be needed: we have a
-separate module IrregularEng, which covers all irregularly inflected
-words.
-
-
-The following modules are presupposed:
+separate module IrregEng,
+which covers irregular verbss.
resource ParadigmsEng = open
@@ -125,7 +122,7 @@ The resource category Prep is used.
Nouns
-Worst case: give all four forms and the semantic gender.
+Worst case: give all four forms.
mkN : (man,men,man's,men's : Str) -> N ;
@@ -284,7 +281,7 @@ but a separate pattern is used:
-If comparison is formed by more, //most, as in general for//
+If comparison is formed by more, most, as in general for
long adjective, the following pattern is used:
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsFin.html b/lib/resource-1.0/doc/gfdoc/ParadigmsFin.html
index dd81e3919..346b9e625 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsFin.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsFin.html
@@ -6,7 +6,7 @@
Finnish Lexical Paradigms
-Last update: 2006-06-15 15:06:49 CEST
+Last update: 2006-06-22 20:46:07 CEST
@@ -18,8 +18,9 @@
C is the following:
first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
escape to construct the most irregular words of type C.
-However, this function should only seldom be needed: we have a
-separate module IrregularFin, which covers all irregularly inflected
-words.
-
--The following modules are presupposed: +However, this function should only seldom be needed.
resource ParadigmsFin = open
@@ -68,12 +64,7 @@ The following modules are presupposed:
MorphoFin,
CatFin
in {
-
-
--flags optimize=all ; -
-
+
flags optimize=noexpand ;
@@ -82,8 +73,8 @@ flags optimize=all ;
To abstract over gender, number, and (some) case names,
we define the following identifiers. The application programmer
-should always use these constants instead of their definitions
-in TypesInf.
+should always use these constants instead of the constructors
+defined in ResFin.
oper
@@ -120,8 +111,8 @@ just a case, or a pre/postposition and a case.
Nouns
-The worst case gives ten forms and the semantic gender.
-In practice just a couple of forms are needed, to define the different
+The worst case gives ten forms.
+In practice just a couple of forms are needed to define the different
stems, vowel alternation, and vowel harmony.
@@ -167,7 +158,7 @@ The rest of the noun paradigms are mostly covered by the three
heuristics.
-Nouns with partitive a///// are a large group.
+Nouns with partitive a, are a large group.
To determine for grade and vowel alternation, three forms are usually needed:
singular nominative and genitive, and plural partitive.
Examples: talo, kukko, huippu, koira, kukka, syyl, srki...
@@ -205,11 +196,12 @@ undergo regular weak-grade alternation:
Foreign words ending in consonants are actually similar to words like
-malli///mallin/malleja, with the exception that the //i is not attached
+malli-mallin-malleja, with the exception that the i is not attached
to the singular nominative. Examples: linux, savett, screen.
-The singular partitive form is used to get the vowel harmony. (N.B. more than
-1-syllabic words ending in n would have variant plural genitive and
-partitive forms, like sultanien///sultaneiden//, which are not covered.)
+The singular partitive form is used to get the vowel harmony.
+(N.B. more than 1-syllabic words ending in n would have variant
+plural genitive and partitive forms, like
+sultanien, sultaneiden, which are not covered.)
nLinux : (linuxia : Str) -> N ;
@@ -233,7 +225,7 @@ The following paradigm covers both nouns ending in an aspirated e, such a
-The following covers nouns with partitive ta///t//, such as
+The following covers nouns with partitive ta,t, such as
susi, vesi, pieni. To get all stems and the vowel harmony, it takes
the singular nominative, genitive, and essive.
@@ -433,6 +425,8 @@ The verbs be is special.
vOlla : V ;
+
+Two-place verbs
Two-place verbs need a case, and can have a pre- or postposition.
@@ -450,25 +444,25 @@ If the complement needs just a case, the following special function can be used.
Verbs with a direct (accusative) object
are special, since their complement case is finally decided in syntax.
-But this is taken care of by ClauseFin.
+But this is taken care of in VerbFin.
dirV2 : V -> V2 ;
-
+
Three-place verbs
Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
- mkV3 : V -> Prep -> Prep -> V3 ; -- speak, with, about
- dirV3 : V -> Case -> V3 ; -- give,_,to
- dirdirV3 : V -> V3 ; -- acc, allat
+ mkV3 : V -> Prep -> Prep -> V3 ; -- puhua, allative, elative
+ dirV3 : V -> Case -> V3 ; -- siirt, (accusative), illative
+ dirdirV3 : V -> V3 ; -- antaa, (accusative), (allative)
-
+
Other complement patterns
Verbs and adjectives can take complements such as sentences,
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsFre.html b/lib/resource-1.0/doc/gfdoc/ParadigmsFre.html
index 58847f94f..5f96b5123 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsFre.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsFre.html
@@ -6,7 +6,7 @@
French Lexical Paradigms
-Last update: 2006-06-15 15:08:18 CEST
+Last update: 2006-06-22 21:02:44 CEST
@@ -44,10 +44,10 @@ gfdoc - a rudimentary GF document generator.
(c) Aarne Ranta (aarne@cs.chalmers.se) 2002 under GNU GPL.
-Aarne Ranta 2003
+Aarne Ranta 2001 - 2006
-This is an API to the user of the resource grammar
+This is an API for the user of the resource grammar
for adding lexical items. It gives functions for forming
expressions of open categories: nouns, adjectives, verbs.
@@ -67,8 +67,8 @@ first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
escape to construct the most irregular words of type C.
However, this function should only seldom be needed: we have a
-separate module IrregularEng, which covers all irregularly inflected
-words.
+separate module IrregFre,
+which covers all irregularly inflected verbs.
resource ParadigmsFre =
@@ -191,7 +191,7 @@ Three-place relational nouns (la connection de x
Relational common noun phrases
In some cases, you may want to make a complex CN into a
-relational noun (e.g. the old town hall of). However, N2 and
+relational noun (e.g. la vieille glise de). However, N2 and
N3 are purely lexical categories. But you can use the AdvCN
and PrepNP constructions to build phrases like this.
@@ -201,9 +201,9 @@ and PrepNP constructions to build phrases like this.
Proper names need a string and a gender.
- mkPN : Str -> Gender -> PN ; -- Jean
+ mkPN : Str -> Gender -> PN ; -- Jean
- regPN : Str -> PN ; -- masculine
+ regPN : Str -> PN ; -- feminine if "-e", masculine otherwise
@@ -345,7 +345,7 @@ To change it to
Two-place verbs
Two-place verbs need a preposition, except the special case with direct object.
-(transitive verbs). Notice that a particle comes from the V.
+(transitive verbs).
mkV2 : V -> Prep -> V2 ;
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsGer.html b/lib/resource-1.0/doc/gfdoc/ParadigmsGer.html
index e10d4a88b..7e2dee6fc 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsGer.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsGer.html
@@ -6,7 +6,7 @@
German Lexical Paradigms
-Last update: 2006-06-15 14:53:14 CEST
+Last update: 2006-06-22 20:58:18 CEST
@@ -41,7 +41,7 @@ gfdoc - a rudimentary GF document generator.
Aarne Ranta & Harald Hammarstrm 2003--2006
-This is an API to the user of the resource grammar
+This is an API for the user of the resource grammar
for adding lexical items. It gives functions for forming
expressions of open categories: nouns, adjectives, verbs.
@@ -61,8 +61,8 @@ first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
escape to construct the most irregular words of type C.
However, this function should only seldom be needed: we have a
-separate module IrregularGer, which covers all irregularly inflected
-words.
+separate module IrregGer
+which covers irregularly inflected verbs.
resource ParadigmsGer = open
@@ -117,7 +117,7 @@ and the gender.
mkN : (x1,_,_,_,_,x6 : Str) -> Gender -> N ;
- -- mann, mann, manne, mannes, mnner, mnnern
+ -- mann, mann, manne, mannes, mnner, mnnern
@@ -167,7 +167,8 @@ The regular genitive is s, omitted after s.
mkPN : (karolus, karoli : Str) -> PN ; -- karolus, karoli
- regPN : (Johann : Str) -> PN ; -- Johann, Johanns ; Johannes, Johannes
+ regPN : (Johann : Str) -> PN ;
+ -- Johann, Johanns ; Johannes, Johannes
@@ -319,9 +320,9 @@ Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
- mkV3 : V -> Prep -> Prep -> V3 ; -- speak, with, about
- dirV3 : V -> Prep -> V3 ; -- give,_,to
- accdatV3 : V -> V3 ; -- give,_,_
+ mkV3 : V -> Prep -> Prep -> V3 ; -- sprechen, mit, ber
+ dirV3 : V -> Prep -> V3 ; -- senden,(accusative),nach
+ accdatV3 : V -> V3 ; -- give,accusative,dative
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsIta.html b/lib/resource-1.0/doc/gfdoc/ParadigmsIta.html
index 1b9280609..076355eb9 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsIta.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsIta.html
@@ -6,7 +6,7 @@
Italian Lexical Paradigms
-Last update: 2006-06-15 16:38:46 CEST
+Last update: 2006-06-22 21:07:00 CEST
@@ -47,7 +47,7 @@ gfdoc - a rudimentary GF document generator.
Aarne Ranta 2003
-This is an API to the user of the resource grammar
+This is an API for the user of the resource grammar
for adding lexical items. It gives functions for forming
expressions of open categories: nouns, adjectives, verbs.
@@ -66,9 +66,9 @@ The structure of functions for each word class C is the following:
first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
escape to construct the most irregular words of type C.
-However, this function should only seldom be needed: we have a
-separate module IrregularEng, which covers all irregularly inflected
-words.
+However, this function should only seldom be needed. For verbs, we have a
+separate module BeschIta,
+which covers the Bescherelle verb conjugations.
resource ParadigmsIta =
@@ -110,8 +110,8 @@ To abstract over number names, we define the following.
Prepositions used in many-argument functions are either strings
(including the 'accusative' empty string) or strings that
-amalgamate with the following word (the 'genitive' de and the
-'dative' ).
+amalgamate with the following word (the 'genitive' di and the
+'dative' a).
Prep : Type ;
@@ -129,7 +129,7 @@ amalgamate with the following word (the 'genitive' de and the
Worst case: give both two forms and the gender.
- mkN : (uomi,uomini : Str) -> Gender -> N ;
+ mkN : (uomo,uomini : Str) -> Gender -> N ;
@@ -154,7 +154,7 @@ To force a different gender, use one of the following functions.
Compound nouns
Some nouns are ones where the first part is inflected as a noun but
-the second part is not inflected. e.g. numro de tlphone.
+the second part is not inflected. e.g. numero di telefono.
They could be formed in syntax, but we give a shortcut here since
they are frequent in lexica.
@@ -191,7 +191,7 @@ Three-place relational nouns (la connessione di x a y) need two prepositi
Relational common noun phrases
In some cases, you may want to make a complex CN into a
-relational noun (e.g. the old town hall of). However, N2 and
+relational noun (e.g. la vecchia chiesa di). However, N2 and
N3 are purely lexical categories. But you can use the AdvCN
and PrepNP constructions to build phrases like this.
@@ -202,7 +202,7 @@ Proper names need a string and a gender.
mkPN : Str -> Gender -> PN ;
- regPN : Str -> PN ; -- masculine
+ regPN : Str -> PN ; -- feminine if "-a", otherwise masculine
@@ -234,7 +234,7 @@ masculine singular.
These functions create postfix adjectives. To switch
them to prefix ones (i.e. ones placed before the noun in
-modification, as in petite maison), the following function is
+modification, as in vecchia chiesa), the following function is
provided.
@@ -270,7 +270,7 @@ the following pattern is used:
The regular pattern is the same as regA for plain adjectives,
-with comparison by plus.
+with comparison by pi.
regADeg : Str -> A ;
@@ -303,18 +303,18 @@ Adverbs modifying adjectives and sentences can also be formed.
Verbs
-Regular verbs are ones with the infinitive er or ir, the
-latter with plural present indicative forms as finissons.
+Regular verbs are ones with the infinitive are or ire, the
+latter with singular present indicative forms as finisco.
The regular verb function is the first conjugation recognizes
these endings, as well as the variations among
-aimer, cder, placer, peser, jeter, placer, manger, assiger, payer.
+amare, cominciare, mangiare, legare, cercare.
regV : Str -> V ;
-The module BeschIta gives all the patterns of the Bescherelle
+The module BeschIta gives (almost) all the patterns of the Bescherelle
book. To use them in the category V, wrap them with the function
@@ -331,6 +331,16 @@ Reflexive implies essere.
reflV : V -> V ;
+
+If BeschIta does not give the desired result or feels difficult
+to consult, here is a worst-case function for -ire and -ere verbs,
+taking 11 arguments.
+
+
+ mkV :
+ (udire,odo,ode,udiamo,udiro,udii,udisti,udi,udirono,odi,udito : Str) -> V ;
+
+
Two-place verbs
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html b/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html
index 22f67f436..ebd816456 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html
@@ -6,7 +6,7 @@
Norwegian Lexical Paradigms
-Last update: 2006-06-15 15:58:53 CEST
+Last update: 2006-06-22 21:16:02 CEST
@@ -28,7 +28,7 @@
-This is an API to the user of the resource grammar +This is an API for the user of the resource grammar for adding lexical items. It gives functions for forming expressions of open categories: nouns, adjectives, verbs. +It covers the bokml variant of Norwegian.
Closed categories (determiners, pronouns, conjunctions) are
-accessed through the resource syntax API, Structural.gf.
+accessed through the resource syntax API, Structural.
The main difference with MorphoNor.gf is that the types
@@ -69,8 +70,8 @@ first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
escape to construct the most irregular words of type C.
However, this function should only seldom be needed: we have a
-separate module IrregularEng, which covers all irregularly inflected
-words.
+separate module IrregNor,
+which covers irregularly inflected verbs.
resource ParadigmsNor =
@@ -170,7 +171,7 @@ such as fotboll.
Relational nouns
-Relational nouns (daughter of x) need a preposition.
+Relational nouns (datter til x) need a preposition.
mkN2 : N -> Prep -> N2 ;
@@ -189,7 +190,8 @@ Use the function mkPrep or see the section on prepositions below to
form other prepositions.
-Three-place relational nouns (the connection from x to y) need two prepositions.
+Three-place relational nouns (forbindelse fra x til y)
+need two prepositions.
mkN3 : N -> Prep -> Prep -> N3 ;
@@ -199,7 +201,7 @@ Three-place relational nouns (the connection from x to y) need two prepos
Relational common noun phrases
In some cases, you may want to make a complex CN into a
-relational noun (e.g. the old town hall of). However, N2 and
+relational noun (e.g. den gamle kongen av). However, N2 and
N3 are purely lexical categories. But you can use the AdvCN
and PrepNP constructions to build phrases like this.
@@ -286,12 +288,12 @@ Just the comparison forms can be irregular.
Sometimes just the positive forms are irregular.
- mk3ADeg : (galen,galet,galna : Str) -> A ;
+ mk3ADeg : (galen,galet,galne : Str) -> A ;
mk2ADeg : (bred,bredt : Str) -> A ;
-If comparison is formed by mer, //mest, as in general for//
+If comparison is formed by mer, mest, as in general for
long adjective, the following pattern is used:
@@ -302,11 +304,11 @@ long adjective, the following pattern is used:
Adverbs
Adverbs are not inflected. Most lexical ones have position
-after the verb. Some can be preverbal (e.g. always).
+after the verb. Some follow the verb (e.g. altid).
- mkAdv : Str -> Adv ;
- mkAdV : Str -> AdV ;
+ mkAdv : Str -> Adv ; -- e.g. her
+ mkAdV : Str -> AdV ; -- e.g. altid
@@ -348,7 +350,7 @@ In practice, it is enough to give three forms, as in school books.
-Verbs with //vre// as auxiliary
+Verbs with 'vre' as auxiliary
By default, the auxiliary is have. This function changes it to vre.
@@ -359,7 +361,7 @@ By default, the auxiliary is have. This function changes it to v
Verbs with a particle.
-The particle, such as in switch on, is given as a string.
+The particle, such as in lukke opp, is given as a string.
partV : V -> Str -> V ;
@@ -368,8 +370,8 @@ The particle, such as in switch on, is given as a string.
Deponent verbs.
-Some words are used in passive forms only, e.g. hoppas, some as
-reflexive e.g. ngra sig.
+Some words are used in passive forms only, e.g. trives, some as
+reflexive e.g. forestille seg.
depV : V -> V ;
@@ -395,9 +397,9 @@ Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
- mkV3 : V -> Prep -> Prep -> V3 ; -- speak, with, about
- dirV3 : V -> Prep -> V3 ; -- give,_,to
- dirdirV3 : V -> V3 ; -- give,_,_
+ mkV3 : V -> Prep -> Prep -> V3 ; -- snakke, med, om
+ dirV3 : V -> Prep -> V3 ; -- gi,_,til
+ dirdirV3 : V -> V3 ; -- gi,_,_
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsRus.html b/lib/resource-1.0/doc/gfdoc/ParadigmsRus.html
index db97b8cd4..99d206b6a 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsRus.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsRus.html
@@ -6,7 +6,7 @@
Russian Lexical Paradigms
-Last update: 2006-06-15 16:42:18 CEST
+Last update: 2006-06-22 17:53:54 CEST
@@ -29,10 +29,10 @@ gfdoc - a rudimentary GF document generator.
(c) Aarne Ranta (aarne@cs.chalmers.se) 2002 under GNU GPL.
-Janna Khegai 2003--2005
+Janna Khegai 2003--2006
-This is an API to the user of the resource grammar
+This is an API for the user of the resource grammar
for adding lexical items. It gives functions for forming
expressions of open categories: nouns, adjectives, verbs.
@@ -41,7 +41,7 @@ Closed categories (determiners, pronouns, conjunctions) are
accessed through the resource syntax API, Structural.gf.
-The main difference with MorphoEng.gf is that the types
+The main difference with MorphoRus.gf 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.
@@ -51,9 +51,6 @@ The structure of functions for each word class C is the following:
first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
escape to construct the most irregular words of type C.
-However, this function should only seldom be needed: we have a
-separate module IrregularEng, which covers all irregularly inflected
-words.
The following modules are presupposed:
@@ -121,7 +118,7 @@ Best case: indeclinabe nouns: кофе, пальто, ВУЗ
@@ -135,7 +132,8 @@ 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.
- mkN : (_,_,_,_,_,_,_,_,_,_,_,_ : Str) -> Gender -> Animacy -> N ;
+ mkN : (nomSg, genSg, datSg, accSg, instSg, preposSg,
+ nomPl, genPl, datPl, accPl, instPl, preposPl: Str) -> Gender -> Animacy -> N ;
-- мужчина, мужчины, мужчине, мужчину, мужчиной, мужчине
-- мужчины, мужчин, мужчинам, мужчин, мужчинами, мужчинах
@@ -158,7 +156,7 @@ Feminine patterns.
nEdinica : Str -> N ; -- feminine, inanimate, ending with "-а", Inst -"единиц-ей"
nZhenchina : Str -> N ; -- feminine, animate, ending with "-a"
nNoga : Str -> N ; -- feminine, inanimate, ending with "г_к_х-a"
- nMalyariya : Str -> N ; -- feminine, inanimate, ending with "-ия"
+ nMalyariya : Str -> N ; -- feminine, inanimate, ending with "-ия"
nTetya : Str -> N ; -- feminine, animate, ending with "-я"
nBol : Str -> N ; -- feminine, inanimate, ending with "-ь"(soft sign)
@@ -178,7 +176,7 @@ Masculine patterns.
Ending with consonant:
- nPepel : Str -> N ; -- masculine, inanimate, ending with "-ел"- "пеп-ла"
+ nPepel : Str -> N ; -- masculine, inanimate, ending with "-ел"- "пеп-ла"
nBrat: Str -> N ; -- animate, брат-ья
nStul: Str -> N ; -- same as above, but inanimate
@@ -209,7 +207,6 @@ Proper names.
mkPN : Str -> Gender -> Animacy -> PN ; -- "Иван", "Маша"
- regPN : Str -> PN ;
nounPN : N -> PN ;
@@ -227,20 +224,16 @@ On the top level, it is maybe CN that is used rather than N
Non-comparison (only positive degree) one-place adjectives need 28 (4 by 7)
forms in the worst case:
-Masculine | Feminine | Neutral | Plural
-Nominative
-Genitive
-Dative
-Accusative Inanimate
-Accusative Animate
-Instructive
-Prepositional
+(Masculine | Feminine | Neutral | Plural) **
**
+(Nominative | Genitive | Dative | Accusative Inanimate | Accusative Animate |
+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.
mkA : ( : Str) -> A ;
The regular function captures the variants for some popular adjective
-endings below:
+endings below. The first string agrument is the masculine singular form,
+the second is comparative:
regA : Str -> Str -> A ;
@@ -257,12 +250,12 @@ Invariable adjective is a special case.
Some regular patterns depending on the ending.
- AStaruyj : Str -> Str -> A ; -- ending with "-ый"
- AMalenkij : Str -> Str -> A ; -- ending with "-ий", Gen - "маленьк-ого"
- AKhoroshij : Str -> Str -> A ; -- ending with "-ий", Gen - "хорош-его"
- AMolodoj : Str -> Str -> A ; -- ending with "-ой",
+ AStaruyj : Str -> Str -> A ; -- ending with "-ый"
+ AMalenkij : Str -> Str -> A ; -- ending with "-ий", Gen - "маленьк-ого"
+ AKhoroshij : Str -> Str -> A ; -- ending with "-ий", Gen - "хорош-его"
+ AMolodoj : Str -> Str -> A ; -- ending with "-ой",
-- plural - молод-ые"
- AKakoj_Nibud : Str -> Str -> Str -> A ; -- ending with "-ой",
+ AKakoj_Nibud : Str -> Str -> Str -> A ; -- ending with "-ой",
-- plural - "как-ие"
@@ -276,11 +269,11 @@ Two-place adjectives need a preposition and a case as extra arguments.
Comparison adjectives need a positive adjective
(28 forms without short forms).
-Taking only one comparative form (non-syntaxic) and
-only one superlative form (syntaxic) we can produce the
+Taking only one comparative form (non-syntactic) and
+only one superlative form (syntactic) we can produce the
comparison adjective with only one extra argument -
-non-syntaxic comparative form.
-Syntaxic forms are based on the positive forms.
+non-syntactic comparative form.
+Syntactic forms are based on the positive forms.
mkADeg : A -> Str -> ADeg ;
On top level, there are adjectival phrases. The most common case is
just to use a one-place adjective.
@@ -289,8 +282,7 @@ ap : A -> IsPostfixAdj -> AP ;
Adverbs
-Adverbs are not inflected. Most lexical ones have position
-after the verb. Some can be preverbal (e.g. always).
+Adverbs are not inflected.
mkAdv : Str -> Adv ;
@@ -305,29 +297,22 @@ In our lexicon description (Verbum) there are 62 forms:
4(GenNum)(past) ](indicative)+ 4 (GenNum) (subjunctive) }
Participles (Present and Past) and Gerund forms are not included,
since they fuction more like Adjectives and Adverbs correspondingly
-rather than verbs. Aspect regarded as an inherent parameter of a verb.
-Notice, that some forms are never used for some verbs. Actually,
-the majority of verbs do not have many of the forms.
+rather than verbs. Aspect is regarded as an inherent parameter of a verb.
+Notice, that some forms are never used for some verbs.
Voice: Type;
Aspect: Type;
-
-
-
-Tense : Type;
-
-
Bool: Type;
Conjugation: Type ;
- first: Conjugation; -- "гуля-Ешь, гуля-Ем"
- firstE: Conjugation; -- Verbs with vowel "ё": "даёшь" (give), "пьёшь" (drink)
- second: Conjugation; -- "вид-Ишь, вид-Им"
- mixed: Conjugation; -- "хоч-Ешь - хот-Им"
+ first: Conjugation; -- "гуля-Ешь, гуля-Ем"
+ firstE: Conjugation; -- Verbs with vowel "ё": "даёшь" (give), "пьёшь" (drink)
+ second: Conjugation; -- "вид-Ишь, вид-Им"
+ mixed: Conjugation; -- "хоч-Ешь - хот-Им"
dolzhen: Conjugation; -- irregular
- true: Bool;
+ true: Bool;
false: Bool;
active: Voice ;
@@ -337,8 +322,6 @@ Tense : Type;
-present : Tense ;
-past : Tense ;
The worst case need 6 forms of the present tense in indicative mood
(я бегу, ты бежишь, он бежит, мы бежим, вы бежите, они бегут),
a past form (singular, masculine: я бежал), an imperative form
@@ -346,7 +329,9 @@ a past form (singular, masculine: я бежал), an imperative form
Inherent aspect should also be specified.
- mkVerbum : Aspect -> (_,_,_,_,_,_,_,_,_ : Str) -> V ;
+ mkVerbum : Aspect -> (presentSgP1,presentSgP2,presentSgP3,
+ presentPlP1,presentPlP2,presentPlP3,
+ pastSgMasculine,imperative,infinitive: Str) -> V ;
@@ -362,7 +347,8 @@ So the definition for verb любить looks like:
regV Imperfective Second люб лю любил люби любить;
- regV :Aspect -> Conjugation -> (_,_,_,_,_ : Str) -> V ;
+ regV :Aspect -> Conjugation -> (stemPresentSgP1,endingPresentSgP1,
+ pastSgP1,imperative,infinitive : Str) -> V ;
@@ -384,6 +370,10 @@ a particle can be included in a V.
tvDirDir : V -> V3 ;
+
+The definitions should not bother the user of the API. So they are
+hidden from the document.
+
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsSpa.html b/lib/resource-1.0/doc/gfdoc/ParadigmsSpa.html
index 7374df770..af4879cdf 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsSpa.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsSpa.html
@@ -6,7 +6,7 @@
Spanish Lexical Paradigms
-Last update: 2006-06-15 16:29:51 CEST
+Last update: 2006-06-22 21:33:43 CEST
@@ -44,10 +44,10 @@ gfdoc - a rudimentary GF document generator.
(c) Aarne Ranta (aarne@cs.chalmers.se) 2002 under GNU GPL.
-Aarne Ranta 2003
+Aarne Ranta 2004 - 2006
-This is an API to the user of the resource grammar
+This is an API for the user of the resource grammar
for adding lexical items. It gives functions for forming
expressions of open categories: nouns, adjectives, verbs.
@@ -65,7 +65,9 @@ than stems, as string arguments of the paradigms.
The structure of functions for each word class C is the following:
first we give a handful of patterns that aim to cover all
regular cases. Then we give a worst-case function mkC, which serves as an
-escape to construct the most irregular words of type C.
+escape to construct the most irregular words of type C. For
+verbs, there is a fairly complete list of irregular verbs in
+IrregSpa.
resource ParadigmsSpa =
@@ -108,7 +110,7 @@ To abstract over number names, we define the following.
Prepositions used in many-argument functions are either strings
(including the 'accusative' empty string) or strings that
amalgamate with the following word (the 'genitive' de and the
-'dative' ).
+'dative' a).
Prep : Type ;
@@ -127,7 +129,7 @@ Worst case: two forms (singular + plural),
and the gender.
- mkN : (_,_ : Str) -> Gender -> N ; -- uomo, uomini, masculine
+ mkN : (_,_ : Str) -> Gender -> N ; -- bastn, bastones, masculine
@@ -155,7 +157,7 @@ To force a different gender, use one of the following functions.
Compound nouns
Some nouns are ones where the first part is inflected as a noun but
-the second part is not inflected. e.g. numro de tlphone.
+the second part is not inflected. e.g. nmero de telfono.
They could be formed in syntax, but we give a shortcut here since
they are frequent in lexica.
@@ -202,8 +204,8 @@ and PrepNP constructions to build phrases like this.
Proper names need a string and a gender.
- mkPN : Str -> Gender -> PN ; -- Jean
- regPN : Str -> PN ; -- masculine
+ mkPN : Str -> Gender -> PN ; -- Juan
+ regPN : Str -> PN ; -- feminine for "-a", otherwise masculine
@@ -221,7 +223,7 @@ Non-comparison one-place adjectives need five forms in the worst
case (masc and fem singular, masc plural, adverbial).
- mkA : (solo,sola,soli,sole, solamente : Str) -> A ;
+ mkA : (solo,sola,solos,solas, solamiento : Str) -> A ;
@@ -236,7 +238,7 @@ masculine singular. The types of adjectives that are recognized are
These functions create postfix adjectives. To switch
them to prefix ones (i.e. ones placed before the noun in
-modification, as in petite maison), the following function is
+modification, as in bueno vino), the following function is
provided.
@@ -364,9 +366,9 @@ Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
- mkV3 : V -> Prep -> Prep -> V3 ; -- parler, , de
- dirV3 : V -> Prep -> V3 ; -- donner,_,
- dirdirV3 : V -> V3 ; -- donner,_,_
+ mkV3 : V -> Prep -> Prep -> V3 ; -- hablar, a, di
+ dirV3 : V -> Prep -> V3 ; -- dar,(accusative),a
+ dirdirV3 : V -> V3 ; -- dar,(dative),(accusative)
@@ -379,9 +381,9 @@ questions, verb phrases, and adjectives.
mkV0 : V -> V0 ;
mkVS : V -> VS ;
mkV2S : V -> Prep -> V2S ;
- mkVV : V -> VV ; -- plain infinitive: "je veux parler"
- deVV : V -> VV ; -- "j'essaie de parler"
- aVV : V -> VV ; -- "j'arrive parler"
+ mkVV : V -> VV ; -- plain infinitive: "quiero hablar"
+ deVV : V -> VV ; -- "terminar de hablar"
+ aVV : V -> VV ; -- "aprender a hablar"
mkV2V : V -> Prep -> Prep -> V2V ;
mkVA : V -> VA ;
mkV2A : V -> Prep -> Prep -> V2A ;
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsSwe.html b/lib/resource-1.0/doc/gfdoc/ParadigmsSwe.html
index 8e2cf1565..ca59a1f7d 100644
--- a/lib/resource-1.0/doc/gfdoc/ParadigmsSwe.html
+++ b/lib/resource-1.0/doc/gfdoc/ParadigmsSwe.html
@@ -6,7 +6,7 @@
Swedish Lexical Paradigms
-Last update: 2006-06-15 16:03:55 CEST
+Last update: 2006-06-22 21:39:41 CEST
@@ -34,7 +34,6 @@
- Three-place verbs
- Other complement patterns
-Aarne Ranta 2003 +Aarne Ranta 2001 - 2006
-This is an API to the user of the resource grammar +This is an API for the user of the resource grammar for adding lexical items. It gives functions for forming expressions of open categories: nouns, adjectives, verbs.
@@ -69,8 +68,8 @@ first we give a handful of patterns that aim to cover all regular cases. Then we give a worst-case functionmkC, which serves as an
escape to construct the most irregular words of type C.
However, this function should only seldom be needed: we have a
-separate module IrregularEng, which covers all irregularly inflected
-words.
+separate module IrregSwe,
+which covers many irregular verbs.
resource ParadigmsSwe =
@@ -176,7 +175,7 @@ such as fotboll.
Relational nouns
-Relational nouns (daughter of x) need a preposition.
+Relational nouns (dotter till x) need a preposition.
mkN2 : N -> Prep -> N2 ;
@@ -195,7 +194,8 @@ Use the function mkPreposition or see the section on prepositions b
form other prepositions.
-Three-place relational nouns (the connection from x to y) need two prepositions.
+Three-place relational nouns (frbindelse frn x till y)
+need two prepositions.
mkN3 : N -> Prep -> Prep -> N3 ;
@@ -205,7 +205,7 @@ Three-place relational nouns (the connection from x to y) need two prepos
Relational common noun phrases
In some cases, you may want to make a complex CN into a
-relational noun (e.g. the old town hall of). However, N2 and
+relational noun (e.g. den fre detta maken till). However, N2 and
N3 are purely lexical categories. But you can use the AdvCN
and PrepNP constructions to build phrases like this.
@@ -286,11 +286,12 @@ Two-place adjectives need a preposition for their second argument.
Adverbs
Adverbs are not inflected. Most lexical ones have position
-after the verb. Some can be preverbal (e.g. always).
+after the verb. Some can be preverbal in subordinate position
+(e.g. alltid).
- mkAdv : Str -> Adv ;
- mkAdV : Str -> AdV ;
+ mkAdv : Str -> Adv ; -- hr
+ mkAdV : Str -> AdV ; -- alltid
@@ -331,7 +332,7 @@ It is not really more powerful than the new implementation of
-There is an extensive list of irregular verbs in the module IrregularSwe.
+There is an extensive list of irregular verbs in the module IrregSwe.
In practice, it is enough to give three forms, as in school books.
@@ -377,9 +378,9 @@ Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent.
- mkV3 : V -> Prep -> Prep -> V3 ; -- tala med om
- dirV3 : V -> Prep -> V3 ; -- ge _ till
- dirdirV3 : V -> V3 ; -- ge _ _
+ mkV3 : V -> Prep -> Prep -> V3 ; -- tala, med, om
+ dirV3 : V -> Prep -> V3 ; -- ge, (acc),till
+ dirdirV3 : V -> V3 ; -- ge, (dat), (acc)
@@ -416,12 +417,6 @@ as an adverb. Likewise AS, A2S, AV, A2V are just A.
AS, A2S, AV, A2V : Type ;
-
-Definitions of the paradigms
-
-The definitions should not bother the user of the API. So they are
-hidden from the document.
-
diff --git a/lib/resource-1.0/doc/gfdoc/Phrase.html b/lib/resource-1.0/doc/gfdoc/Phrase.html
index bc9bae55d..753a83229 100644
--- a/lib/resource-1.0/doc/gfdoc/Phrase.html
+++ b/lib/resource-1.0/doc/gfdoc/Phrase.html
@@ -6,7 +6,7 @@
Phrase: Phrases and Utterances
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-14 22:58:47 CEST
diff --git a/lib/resource-1.0/doc/gfdoc/Precedence.html b/lib/resource-1.0/doc/gfdoc/Precedence.html
index 63b421529..b60db3700 100644
--- a/lib/resource-1.0/doc/gfdoc/Precedence.html
+++ b/lib/resource-1.0/doc/gfdoc/Precedence.html
@@ -13,7 +13,7 @@
-Last update: 2005-11-23 09:16:18 CET
+Last update: 2005-11-17 17:36:49 CET
Produced by
diff --git a/lib/resource-1.0/doc/gfdoc/Predef.html b/lib/resource-1.0/doc/gfdoc/Predef.html
index 60a36d440..a8703dd28 100644
--- a/lib/resource-1.0/doc/gfdoc/Predef.html
+++ b/lib/resource-1.0/doc/gfdoc/Predef.html
@@ -6,7 +6,7 @@
Predefined functions for concrete syntax
-Last update: 2006-02-27 09:41:31 CET
+Last update: 2006-02-25 22:19:20 CET
diff --git a/lib/resource-1.0/doc/gfdoc/PredefAbs.html b/lib/resource-1.0/doc/gfdoc/PredefAbs.html
index 8bd03dae2..8277d65d6 100644
--- a/lib/resource-1.0/doc/gfdoc/PredefAbs.html
+++ b/lib/resource-1.0/doc/gfdoc/PredefAbs.html
@@ -13,7 +13,7 @@
-Last update: 2006-06-02 17:49:44 CEST
+Last update: 2006-06-03 10:54:51 CEST
Produced by
diff --git a/lib/resource-1.0/doc/gfdoc/Predication.html b/lib/resource-1.0/doc/gfdoc/Predication.html
index 3278694ac..e8ef2e02b 100644
--- a/lib/resource-1.0/doc/gfdoc/Predication.html
+++ b/lib/resource-1.0/doc/gfdoc/Predication.html
@@ -6,7 +6,7 @@
A Small Predication Library
-Last update: 2006-02-28 09:26:58 CET
+Last update: 2006-02-25 23:46:32 CET
diff --git a/lib/resource-1.0/doc/gfdoc/Prelude.html b/lib/resource-1.0/doc/gfdoc/Prelude.html
index 6f1bbde29..9874ebde7 100644
--- a/lib/resource-1.0/doc/gfdoc/Prelude.html
+++ b/lib/resource-1.0/doc/gfdoc/Prelude.html
@@ -6,7 +6,7 @@
The GF Prelude
-Last update: 2006-02-27 09:41:31 CET
+Last update: 2006-02-25 22:31:06 CET
diff --git a/lib/resource-1.0/doc/gfdoc/Question.html b/lib/resource-1.0/doc/gfdoc/Question.html
index 5c0446cb2..b9c7e8b74 100644
--- a/lib/resource-1.0/doc/gfdoc/Question.html
+++ b/lib/resource-1.0/doc/gfdoc/Question.html
@@ -6,7 +6,7 @@
Question: Questions and Interrogative Pronouns
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:22:41 CEST
@@ -52,7 +52,7 @@ determiners.
More IP, IDet, and IAdv are defined in
-Structural.
+Structural.
}
diff --git a/lib/resource-1.0/doc/gfdoc/Relative.html b/lib/resource-1.0/doc/gfdoc/Relative.html
index 1ea237386..1111923e5 100644
--- a/lib/resource-1.0/doc/gfdoc/Relative.html
+++ b/lib/resource-1.0/doc/gfdoc/Relative.html
@@ -6,7 +6,7 @@
Relative clauses and pronouns
-Last update: 2006-01-25 12:10:58 CET
+Last update: 2006-06-22 19:23:30 CEST
@@ -35,8 +35,9 @@ a pronoun similar to such that.
-The more proper ways are from a verb phrase (formed in Verb)
-or a sentence with a missing noun phrase (formed in Sentence).
+The more proper ways are from a verb phrase
+(formed in Verb) or a sentence
+with a missing noun phrase (formed in Sentence).
RelVP : RP -> VP -> RCl ; -- who loves John
diff --git a/lib/resource-1.0/doc/gfdoc/Sentence.html b/lib/resource-1.0/doc/gfdoc/Sentence.html
index 2d2be7eed..d6b011032 100644
--- a/lib/resource-1.0/doc/gfdoc/Sentence.html
+++ b/lib/resource-1.0/doc/gfdoc/Sentence.html
@@ -6,7 +6,7 @@
Sentence: Sentences, Clauses, and Imperatives
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:24:56 CEST
@@ -37,7 +37,8 @@ gfdoc - a rudimentary GF document generator.
The NP VP predication rule form a clause whose linearization
gives a table of all tense variants, positive and negative.
-Clauses are converted to S (with fixed tense) in Tensed.
+Clauses are converted to S (with fixed tense) with the
+UseCl function below.
fun
@@ -99,7 +100,7 @@ subjects and (adverbial) complements.
These are the 2 x 4 x 4 = 16 forms generated by different
combinations of tense, polarity, and
-anteriority, which are defined in Tense.
+anteriority, which are defined in Common.
fun
@@ -110,27 +111,6 @@ anteriority, which are defined in Tense.
}
-
-Examples for English S/Cl:
-
-
-Pres Simul Pos ODir : he sleeps
-Pres Simul Neg ODir : he doesn't sleep
-Pres Anter Pos ODir : he has slept
-Pres Anter Neg ODir : he hasn't slept
-Past Simul Pos ODir : he slept
-Past Simul Neg ODir : he didn't sleep
-Past Anter Pos ODir : he had slept
-Past Anter Neg ODir : he hadn't slept
-Fut Simul Pos ODir : he will sleep
-Fut Simul Neg ODir : he won't sleep
-Fut Anter Pos ODir : he will have slept
-Fut Anter Neg ODir : he won't have slept
-Cond Simul Pos ODir : he would sleep
-Cond Simul Neg ODir : he wouldn't sleep
-Cond Anter Pos ODir : he would have slept
-Cond Anter Neg ODir : he wouldn't have slept
-
diff --git a/lib/resource-1.0/doc/gfdoc/Structural.html b/lib/resource-1.0/doc/gfdoc/Structural.html
index f7c9c8a96..dad685866 100644
--- a/lib/resource-1.0/doc/gfdoc/Structural.html
+++ b/lib/resource-1.0/doc/gfdoc/Structural.html
@@ -6,7 +6,7 @@
Structural: Structural Words
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-22 19:26:01 CEST
@@ -23,8 +23,9 @@ gfdoc - a rudimentary GF document generator.
Here we have some words belonging to closed classes and appearing
in all languages we have considered.
-Sometimes they are not really meaningful, e.g. we_Pron in Spanish
-should be replaced by masculine and feminine variants.
+Sometimes more distinctions are needed, e.g. we_Pron in Spanish
+should be replaced by masculine and feminine variants, found in
+ExtraSpa.
abstract Structural = Cat ** {
diff --git a/lib/resource-1.0/doc/gfdoc/Symbol.html b/lib/resource-1.0/doc/gfdoc/Symbol.html
index 5fef735c1..80ab280b2 100644
--- a/lib/resource-1.0/doc/gfdoc/Symbol.html
+++ b/lib/resource-1.0/doc/gfdoc/Symbol.html
@@ -6,7 +6,7 @@
Symbolic expressions
-Last update: 2006-03-17 14:11:37 CET
+Last update: 2006-03-17 12:02:40 CET
diff --git a/lib/resource-1.0/doc/gfdoc/Text.html b/lib/resource-1.0/doc/gfdoc/Text.html
index 8ab03c9ec..963b315d3 100644
--- a/lib/resource-1.0/doc/gfdoc/Text.html
+++ b/lib/resource-1.0/doc/gfdoc/Text.html
@@ -6,7 +6,7 @@
Text: Texts
-Last update: 2006-06-15 09:19:39 CEST
+Last update: 2006-06-14 23:03:43 CEST
diff --git a/lib/resource-1.0/doc/gfdoc/Verb.html b/lib/resource-1.0/doc/gfdoc/Verb.html
index ce260bf76..5d47cd62b 100644
--- a/lib/resource-1.0/doc/gfdoc/Verb.html
+++ b/lib/resource-1.0/doc/gfdoc/Verb.html
@@ -6,7 +6,7 @@
The construction of verb phrases
-Last update: 2006-02-27 09:41:31 CET
+Last update: 2006-02-26 18:02:58 CET
diff --git a/lib/resource-1.0/doc/index.html b/lib/resource-1.0/doc/index.html
index ff9cb8911..91b5fb752 100644
--- a/lib/resource-1.0/doc/index.html
+++ b/lib/resource-1.0/doc/index.html
@@ -7,7 +7,7 @@
GF Resource Grammar Library v. 1.0
Author: Aarne Ranta <aarne (at) cs.chalmers.se>
-Last update: Wed Jun 21 18:21:48 2006
+Last update: Fri Jun 23 00:13:38 2006
@@ -524,5 +524,5 @@ examples are from multimodal/old, which is a reduced-size API.
-
+