GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-04-10 13:29:32 -06:00
Code Issues Packages Projects Releases Wiki Activity
Files
06eb01ac7ea015c05a899598244f90cdabfc4c49
gf-core/lib/resource/doc/gfdoc/ParadigmsSwe.html
aarne 4ea58bce2c resource lib name changed
2007-12-12 20:30:11 +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">
<TITLE> Swedish Lexical Paradigms</TITLE>
</HEAD><BODY BGCOLOR="white" TEXT="black">
<P ALIGN="center"><CENTER><H1> Swedish Lexical Paradigms</H1>
<FONT SIZE="4">
<I>Last update: 2007-07-06 09:20:11 CEST</I><BR>
</FONT></CENTER>
<P></P>
<HR NOSHADE SIZE=1>
<P></P>
<UL>
<LI><A HREF="#toc1">Parameters</A>
<LI><A HREF="#toc2">Nouns</A>
<UL>
<LI><A HREF="#toc3">Relational nouns</A>
<LI><A HREF="#toc4">Relational common noun phrases</A>
<LI><A HREF="#toc5">Proper names and noun phrases</A>
</UL>
<LI><A HREF="#toc6">Adjectives</A>
<UL>
<LI><A HREF="#toc7">Two-place adjectives</A>
</UL>
<LI><A HREF="#toc8">Adverbs</A>
<LI><A HREF="#toc9">Verbs</A>
<UL>
<LI><A HREF="#toc10">Deponent verbs.</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>
<P></P>
<HR NOSHADE SIZE=1>
<P></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>
Aarne Ranta 2001 - 2006
</P>
<P>
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.
</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 <A HREF="../../swedish/IrregSwe"><CODE>IrregSwe</CODE></A>,
which covers many irregular verbs.
</P>
<PRE>
resource ParadigmsSwe =
open
(Predef=Predef),
Prelude,
CommonScand,
ResSwe,
MorphoSwe,
CatSwe in {
</PRE>
<P></P>
<A NAME="toc1"></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 can be constructed from strings.
</P>
<PRE>
mkPrep : Str -&gt; Prep ;
noPrep : Prep ; -- empty string
</PRE>
<P></P>
<A NAME="toc2"></A>
<H2>Nouns</H2>
<P>
The following overloaded paradigm takes care of all noun formation.
</P>
<PRE>
mkN : overload {
</PRE>
<P></P>
<P>
The one-argument case takes the singular indefinite form and computes
the other forms and the gender by a simple heuristic. The heuristic is currently
to treat all words ending with <I>a</I> like <I>apa-apor</I>, with <I>e</I> like <I>rike-riken</I>,
and otherwise like <I>bil-bilar</I>.
</P>
<PRE>
mkN : (apa : Str) -&gt; N ;
</PRE>
<P></P>
<P>
The case with a string and gender makes it possible to treat
<I>lik</I> (neutrum) and <I>pojke</I> (utrum).
</P>
<PRE>
mkN : (lik : Str) -&gt; Gender -&gt; N ;
</PRE>
<P></P>
<P>
Giving two forms - the singular and plural indefinite - is sufficient for
most nouns. The paradigm deals correctly with the vowel contractions in
<I>nyckel - nycklar</I> such as <I>pojke - pojkar</I>.
</P>
<PRE>
mkN : (nyckel,nycklar : Str) -&gt; N ;
</PRE>
<P></P>
<P>
In the worst case, four forms are needed.
</P>
<PRE>
mkN : (museum,museet,museer,museerna : Str) -&gt; N
} ;
</PRE>
<P></P>
<P>
All the functions above work quite as well to form <B>compound nouns</B>,
such as <I>fotboll</I>.
</P>
<A NAME="toc3"></A>
<H3>Relational nouns</H3>
<P>
Relational nouns (<I>kung av x</I>) are nouns with a preposition.
As a special case, we provide regular nouns (formed with one-argument <CODE>mkN</CODE>)
with the preposition <I>av</I>.
</P>
<PRE>
mkN2 : overload {
mkN2 : Str -&gt; N2 ;
mkN2 : N -&gt; Prep -&gt; N2
} ;
</PRE>
<P></P>
<P>
Three-place relational nouns (<I>förbindelse från x till y</I>)
need two prepositions.
</P>
<PRE>
mkN3 : N -&gt; Prep -&gt; Prep -&gt; N3 ;
</PRE>
<P></P>
<A NAME="toc4"></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>den före detta maken till</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="toc5"></A>
<H3>Proper names and noun phrases</H3>
<P>
Proper names, with a regular genitive, are formed from strings and
have the default gender utrum.
</P>
<PRE>
mkPN : overload {
mkPN : Str -&gt; PN ;
mkPN : Str -&gt; Gender -&gt; PN ;
</PRE>
<P></P>
<P>
In the worst case, the genitive form is irregular.
</P>
<PRE>
mkPN : (jesus,jesu : Str) -&gt; Gender -&gt; PN
} ;
</PRE>
<P></P>
<A NAME="toc6"></A>
<H2>Adjectives</H2>
<P>
Adjectives need one to seven forms.
</P>
<PRE>
mkA : overload {
</PRE>
<P></P>
<P>
Most adjectives are formed simply by adding endings to a stem.
</P>
<PRE>
mkA : (billig : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Some adjectives have a deviant neuter form. The following pattern
also recognizes the neuter formation <I>galen-galet</I> and forms the
proper plural and comparison forms <I>galna-galnare-galnast</I>.
</P>
<PRE>
mkA : (bred,brett : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Umlaut in comparison forms is
</P>
<PRE>
mkA : (tung,tyngre,tyngst : Str) -&gt; A ;
</PRE>
<P></P>
<P>
A few adjectives need 5 forms.
</P>
<PRE>
mkA : (god,gott,goda,battre,bast : Str) -&gt; A ;
</PRE>
<P></P>
<P>
Hardly any other adjective than <I>liten</I> needs the full 7 forms.
</P>
<PRE>
mkA : (liten,litet,lilla,sma,mindre,minst,minsta : Str) -&gt; A
} ;
</PRE>
<P></P>
<P>
Comparison forms may be compound (<I>mera svensk</I> - <I>mest svensk</I>);
this behaviour can be forced on any adjective.
</P>
<PRE>
compoundA : A -&gt; A ;
</PRE>
<P></P>
<A NAME="toc7"></A>
<H3>Two-place adjectives</H3>
<P>
Two-place adjectives need a preposition for their second argument.
</P>
<PRE>
mkA2 : A -&gt; Prep -&gt; A2 ;
</PRE>
<P></P>
<A NAME="toc8"></A>
<H2>Adverbs</H2>
<P>
Adverbs are not inflected. Most lexical ones have position
after the verb. Some can be preverbal in subordinate position
(e.g. <I>alltid</I>).
</P>
<PRE>
mkAdv : Str -&gt; Adv ; -- här
mkAdV : Str -&gt; AdV ; -- alltid
</PRE>
<P></P>
<P>
Adverbs modifying adjectives and sentences can also be formed.
</P>
<PRE>
mkAdA : Str -&gt; AdA ;
</PRE>
<P></P>
<A NAME="toc9"></A>
<H2>Verbs</H2>
<P>
All verbs can be defined by the overloaded paradigm <CODE>mkV</CODE>.
</P>
<PRE>
mkV : overload {
</PRE>
<P></P>
<P>
The 'regular verb' (= one-place) case 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 in <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>).
It is also possible to give the infinite form to it; they are treated
as if they were implicitly suffixed by <I>r</I>. Moreover, deponent verbs
are recognized from the final <I>s</I> (<I>hoppas</I>).
</P>
<PRE>
mkV : (stämmer : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Most irregular verbs need just the conventional three forms.
</P>
<PRE>
mkV : (dricka,drack,druckit : Str) -&gt; V ;
</PRE>
<P></P>
<P>
In the worst case, six forms are given.
</P>
<PRE>
mkV : (gå,går,gå,gick,gått,gången : Str) -&gt; V ;
</PRE>
<P></P>
<P>
Particle verbs, such as <I>passa på</I>, are formed by adding a string to a verb.
</P>
<PRE>
mkV : V -&gt; Str -&gt; V
} ;
</PRE>
<P></P>
<A NAME="toc10"></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>. Regular deponent verbs are also
handled by <CODE>mkV</CODE> and recognized from the ending <I>s</I>.
</P>
<PRE>
depV : V -&gt; V ;
reflV : V -&gt; V ;
</PRE>
<P></P>
<A NAME="toc11"></A>
<H3>Two-place verbs</H3>
<P>
Two-place verbs need a preposition, which default to the 'empty preposition'
i.e. direct object. (transitive verbs). The simplest case is a regular
verb (as in <CODE>mkV</CODE>) with a direct object.
Notice that, if a particle is needed, it comes from the <CODE>V</CODE>.
</P>
<PRE>
mkV2 : overload {
mkV2 : Str -&gt; V2 ;
mkV2 : V -&gt; V2 ;
mkV2 : V -&gt; Prep -&gt; V2
} ;
</PRE>
<P></P>
<A NAME="toc12"></A>
<H3>Three-place verbs</H3>
<P>
Three-place (ditransitive) verbs need two prepositions, of which
the first one or both can be absent. The simplest case is a regular
verb (as in <CODE>mkV</CODE>) with no prepositions.
</P>
<PRE>
mkV3 : overload {
mkV3 : Str -&gt; V3 ;
mkV3 : V -&gt; V3 ;
mkV3 : V -&gt; Prep -&gt; V3 ;
mkV3 : V -&gt; Prep -&gt; Prep -&gt; V3
} ;
</PRE>
<P></P>
<A NAME="toc13"></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; Prep -&gt; V2S ;
mkVV : V -&gt; VV ;
mkV2V : V -&gt; Prep -&gt; Prep -&gt; V2V ;
mkVA : V -&gt; VA ;
mkV2A : V -&gt; Prep -&gt; V2A ;
mkVQ : V -&gt; VQ ;
mkV2Q : V -&gt; Prep -&gt; V2Q ;
mkAS : A -&gt; AS ;
mkA2S : A -&gt; Prep -&gt; A2S ;
mkAV : A -&gt; AV ;
mkA2V : A -&gt; Prep -&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>
<!-- html code generated by txt2tags 2.3 (http://txt2tags.sf.net) -->
<!-- cmdline: txt2tags -thtml -\-toc swedish/ParadigmsSwe.txt -->
</BODY></HTML>
Reference in New Issue View Git Blame Copy Permalink