+Produced by +gfdoc - a rudimentary GF document generator. +(c) Aarne Ranta (aarne@cs.chalmers.se) 2002 under GNU GPL. +
+
+This module defines some grammatical functions that give shortcuts to
+typical constructions. Constructors and the
+language-specific Paradigms modules are usually needed
+to construct arguments of these functions.
+
+ incomplete resource Combinators = open Grammar in {
+
+ oper
+
+
+
+
+ pred : overload {
+ pred : V -> NP -> Cl ;
+ pred : V2 -> NP -> NP -> Cl ;
+ pred : V3 -> NP -> NP -> NP -> Cl ;
+ pred : V -> NP -> NP -> Cl ;
+ pred : A -> NP -> Cl ;
+ pred : A2 -> NP -> NP -> Cl ;
+ pred : A -> NP -> NP -> Cl ;
+ pred : N -> NP -> Cl ;
+ pred : CN -> NP -> Cl ;
+ pred : NP -> NP -> Cl ;
+ pred : N -> NP -> NP -> Cl ;
+ pred : Adv -> NP -> Cl ;
+ pred : Prep -> NP -> NP -> Cl
+ } ;
+
+
+
+
+ app : overload {
+ app : N -> NP ;
+ app : N2 -> NP -> NP ;
+ app : N3 -> NP -> NP -> NP ;
+ app : N2 -> NP -> NP -> NP ;
+ app : N2 -> N -> CN
+ } ;
+
+
+
+
+ coord : overload {
+ coord : Conj -> Adv -> Adv -> Adv ;
+ coord : Conj -> AP -> AP -> AP ;
+ coord : Conj -> NP -> NP -> NP ;
+ coord : Conj -> S -> S -> S ;
+ coord : DConj -> Adv -> Adv -> Adv ;
+ coord : DConj -> AP -> AP -> AP ;
+ coord : DConj -> NP -> NP -> NP ;
+ coord : DConj -> S -> S -> S ;
+ coord : Conj -> ListAdv -> Adv ;
+ coord : Conj -> ListAP -> AP ;
+ coord : Conj -> ListNP -> NP ;
+ coord : Conj -> ListS -> S ;
+ coord : DConj -> ListAdv -> Adv ;
+ coord : DConj -> ListAP -> AP ;
+ coord : DConj -> ListNP -> NP ;
+ coord : DConj -> ListS -> S
+
+ } ;
+
+
+
+
+ mod : overload {
+ mod : A -> N -> CN ;
+ mod : AP -> CN -> CN ;
+ mod : AdA -> A -> AP ;
+ mod : Quant -> N -> NP ;
+ mod : Quant -> CN -> NP ;
+ mod : Predet -> N -> NP ;
+ mod : Numeral -> N -> NP
+
+ } ;
+
+
+
++This is not in ground API, because it would destroy parsing. +
++ appendText : Text -> Text -> Text ; ++ + + + + diff --git a/lib/resource-1.0/doc/gfdoc/Common.html b/lib/resource-1.0/doc/gfdoc/Common.html index 9a348ba29..3ab63caf9 100644 --- a/lib/resource-1.0/doc/gfdoc/Common.html +++ b/lib/resource-1.0/doc/gfdoc/Common.html @@ -6,7 +6,7 @@
mkText : overload {
mkText : Text ; -- [empty text]
- mkText : Phr -> Text -> Text; -- John walks. ...
+ mkText : Phr -> Text -> Text -- John walks. ...
} ;
mkPhr : overload {
@@ -116,8 +116,8 @@ to this.
mkS : Conj -> S -> S -> S ; -- John walks and Mary talks
mkS : DConj -> S -> S -> S ; -- either I leave or you come
mkS : Conj -> ListS -> S ; -- John walks, Mary talks, and Bob runs
- mkS : DConj -> ListS -> S -- either I leave, you come, or he runs
-
+ mkS : DConj -> ListS -> S ; -- either I leave, you come, or he runs
+ mkS : Adv -> S -> S -- today, I will sleep
} ;
mkCl : overload {
diff --git a/lib/resource-1.0/doc/gfdoc/Grammar.html b/lib/resource-1.0/doc/gfdoc/Grammar.html
index d324f7076..93e4c82c3 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-22 19:08:55 CEST
+Last update: 2006-06-26 13:24:17 CEST
Idiom: Idiomatic Expressions
-Last update: 2006-06-14 22:57:19 CEST
+Last update: 2006-06-15 09:19:39 CEST
Lang: a Test Module for the Resource Grammar
-Last update: 2006-06-22 19:09:20 CEST
+Last update: 2006-06-26 13:24:17 CEST
The Mathematics API to the Resource Grammar
-Last update: 2006-02-25 21:36:45 CET
+Last update: 2006-02-28 09:26:58 CET
Multimodal additions to the resource grammar library
-Last update: 2006-05-23 23:36:59 CEST
+Last update: 2006-05-24 15:08:56 CEST
Noun: Nouns, noun phrases, and determiners
-Last update: 2006-06-22 19:19:41 CEST
+Last update: 2006-06-26 13:24:17 CEST
Numerals
-Last update: 2006-06-22 19:22:05 CEST
+Last update: 2006-06-26 13:24:17 CEST
Danish Lexical Paradigms
-Last update: 2006-06-22 20:53:41 CEST
+Last update: 2006-06-26 13:24:17 CEST
English Lexical Paradigms
-Last update: 2006-06-22 20:54:15 CEST
+Last update: 2006-11-23 14:34:29 CET
Prep is used.
Nouns
+Nouns are constructed by the function mkN, which takes a varying
+number of arguments.
+
+
+ mkN : overload {
+
+
+
Worst case: give all four forms.
- mkN : (man,men,man's,men's : Str) -> N ;
+ mkN : (man,men,man's,men's : Str) -> N ;
@@ -134,14 +142,14 @@ The regular function captures the variants for nouns ending with
fly - flies (but toy - toys),
- regN : Str -> N ;
+ mkN : (flash : Str) -> N ;
In practice the worst case is just: give singular and plural nominative.
- mk2N : (man,men : Str) -> N ;
+ mkN : (man,men : Str) -> N ;
@@ -150,7 +158,7 @@ All nouns created by the previous functions are marked as
function:
- genderN : Gender -> N -> N ;
+ mkN : Gender -> N -> N ;
@@ -160,7 +168,8 @@ A compound noun ia an uninflected string attached to an inflected noun,
such as baby boom, chief executive officer.
- compoundN : Str -> N -> N ;
+ mkN : Str -> N -> N
+ } ;
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsFin.html b/lib/resource-1.0/doc/gfdoc/ParadigmsFin.html
index 346b9e625..9472a00f2 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-22 20:46:07 CEST
+Last update: 2006-11-13 16:54:32 CET
-A special case are nouns with no alternations: +A special case: the vowel harmony is inferred from the last letter, -which must be one of o, u, , y. +which must be one of o, u, , y. Regular weak-grade alternation +is performed.
nTalo : (talo : Str) -> N ;
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsFre.html b/lib/resource-1.0/doc/gfdoc/ParadigmsFre.html
index 5f96b5123..15ff0718c 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-22 21:02:44 CEST
+Last update: 2006-06-26 13:24:17 CEST
German Lexical Paradigms
-Last update: 2006-06-22 20:58:18 CEST
+Last update: 2006-11-13 16:54:32 CET
Italian Lexical Paradigms
-Last update: 2006-06-22 21:07:00 CEST
+Last update: 2006-12-07 11:27:52 CET
++The following prepositions also have special contracted forms. +
++ con_Prep, da_Prep, in_Prep, su_Prep : Prep ; ++
diff --git a/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html b/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html index ebd816456..c9793fc17 100644 --- a/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html +++ b/lib/resource-1.0/doc/gfdoc/ParadigmsNor.html @@ -6,7 +6,7 @@
- mkVerbum : Aspect -> (presentSgP1,presentSgP2,presentSgP3,
+ mkV : Aspect -> (presentSgP1,presentSgP2,presentSgP3,
presentPlP1,presentPlP2,presentPlP3,
pastSgMasculine,imperative,infinitive: Str) -> V ;
@@ -352,14 +353,6 @@ regV Imperfective Second люб лю любил люби
-For writing an application grammar one usualy doesn't need
-the whole inflection table, since each verb is used in
-a particular context that determines some of the parameters
-(Tense and Voice while Aspect is fixed from the beginning) for certain usage.
-The V type, that have these parameters fixed.
-We can extract the V from the lexicon.
-mkV: Verbum -> Voice -> V ;
-mkPresentV: Verbum -> Voice -> V ;
Two-place verbs, and the special case with direct object. Notice that
a particle can be included in a V.
- UttS : S -> Utt ; -- John walks - UttQS : QS -> Utt ; -- is it good - UttImpSg : Pol -> Imp -> Utt; -- (don't) help yourself - UttImpPl : Pol -> Imp -> Utt; -- (don't) help yourselves + UttS : S -> Utt ; -- John walks + UttQS : QS -> Utt ; -- is it good + UttImpSg : Pol -> Imp -> Utt; -- (don't) help yourself + UttImpPl : Pol -> Imp -> Utt; -- (don't) help yourselves + UttImpPol : Pol -> Imp -> Utt ; -- (don't) help (polite)
diff --git a/lib/resource-1.0/doc/gfdoc/Precedence.html b/lib/resource-1.0/doc/gfdoc/Precedence.html index b60db3700..63b421529 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-17 17:36:49 CET +Last update: 2005-11-23 09:16:18 CET
Produced by diff --git a/lib/resource-1.0/doc/gfdoc/Predef.html b/lib/resource-1.0/doc/gfdoc/Predef.html index a8703dd28..693d078e2 100644 --- a/lib/resource-1.0/doc/gfdoc/Predef.html +++ b/lib/resource-1.0/doc/gfdoc/Predef.html @@ -6,7 +6,7 @@
param PBool = PTrue | PFalse ;
- oper Int : Type = variants {} ; -- the type of integers
- oper Ints : Int -> Type = variants {} ; -- the type of integers from 0 to n
+ oper Error : Type = variants {} ; -- the empty type
+ oper Int : Type = variants {} ; -- the type of integers
+ oper Ints : Int -> Type = variants {} ; -- the type of integers from 0 to n
+ oper error : Str -> Error = variants {} ; -- forms error message
oper length : Tok -> Int = variants {} ; -- length of string
oper drop : Int -> Tok -> Tok = variants {} ; -- drop prefix of length
oper take : Int -> Tok -> Tok = variants {} ; -- take prefix of length
diff --git a/lib/resource-1.0/doc/gfdoc/PredefAbs.html b/lib/resource-1.0/doc/gfdoc/PredefAbs.html
index 8277d65d6..8bd03dae2 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-03 10:54:51 CEST
+Last update: 2006-06-02 17:49:44 CEST
Produced by
diff --git a/lib/resource-1.0/doc/gfdoc/Predication.html b/lib/resource-1.0/doc/gfdoc/Predication.html
index e8ef2e02b..3278694ac 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-25 23:46:32 CET
+Last update: 2006-02-28 09:26:58 CET
The GF Prelude
-Last update: 2006-02-25 22:31:06 CET
+Last update: 2006-02-27 09:41:31 CET
Question: Questions and Interrogative Pronouns
-Last update: 2006-06-22 19:22:41 CEST
+Last update: 2006-06-26 13:24:17 CEST
Relative clauses and pronouns
-Last update: 2006-06-22 19:23:30 CEST
+Last update: 2006-06-26 13:24:17 CEST
Sentence: Sentences, Clauses, and Imperatives
-Last update: 2006-06-22 19:24:56 CEST
+Last update: 2006-12-18 16:59:02 CET
- SlashV2 : NP -> V2 -> Slash ; -- (whom) he sees
- SlashVVV2 : NP -> VV -> V2 -> Slash; -- (whom) he wants to see
- AdvSlash : Slash -> Adv -> Slash ; -- (whom) he sees tomorrow
- SlashPrep : Cl -> Prep -> Slash ; -- (with whom) he walks
+ SlashV2 : NP -> V2 -> Slash ; -- (whom) he sees
+ SlashVVV2 : NP -> VV -> V2 -> Slash; -- (whom) he wants to see
+ AdvSlash : Slash -> Adv -> Slash ; -- (whom) he sees tomorrow
+ SlashPrep : Cl -> Prep -> Slash ; -- (with whom) he walks
@@ -107,6 +107,13 @@ anteriority, which are defined in Common.
UseCl : Tense -> Ant -> Pol -> Cl -> S ;
UseQCl : Tense -> Ant -> Pol -> QCl -> QS ;
UseRCl : Tense -> Ant -> Pol -> RCl -> RS ;
+
+
++An adverb can be added to the beginning of a sentence. +
+
+ AdvS : Adv -> S -> S ; -- today, I will go home
}
diff --git a/lib/resource-1.0/doc/gfdoc/Structural.html b/lib/resource-1.0/doc/gfdoc/Structural.html
index dad685866..bf3306bff 100644
--- a/lib/resource-1.0/doc/gfdoc/Structural.html
+++ b/lib/resource-1.0/doc/gfdoc/Structural.html
@@ -6,7 +6,7 @@
+ SymbNum : Symb -> Num ; -- n + SymbOrd : Symb -> Ord ; -- n'th ++ +
A symbol list has at least two elements. The last two are separated @@ -66,6 +75,12 @@ This produces x, y and z, in English. fun MkSymb : String -> Symb ; + +
+ +
+ CNIntNP : CN -> Int -> NP ; -- level 53 (covered by CNNumNP)
}
diff --git a/lib/resource-1.0/doc/gfdoc/Symbolic.html b/lib/resource-1.0/doc/gfdoc/Symbolic.html
new file mode 100644
index 000000000..1b606f2a5
--- /dev/null
+++ b/lib/resource-1.0/doc/gfdoc/Symbolic.html
@@ -0,0 +1,43 @@
+
+
+
+
++Produced by +gfdoc - a rudimentary GF document generator. +(c) Aarne Ranta (aarne@cs.chalmers.se) 2002 under GNU GPL. +
+
+ incomplete resource Symbolic = open Symbol, Grammar in {
+
+ oper
+ symb : overload {
+ symb : Str -> NP ; -- x
+ symb : Int -> NP ; -- 23
+ symb : Float -> NP ; -- 0.99
+ symb : N -> Int -> NP ; -- level 4
+ symb : CN -> Num -> NP ; -- level four
+ symb : Det -> N -> Str -> Str -> NP ; -- the levels i and j
+ symb : Det -> CN -> [Symb] -> NP -- the basic levels i, j, and k
+ } ;
+
+ mkSymb : Str -> Symb ;
+
+
+
+
+
+
diff --git a/lib/resource-1.0/doc/gfdoc/Text.html b/lib/resource-1.0/doc/gfdoc/Text.html
index 963b315d3..8ab03c9ec 100644
--- a/lib/resource-1.0/doc/gfdoc/Text.html
+++ b/lib/resource-1.0/doc/gfdoc/Text.html
@@ -6,7 +6,7 @@
The GF Resource Grammar Library defines the basic grammar of ten languages: @@ -52,13 +19,28 @@ A still incomplete implementation for Arabic is also included.
-New: User manual of the resource library. +New in Version 1.1
+C
+ can be built by the function mkC.
+
-Notice. This document concerns the API v. 1.0 released
-on June 22, 2006.
+ An example of use is logic.
+ The API of version 1.0 remains valid and can be used in combination with this.
Inger Andersson and Therese Soderberg (Spanish morphology), @@ -93,14 +75,12 @@ Saara Myllyntausta, Wanjiku Ng'ang'a, Jordi Saludes.
-The GF Resource Grammar Library is open-source software licensed under GNU General Public License. See the file LICENSE for more details.
-Coverage, for each language: @@ -131,7 +111,6 @@ Presentation:
Go to the main directory, compile the grammars, and run a test.
@@ -166,7 +145,6 @@ For more examples, see the Overview slides.
The make procedure does not make Arabic, but it can
be compiled in a similar way as the other languages.
Finnish, German, Romance, and Scandinavian languages are in isolatin-1. @@ -177,7 +155,6 @@ Arabic and Russian are in UTF-8.
English is in pure ASCII.
-
This API is accessible by both present and alltenses.
@@ -211,7 +188,6 @@ The documentation of the individual modules:
Grammar and Lexicon
-
@@ -297,9 +272,7 @@ gesture. Some functions for constructing demonstratives are provided.
The simplest way to get the library is to install the precompiled version @@ -321,7 +294,6 @@ library. Use one (or several) of the following packages instead: multimodal dialogue applications -
Typically, open one of
@@ -360,7 +332,6 @@ The mathematical API shares modules with
present. It is therefore not a good idea to use it in combination with
alltenses.
If you have done make in lib/resource-1.0, you will have
@@ -399,14 +370,12 @@ It is also possible to parse in Scandinavian languages
(Danish, Norwegian, Swedish) and, with enough memory (gf +RTS -K512M),
German.
These applications are meant to serve as starting points for new applications, showing how the libraries can be used in typical situations.
-The examples/bronzeage @@ -414,7 +383,6 @@ grammar set implements a language fragment based on the Swadesh list of 200 words. It is useful for things like language training.
-The examples/dialogue @@ -423,7 +391,6 @@ multimodal dialogue system. Its purpose is to serve as a prototype for applications in the TALK project.
-The examples/animal @@ -431,7 +398,6 @@ grammar set implements some queries about animals. Its purpose is to serve as a prototype for example-based grammar writing.
-Danish @@ -494,11 +460,10 @@ Spanish
Swedish
-GF Resource Grammar Library (pdf). -Printable user manual with API documentation. +Printable user manual with API documentation (version 1.0).
Grammars as Software Libraries. Slides
@@ -528,5 +493,5 @@ examples are from multimodal/old, which is a reduced-size API.