mirror of
https://github.com/GrammaticalFramework/gf-core.git
synced 2026-04-21 02:39:31 -06:00
101 lines
2.8 KiB
Plaintext
101 lines
2.8 KiB
Plaintext
--# -path=.:../common:../../prelude
|
|
--
|
|
----1 A Simple Afrman Resource Morphology
|
|
----
|
|
---- Aarne Ranta & Harald Hammarström 2002 -- 2006
|
|
----
|
|
---- This resource morphology contains definitions needed in the resource
|
|
---- syntax. To build a lexicon, it is better to use $ParadigmsAfr$, which
|
|
---- gives a higher-level access to this module.
|
|
--
|
|
resource MorphoAfr = ResAfr ** open Prelude, (Predef=Predef) in
|
|
{
|
|
--{
|
|
--
|
|
-- flags optimize=all ;
|
|
--
|
|
--oper
|
|
--
|
|
---- For $StructuralAfr$.
|
|
--
|
|
-- mkPrep : Str -> Case -> Preposition = \s,c ->
|
|
-- {s = s ; c = c} ;
|
|
--
|
|
-- nameNounPhrase : {s : Case => Str} -> {s : Case => Str ; a : Agr} = \name ->
|
|
-- name ** {a = agrP3 Sg} ;
|
|
--
|
|
-- detLikeAdj : Number -> Str ->
|
|
-- {s,sp : Gender => Case => Str ; n : Number ; a : Adjf} = \n,dies ->
|
|
-- {s,sp = appAdj (regA dies) ! n ; n = n ; a = Weak} ;
|
|
--
|
|
-- mkOrd : {s : Degree => AForm => Str} -> {s : AForm => Str} = \a ->
|
|
-- {s = a.s ! Posit} ;
|
|
--
|
|
---- For $ParadigmsAfr$.
|
|
--
|
|
-- genitS : Str -> Str = \hund -> case hund of {
|
|
-- _ + ("el" | "en" | "er") => hund + "s" ;
|
|
-- _ + ("s" | "ß" | "sch" | "st" | "x" | "z") => hund + "es" ;
|
|
-- _ => hund + variants {"s" ; "es"}
|
|
-- } ;
|
|
-- pluralN : Str -> Str = \hund -> case hund of {
|
|
-- _ + ("el" | "er" | "e") => hund + "n" ;
|
|
-- _ + "en" => hund ;
|
|
-- _ => hund + "en"
|
|
-- } ;
|
|
-- dativE : Str -> Str = \hund -> case hund of {
|
|
-- _ + ("el" | "en" | "er" | "e") => hund ;
|
|
-- _ => variants {hund ; hund + "e"}
|
|
-- } ;
|
|
--
|
|
---- Duden, p. 119
|
|
--
|
|
-- verbT : Str -> Str = \v -> case v of {
|
|
-- _ + ("t" | "d") => v + "et" ; -- gründen, reden, betten
|
|
-- _ + ("ch" | "k" | "p" | "t" | "g" | "b" | "d" | "f" | "s") +
|
|
-- ("m" | "n") => v + "et" ; -- atmen, widmen, öffnen, rechnen
|
|
-- _ => v + "t" -- lernen, lärmen, qualmen etc
|
|
-- } ;
|
|
--
|
|
-- verbST : Str -> Str = \v -> case v of {
|
|
-- _ + ("s" | "ss" | "ß" | "sch" | "x" | "z") => v + "t" ;
|
|
-- _ => v + "st"
|
|
-- } ;
|
|
--
|
|
-- stemVerb : Str -> Str = \v -> case v of {
|
|
-- _ + ("rn" | "ln") => init v ;
|
|
-- _ => Predef.tk 2 v
|
|
-- } ;
|
|
--
|
|
---- For $Numeral$.
|
|
--
|
|
-- LinDigit = {s : DForm => CardOrd => Str} ;
|
|
--
|
|
-- cardOrd : Str -> Str -> CardOrd => Str = \drei,dritte ->
|
|
-- table {
|
|
-- NCard _ _ => drei ;
|
|
-- NOrd a => (regA (init dritte)).s ! Posit ! a
|
|
-- } ;
|
|
--
|
|
-- cardReg : Str -> CardOrd => Str = \zehn ->
|
|
-- cardOrd zehn (zehn + "te") ;
|
|
--
|
|
-- mkDigit : (x1,_,_,x4 : Str) -> LinDigit =
|
|
-- \drei,dreizehn,dreissig,dritte ->
|
|
-- {s = table {
|
|
-- DUnit => cardOrd drei dritte ;
|
|
-- DTeen => cardReg dreizehn ;
|
|
-- DTen => cardOrd dreissig (dreissig + "ste")
|
|
-- }
|
|
-- } ;
|
|
--
|
|
-- regDigit : Str -> LinDigit = \vier ->
|
|
-- mkDigit vier (vier + "zehn") (vier + "zig") (vier + "te") ;
|
|
--
|
|
-- invNum : CardOrd = NCard Masc Nom ;
|
|
--
|
|
--} ;
|
|
--
|
|
|
|
}
|