updated doc

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

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>