mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-16 16:29:32 -06:00
424 lines
11 KiB
HTML
424 lines
11 KiB
HTML
<!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: 2006-10-31 16:59:43 CET</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">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>
|
|
</UL>
|
|
<LI><A HREF="#toc7">Adjectives</A>
|
|
<UL>
|
|
<LI><A HREF="#toc8">Two-place adjectives</A>
|
|
</UL>
|
|
<LI><A HREF="#toc9">Adverbs</A>
|
|
<LI><A HREF="#toc10">Verbs</A>
|
|
<UL>
|
|
<LI><A HREF="#toc11">Verbs with a particle.</A>
|
|
<LI><A HREF="#toc12">Deponent verbs.</A>
|
|
<LI><A HREF="#toc13">Two-place verbs</A>
|
|
<LI><A HREF="#toc14">Three-place verbs</A>
|
|
<LI><A HREF="#toc15">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 are just strings.
|
|
</P>
|
|
<PRE>
|
|
mkPrep : Str -> Prep ;
|
|
noPrep : Prep ; -- empty string
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc2"></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) -> N ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
The regular function takes the singular indefinite form and computes the other
|
|
forms and the gender by a heuristic. The heuristic is currently
|
|
to treat all words ending with <I>a</I> like <I>flicka</I>, with <I>e</I> like <I>rike</I>,
|
|
and otherwise like <I>bil</I>.
|
|
If in doubt, use the <CODE>cc</CODE> command to test!
|
|
</P>
|
|
<PRE>
|
|
regN : Str -> N ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
Adding the gender manually greatly improves the correction of <CODE>regN</CODE>.
|
|
</P>
|
|
<PRE>
|
|
regGenN : Str -> Gender -> N ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
In practice the worst case is often just: give singular and plural indefinite.
|
|
</P>
|
|
<PRE>
|
|
mk2N : (nyckel,nycklar : Str) -> 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) -> N ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc3"></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="toc4"></A>
|
|
<H3>Relational nouns</H3>
|
|
<P>
|
|
Relational nouns (<I>dotter till x</I>) need a preposition.
|
|
</P>
|
|
<PRE>
|
|
mkN2 : N -> Prep -> 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 -> Gender -> 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>förbindelse från x till y</I>)
|
|
need two prepositions.
|
|
</P>
|
|
<PRE>
|
|
mkN3 : N -> Prep -> Prep -> N3 ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc5"></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="toc6"></A>
|
|
<H3>Proper names and noun phrases</H3>
|
|
<P>
|
|
Proper names, with a regular genitive, are formed as follows
|
|
</P>
|
|
<PRE>
|
|
regGenPN : Str -> Gender -> PN ;
|
|
regPN : Str -> PN ; -- utrum
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
Sometimes you can reuse a common noun as a proper name, e.g. <I>Bank</I>.
|
|
</P>
|
|
<PRE>
|
|
nounPN : N -> 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 -> Str -> Number -> Gender -> NP ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc7"></A>
|
|
<H2>Adjectives</H2>
|
|
<P>
|
|
Adjectives may need as many as seven forms.
|
|
</P>
|
|
<PRE>
|
|
mkA : (liten, litet, lilla, sma, mindre, minst, minsta : Str) -> A ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
The regular pattern works for many adjectives, e.g. those ending
|
|
with <I>ig</I>.
|
|
</P>
|
|
<PRE>
|
|
regA : Str -> A ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
Just the comparison forms can be irregular.
|
|
</P>
|
|
<PRE>
|
|
irregA : (tung,tyngre,tyngst : Str) -> A ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
Sometimes just the positive forms are irregular.
|
|
</P>
|
|
<PRE>
|
|
mk3A : (galen,galet,galna : Str) -> A ;
|
|
mk2A : (bred,brett : Str) -> A ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
Comparison forms may be compound (<I>mera svensk</I> - <I>mest svensk</I>).
|
|
</P>
|
|
<PRE>
|
|
compoundA : A -> A ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc8"></A>
|
|
<H3>Two-place adjectives</H3>
|
|
<P>
|
|
Two-place adjectives need a preposition for their second argument.
|
|
</P>
|
|
<PRE>
|
|
mkA2 : A -> Prep -> A2 ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc9"></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 -> Adv ; -- här
|
|
mkAdV : Str -> AdV ; -- alltid
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
Adverbs modifying adjectives and sentences can also be formed.
|
|
</P>
|
|
<PRE>
|
|
mkAdA : Str -> AdA ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc10"></A>
|
|
<H2>Verbs</H2>
|
|
<P>
|
|
The worst case needs five forms.
|
|
</P>
|
|
<PRE>
|
|
mkV : (supa,super,sup,söp,supit,supen : Str) -> 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) -> 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) -> V ;
|
|
</PRE>
|
|
<P></P>
|
|
<P>
|
|
There is an extensive list of irregular verbs in the module <CODE>IrregSwe</CODE>.
|
|
In practice, it is enough to give three forms, as in school books.
|
|
</P>
|
|
<PRE>
|
|
irregV : (dricka, drack, druckit : Str) -> V ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc11"></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 -> Str -> V ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc12"></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 -> V ;
|
|
reflV : V -> V ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc13"></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 -> Prep -> V2 ;
|
|
|
|
dirV2 : V -> V2 ;
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc14"></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 -> Prep -> Prep -> V3 ; -- tala, med, om
|
|
dirV3 : V -> Prep -> V3 ; -- ge, (acc),till
|
|
dirdirV3 : V -> V3 ; -- ge, (dat), (acc)
|
|
</PRE>
|
|
<P></P>
|
|
<A NAME="toc15"></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 -> V0 ;
|
|
mkVS : V -> VS ;
|
|
mkV2S : V -> Prep -> V2S ;
|
|
mkVV : V -> VV ;
|
|
mkV2V : V -> Prep -> Prep -> V2V ;
|
|
mkVA : V -> VA ;
|
|
mkV2A : V -> Prep -> V2A ;
|
|
mkVQ : V -> VQ ;
|
|
mkV2Q : V -> Prep -> V2Q ;
|
|
|
|
mkAS : A -> AS ;
|
|
mkA2S : A -> Prep -> A2S ;
|
|
mkAV : A -> AV ;
|
|
mkA2V : A -> Prep -> 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>
|