Brassica.Paradigm

Re-export

module Text.Megaparsec.Error

Paradigm representation

data Process

Represents a single morphophonological process: currently, either prefixation or suffixation of a String. The Int gives the distance of the affix from the root.

Constructors

Prefix Int String

Suffix Int String

Instances

Show Process

Defined in Brassica.Paradigm.Types

Methods

showsPrec :: Int -> Process -> ShowS

show :: Process -> String

showList :: [Process] -> ShowS

Eq Process

Defined in Brassica.Paradigm.Types

Methods

(==) :: Process -> Process -> Bool

(/=) :: Process -> Process -> Bool

type Affix = [Process]

A single affix (using the term in a wide sense) can be thought of as a list of morphophonological processes. For instance, the Berber feminine circumfix t-…-t might be represented as [Prefix 1 "t", Suffix 1 "t"] :: Affix.

data Grammeme

A Grammeme represents one value of a grammatical feature: for instance past, or dual. This can be realised as a Concrete affix, or can be left Abstract so that it can be encoded in a cumulative morph or similar.

(The name is from Wikipedia; it doesn’t seem widely-used, but I can find no better for this concept.)

Constructors

Concrete Affix

Abstract AbstractGrammeme

Instances

Show Grammeme

Defined in Brassica.Paradigm.Types

Methods

showsPrec :: Int -> Grammeme -> ShowS

show :: Grammeme -> String

showList :: [Grammeme] -> ShowS

Eq Grammeme

Defined in Brassica.Paradigm.Types

Methods

(==) :: Grammeme -> Grammeme -> Bool

(/=) :: Grammeme -> Grammeme -> Bool

newtype AbstractGrammeme

An abstract identifier for a Grammeme.

Constructors

AbstractGrammeme String

Instances

IsString AbstractGrammeme

Defined in Brassica.Paradigm.Types

Methods

fromString :: String -> AbstractGrammeme

Show AbstractGrammeme

Defined in Brassica.Paradigm.Types

Methods

showsPrec :: Int -> AbstractGrammeme -> ShowS

show :: AbstractGrammeme -> String

showList :: [AbstractGrammeme] -> ShowS

Eq AbstractGrammeme

Defined in Brassica.Paradigm.Types

Methods

(==) :: AbstractGrammeme -> AbstractGrammeme -> Bool

(/=) :: AbstractGrammeme -> AbstractGrammeme -> Bool

data Condition

A condition which must be satisfied for a Feature to be included in a word.

Constructors

Always

Condition which is always satisfied

Is FeatureName Grammeme

Satisfied when the specified feature has been assigned to the specified Grammeme

Not FeatureName Grammeme

Satisfied when the specified feature has not been assigned to the specified Grammeme

Instances

Show Condition

Defined in Brassica.Paradigm.Types

Methods

showsPrec :: Int -> Condition -> ShowS

show :: Condition -> String

showList :: [Condition] -> ShowS

Eq Condition

Defined in Brassica.Paradigm.Types

Methods

(==) :: Condition -> Condition -> Bool

(/=) :: Condition -> Condition -> Bool

data Feature

A grammatical feature, which may be realised by one of a selection of Grammemes. A feature may be given a descriptive name, as well as a condition which must be satisfied for the Feature to be included in a word.

Constructors

Feature Condition (Maybe FeatureName) [Grammeme]

Instances

Show Feature

Defined in Brassica.Paradigm.Types

Methods

showsPrec :: Int -> Feature -> ShowS

show :: Feature -> String

showList :: [Feature] -> ShowS

Eq Feature

Defined in Brassica.Paradigm.Types

Methods

(==) :: Feature -> Feature -> Bool

(/=) :: Feature -> Feature -> Bool

newtype FeatureName

Name to identify a specific Feature.

Constructors

FeatureName String

Instances

IsString FeatureName

Defined in Brassica.Paradigm.Types

Methods

fromString :: String -> FeatureName

Show FeatureName

Defined in Brassica.Paradigm.Types

Methods

showsPrec :: Int -> FeatureName -> ShowS

show :: FeatureName -> String

showList :: [FeatureName] -> ShowS

Eq FeatureName

Defined in Brassica.Paradigm.Types

Methods

(==) :: FeatureName -> FeatureName -> Bool

(/=) :: FeatureName -> FeatureName -> Bool

data Statement

Each statement in a paradigm description specifies either a new Feature, or a new mapping from a set of abstract grammemes to their realisation.

Constructors

NewFeature Feature

NewMapping [AbstractGrammeme] Affix

Instances

Show Statement

Defined in Brassica.Paradigm.Types

Methods

showsPrec :: Int -> Statement -> ShowS

show :: Statement -> String

showList :: [Statement] -> ShowS

Eq Statement

Defined in Brassica.Paradigm.Types

Methods

(==) :: Statement -> Statement -> Bool

(/=) :: Statement -> Statement -> Bool

type Paradigm = [Statement]

A paradigm is specified as a list of Statements. The order is reflected in the output ResultsTree: the root has one child for each grammeme in the first Feature, with each child then having one child for each grammeme in the second Feature, and so on.

Parsing and pretty-printing

parseParadigm :: String -> Either (ParseErrorBundle String Void) Paradigm

Parse a String in Brassica paradigm syntax into a Paradigm. Returns Left if the input string is malformed.

For details on the syntax, refer to https://github.com/bradrn/brassica/blob/v1.0.0/docs/Paradigm-Builder.md.

formatNested :: (a -> String) -> ResultsTree a -> String

Formats a ResultsTree in a nested way, where the lowest-level elements are separated by one space, the second-lowest are separated by one newline, the third-lowest by two newlines, and so on.

Paradigm application

applyParadigm :: Paradigm -> String -> ResultsTree String

Apply the given Paradigm to a root, to produce all possible derived forms.

data ResultsTree a

Results from applying a Paradigm to a word, represented as a tree containing each possible choice of Grammemes.

Constructors

Node [ResultsTree a]

Result a

Instances

Foldable ResultsTree

Defined in Brassica.Paradigm.Apply

Methods

fold :: Monoid m => ResultsTree m -> m

foldMap :: Monoid m => (a -> m) -> ResultsTree a -> m

foldMap' :: Monoid m => (a -> m) -> ResultsTree a -> m

foldr :: (a -> b -> b) -> b -> ResultsTree a -> b

foldr' :: (a -> b -> b) -> b -> ResultsTree a -> b

foldl :: (b -> a -> b) -> b -> ResultsTree a -> b

foldl' :: (b -> a -> b) -> b -> ResultsTree a -> b

foldr1 :: (a -> a -> a) -> ResultsTree a -> a

foldl1 :: (a -> a -> a) -> ResultsTree a -> a

toList :: ResultsTree a -> [a]

null :: ResultsTree a -> Bool

length :: ResultsTree a -> Int

elem :: Eq a => a -> ResultsTree a -> Bool

maximum :: Ord a => ResultsTree a -> a

minimum :: Ord a => ResultsTree a -> a

sum :: Num a => ResultsTree a -> a

product :: Num a => ResultsTree a -> a

Functor ResultsTree

Defined in Brassica.Paradigm.Apply

Methods

fmap :: (a -> b) -> ResultsTree a -> ResultsTree b

(<$) :: a -> ResultsTree b -> ResultsTree a

Show a => Show (ResultsTree a)

Defined in Brassica.Paradigm.Apply

Methods

showsPrec :: Int -> ResultsTree a -> ShowS

show :: ResultsTree a -> String

showList :: [ResultsTree a] -> ShowS

depth :: ResultsTree a -> Int

Depth of a ResultsTree: i.e. how many levels of Nodes it contains.