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

continuing with resource.txt

Browse Source
This commit is contained in:
aarne
2006-06-12 20:29:25 +00:00
parent 39c319e04e
commit 4230cd9d3f
1 changed files with 34 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

59
doc/resource.txt
View File

@@ -4,7 +4,8 @@ This document is about the
GF Resource Grammar Library. It presuppose knowledge of GF and its
module system, knowledge that can be acquired e.g. from the GF
tutorial. We start with an introduction to the library, and proceed to
covering all that one needs to know in order to use the library.
details with the aim of covering all that one needs to know
in order to use the library.
How to write one's own resource grammar (i.e. implement the API for
a new language), is covered by a separate Resource-HOWTO document.
@@ -473,23 +474,23 @@ the same tree.
The following syntax tree of the Text "John walks." gives an overview
of the structural levels.
Node Constructor Type of subtree Alternative constructors
1. TFullStop : Text TQuestMark
2. (PhrUtt : Phr
3. NoPConj : PConj but_PConj
4. (UttS : Utt UttQS
5. (UseCl : S UseQCl
6. TPres : Tense TPast
7. ASimul : Anter AAnter
8. PPos : Pol PNeg
9. (PredVP : Cl
10. (UsePN : NP UsePron, DetCN
11. john_PN) : PN mary_PN
12. (UseV : VP ComplV2, ComplV3
13. walk_V)))) : V sleep_V
14. NoVoc) : Voc please_Voc
15. TEmpty : Text
Node Constructor Value type Other constructors
-----------------------------------------------------------
1. TFullStop Text TQuestMark
2. (PhrUtt Phr
3. NoPConj PConj but_PConj
4. (UttS Utt UttQS
5. (UseCl S UseQCl
6. TPres Tense TPast
7. ASimul Anter AAnter
8. PPos Pol PNeg
9. (PredVP Cl
10. (UsePN NP UsePron, DetCN
11. john_PN) PN mary_PN
12. (UseV VP ComplV2, ComplV3
13. walk_V)))) V sleep_V
14. NoVoc) Voc please_Voc
15. TEmpty Text
Here are some examples of the results of changing constructors.
@@ -534,16 +535,17 @@ NPs and VPs. Here is a brief overview:
Noun: How to construct NPs. The main three mechanisms
for constructing NPs are
- from proper names: John
- from pronouns: we
- from common nouns by determiners: this man
The Noun module also defines the construction of common nouns. The most frequent ways are
The Noun module also defines the construction of common nouns. The most frequent ways are
- lexical noun items: man
- adjectival modification: old man
- relative clause modification: man who sleeps
- application of relational nouns: successor of the number
Verb: How to construct VPs. The main mechanism is verbs with their arguments, for instance,
- one-place verbs: walks
@@ -552,6 +554,7 @@ Verb: How to construct VPs. The main mechanism is verbs with their arguments, fo
- sentence-complement verbs: says that it is cold
- VP-complement verbs: wants to give her a kiss
A special verb is the copula, "be" in English but not even realized
by a verb in all languages.
A copula can take different kinds of complement:
@@ -560,9 +563,14 @@ A copula can take different kinds of complement:
- a noun phrase: (John is) a man
Adjective: How to constuct APs.
Adjective: How to constuct APs. The main ways are
- positive forms of adjectives: old
- comparative forms with object of comparison: older than John
Adverb: How to construct Advs. The main ways are
- from adjectives: slowly
Adverb: How to construct Advs.
===Modules and their names===
@@ -570,13 +578,13 @@ Adverb: How to construct Advs.
The resource modules are named after the kind of phrases that are constructed in them,
and they can be roughly classified by the "level" or "size" of expressions that are
formed in them:
- Larger than sentence: Text, Phrase
- Same level as sentence: Sentence, Question, Relative
- Parts of sentence: Adjective, Adverb, Noun, Verb
- Cross-cut: Conjunction
Because of mutual recursion such as embedded sentences, this classification is
Because of mutual recursion such as in embedded sentences, this classification is
not a complete order. However, no mutual dependence is needed between the
modules in a formal sense - they can all be compiled separately. This is due
to the module Cat, which defines the type system common to the other modules.
@@ -586,7 +594,8 @@ a rule such as
Verb.ComplV2 : V2 -> NP -> VP
it is enough to know the linearization type of NP (given in Cat), not what
it is enough to know the linearization type of NP (as well as those of V2 and VP, all
given in Cat). It is not necessary to know what
ways there are to build NPs (given in Noun), since all these ways must
conform to the linearization type defined in Cat.