msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity
Files
be22b7c8aabaff77a101f0051d7d429bf3b96d72
gf-core/lib/resource-1.0/doc/gfdoc/ParadigmsSwe.html
aarne be22b7c8aa documenting Quant
2006-02-02 15:24:13 +00:00

433 lines
11 KiB
HTML
Raw Blame History

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML>
<HEAD>
<META NAME="generator" CONTENT="http://txt2tags.sf.net">
</HEAD><BODY BGCOLOR="white" TEXT="black">
<FONT SIZE="4">
</FONT></CENTER>
<P></P>
<HR NOSHADE SIZE=1>
<P></P>
<UL>
<LI><A HREF="#toc1">Swedish Lexical Paradigms</A>
<UL>
<LI><A HREF="#toc2">Parameters</A>
<LI><A HREF="#toc3">Nouns</A>
<UL>
<LI><A HREF="#toc4">Compound nouns</A>
<LI><A HREF="#toc5">Relational nouns</A>
<LI><A HREF="#toc6">Relational common noun phrases</A>
<LI><A HREF="#toc7">Proper names and noun phrases</A>
</UL>
<LI><A HREF="#toc8">Adjectives</A>
<UL>
<LI><A HREF="#toc9">Two-place adjectives</A>
</UL>
<LI><A HREF="#toc10">Adverbs</A>
<LI><A HREF="#toc11">Prepositions</A>
<LI><A HREF="#toc12">Verbs</A>
<UL>
<LI><A HREF="#toc13">Verbs with a particle.</A>
<LI><A HREF="#toc14">Deponent verbs.</A>
<LI><A HREF="#toc15">Two-place verbs</A>
<LI><A HREF="#toc16">Three-place verbs</A>
<LI><A HREF="#toc17">Other complement patterns</A>
</UL>
<LI><A HREF="#toc18">Definitions of the paradigms</A>
</UL>
</UL>
<P></P>
<HR NOSHADE SIZE=1>
<P></P>
<P>
Author:
Last update: Thu Feb 2 16:24:10 2006
</P>
<P>
Produced by
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>
==
</P>
<P>
# -path=.:../scandinavian:../common:../abstract:../../prelude
</P>
<A NAME="toc1"></A>
<H1>Swedish Lexical Paradigms</H1>
<P>
Aarne Ranta 2003
</P>
<P>
This is an API to the user of the resource grammar
for adding lexical items. It gives functions for forming
expressions of open categories: nouns, adjectives, verbs.
</P>
<P>
Closed categories (determiners, pronouns, conjunctions) are
accessed through the resource syntax API, <CODE>Structural.gf</CODE>.
</P>
<P>
The main difference with <CODE>MorphoSwe.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 <CODE>IrregularEng</CODE>, which covers all irregularly inflected
words.
</P>
<PRE>
resource ParadigmsSwe =
open
(Predef=Predef),
Prelude,
CommonScand,
ResSwe,
MorphoSwe,
CatSwe in {
</PRE>
<P></P>
<A NAME="toc2"></A>
<H2>Parameters</H2>
<P>
To abstract over gender names, we define the following identifiers.
</P>
<PRE>
oper
Gender : Type ;
utrum : Gender ;
neutrum : Gender ;
</PRE>
<P></P>
<P>
To abstract over number names, we define the following.
</P>
<PRE>
Number : Type ;
singular : Number ;
plural : Number ;
</PRE>
<P></P>
<P>
To abstract over case names, we define the following.
</P>
<PRE>
Case : Type ;
nominative : Case ;
genitive : Case ;
</PRE>
<P></P>
<P>
Prepositions used in many-argument functions are just strings.
</P>
<PRE>
Preposition : Type = Str ;
</PRE>
<P></P>
<A NAME="toc3"></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 : (apa,apan,apor,aporna : Str) -&gt; N ;
</PRE>
<P></P>
<P>
The regular function takes the singular indefinite form and the gender,
and computes the other forms by a heuristic.
If in doubt, use the <CODE>cc</CODE> command to test!
</P>
<PRE>
regN : Str -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
In practice the worst case is often just: give singular and plural indefinite.
</P>
<PRE>
mk2N : (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.
</P>
<PRE>
mk1N : (bilarna : Str) -&gt; N ;
</PRE>
<P></P>
<A NAME="toc4"></A>
<H3>Compound nouns</H3>
<P>
All the functions above work quite as well to form compound nouns,
such as <I>fotboll</I>.
</P>
<A NAME="toc5"></A>
<H3>Relational nouns</H3>
<P>
Relational nouns (<I>daughter of x</I>) need a preposition.
</P>
<PRE>
mkN2 : N -&gt; Preposition -&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>the connection from x to y</I>) need two prepositions.
</P>
<PRE>
mkN3 : N -&gt; Preposition -&gt; Preposition -&gt; N3 ;
</PRE>
<P></P>
<A NAME="toc6"></A>
<H3>Relational common 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>). 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="toc7"></A>
<H3>Proper names and noun phrases</H3>
<P>
Proper names, with a regular genitive, are formed as follows
</P>
<PRE>
regPN : Str -&gt; Gender -&gt; PN ; -- John, John's
</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 ;
</PRE>
<P></P>
<A NAME="toc8"></A>
<H2>Adjectives</H2>
<P>
Adjectives may need as many as seven forms.
</P>
<PRE>
mkA : (liten, litet, lilla, sma, mindre, minst, minsta : Str) -&gt; A ;
</PRE>
<P></P>
<P>
The regular pattern works for many adjectives, e.g. those ending
with <I>ig</I>.
</P>
<PRE>
regA : Str -&gt; A ;
</PRE>
<P></P>
<P>
Just the comparison forms can be irregular.
</P>
<PRE>
irregA : (tung,tyngre,tyngst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Sometimes just the positive forms are irregular.
</P>
<PRE>
mk3A : (galen,galet,galna : Str) -&gt; A ;
mk2A : (bred,brett : Str) -&gt; A ;
</PRE>
<P></P>
<A NAME="toc9"></A>
<H3>Two-place adjectives</H3>
<P>
Two-place adjectives need a preposition for their second argument.
</P>
<PRE>
mkA2 : A -&gt; Preposition -&gt; A2 ;
</PRE>
<P></P>
<A NAME="toc10"></A>
<H2>Adverbs</H2>
<P>
Adverbs are not inflected. Most lexical ones have position
after the verb. Some can be preverbal (e.g. <I>always</I>).
</P>
<PRE>
mkAdv : Str -&gt; Adv ;
mkAdV : Str -&gt; AdV ;
</PRE>
<P></P>
<P>
Adverbs modifying adjectives and sentences can also be formed.
</P>
<PRE>
mkAdA : Str -&gt; AdA ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<H2>Prepositions</H2>
<P>
A preposition is just a string.
</P>
<PRE>
mkPreposition : Str -&gt; Preposition ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<H2>Verbs</H2>
<P>
The worst case needs five forms.
</P>
<PRE>
mkV : (supa,super,sup,söp,supit,supen : Str) -&gt; V ;
</PRE>
<P></P>
<P>
The 'regular verb' function 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
the third in other cases (<I>bo</I> - <I>bor</I> - <I>bodde</I> - <I>bott</I>).
</P>
<PRE>
regV : (talar : 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.
</P>
<PRE>
mk2V : (leka,lekte : Str) -&gt; V ;
</PRE>
<P></P>
<P>
There is an extensive list of irregular verbs in the module <CODE>IrregularSwe</CODE>.
In practice, it is enough to give three forms, as in school books.
</P>
<PRE>
irregV : (dricka, drack, druckit : Str) -&gt; V ;
</PRE>
<P></P>
<A NAME="toc13"></A>
<H3>Verbs with a particle.</H3>
<P>
The particle, such as in <I>passa på</I>, is given as a string.
</P>
<PRE>
partV : V -&gt; Str -&gt; V ;
</PRE>
<P></P>
<A NAME="toc14"></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>.
</P>
<PRE>
depV : V -&gt; V ;
reflV : V -&gt; V ;
</PRE>
<P></P>
<A NAME="toc15"></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; Preposition -&gt; V2 ;
dirV2 : V -&gt; V2 ;
</PRE>
<P></P>
<A NAME="toc16"></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; Preposition -&gt; Preposition -&gt; V3 ; -- tala med om
dirV3 : V -&gt; Preposition -&gt; V3 ; -- ge _ till
dirdirV3 : V -&gt; V3 ; -- ge _ _
</PRE>
<P></P>
<A NAME="toc17"></A>
<H3>Other complement patterns</H3>
<P>
Verbs and adjectives can take complements such as sentences,
questions, verb phrases, and adjectives.
</P>
<PRE>
mkV0 : V -&gt; V0 ;
mkVS : V -&gt; VS ;
mkV2S : V -&gt; Str -&gt; V2S ;
mkVV : V -&gt; VV ;
mkV2V : V -&gt; Str -&gt; Str -&gt; V2V ;
mkVA : V -&gt; VA ;
mkV2A : V -&gt; Str -&gt; V2A ;
mkVQ : V -&gt; VQ ;
mkV2Q : V -&gt; Str -&gt; V2Q ;
mkAS : A -&gt; AS ;
mkA2S : A -&gt; Str -&gt; A2S ;
mkAV : A -&gt; AV ;
mkA2V : A -&gt; Str -&gt; A2V ;
</PRE>
<P></P>
<P>
Notice: categories <CODE>V2S, V2V, V2A, 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 ;
AS, A2S, AV, A2V : Type ;
</PRE>
<P></P>
<A NAME="toc18"></A>
<H2>Definitions of the paradigms</H2>
<P>
The definitions should not bother the user of the API. So they are
hidden from the document.
</P>
<!-- html code generated by txt2tags 2.0 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc swedish/ParadigmsSwe.txt -->
</BODY></HTML>
View Git Blame Copy Permalink