LTK.Factors

This module provides a means to define positive and negative factors over the adjacency or precedence relations, as well as unions and intersections thereof.

Constructions

required :: Factor e -> Literal e

The factor is required to appear in every string. Note that a conjunctive constraint of (required (Substring x True True)) restricts the stringset to at most one word.

forbidden :: Factor e -> Literal e

The factor is not allowed to appear in any word.

buildLiteral :: (Enum n, Ord n, Ord e) => Set e -> Literal e -> FSA n e

Build an FSA representing a single constraint.

build :: (Enum n, NFData n, Ord n, NFData e, Ord e) => Set e -> Set (Conjunction e) -> FSA n e

Build an FSA representing the conjunction of a set of constraints provided in conjunctive normal form.

makeConstraint :: Ord e => [[Literal e]] -> Conjunction e

Combine inner lists by Disjunction, and form a Conjunction of the results.

Logical Expressions

data Factor e

A substring or subsequence, from which to build constraints.

Constructors

Substring

Fields

• substring :: [Set e]

  The sequence of symbol types, e.g. [wxs0, wxs0] for two consecutive unstressed syllables.

• headAnchored :: Bool

  Anchored to the head of the word?

• tailAnchored :: Bool

  Anchored to the tail of the word?

Subsequence [Set e]

Instances

(Read e, Ord e) => Read (Factor e)

Defined in LTK.Factors

Methods

readsPrec :: Int -> ReadS (Factor e)

readList :: ReadS [Factor e]

readPrec :: ReadPrec (Factor e)

readListPrec :: ReadPrec [Factor e]

Show e => Show (Factor e)

Defined in LTK.Factors

Methods

showsPrec :: Int -> Factor e -> ShowS

show :: Factor e -> String

showList :: [Factor e] -> ShowS

Eq e => Eq (Factor e)

Defined in LTK.Factors

Methods

(==) :: Factor e -> Factor e -> Bool

(/=) :: Factor e -> Factor e -> Bool

Ord e => Ord (Factor e)

Defined in LTK.Factors

Methods

compare :: Factor e -> Factor e -> Ordering

(<) :: Factor e -> Factor e -> Bool

(<=) :: Factor e -> Factor e -> Bool

(>) :: Factor e -> Factor e -> Bool

(>=) :: Factor e -> Factor e -> Bool

max :: Factor e -> Factor e -> Factor e

min :: Factor e -> Factor e -> Factor e

data Literal e

A constraint.

Constructors

Literal Bool (Factor e)

Instances

(Read e, Ord e) => Read (Literal e)

Defined in LTK.Factors

Methods

readsPrec :: Int -> ReadS (Literal e)

readList :: ReadS [Literal e]

readPrec :: ReadPrec (Literal e)

readListPrec :: ReadPrec [Literal e]

Show e => Show (Literal e)

Defined in LTK.Factors

Methods

showsPrec :: Int -> Literal e -> ShowS

show :: Literal e -> String

showList :: [Literal e] -> ShowS

Eq e => Eq (Literal e)

Defined in LTK.Factors

Methods

(==) :: Literal e -> Literal e -> Bool

(/=) :: Literal e -> Literal e -> Bool

Ord e => Ord (Literal e)

Defined in LTK.Factors

Methods

compare :: Literal e -> Literal e -> Ordering

(<) :: Literal e -> Literal e -> Bool

(<=) :: Literal e -> Literal e -> Bool

(>) :: Literal e -> Literal e -> Bool

(>=) :: Literal e -> Literal e -> Bool

max :: Literal e -> Literal e -> Literal e

min :: Literal e -> Literal e -> Literal e

newtype Disjunction e

Multiple constraints, joined by OR.

Constructors

Disjunction (Set (Literal e))

Instances

(Read e, Ord e) => Read (Disjunction e)

Defined in LTK.Factors

Methods

readsPrec :: Int -> ReadS (Disjunction e)

readList :: ReadS [Disjunction e]

readPrec :: ReadPrec (Disjunction e)

readListPrec :: ReadPrec [Disjunction e]

Show e => Show (Disjunction e)

Defined in LTK.Factors

Methods

showsPrec :: Int -> Disjunction e -> ShowS

show :: Disjunction e -> String

showList :: [Disjunction e] -> ShowS

Eq e => Eq (Disjunction e)

Defined in LTK.Factors

Methods

(==) :: Disjunction e -> Disjunction e -> Bool

(/=) :: Disjunction e -> Disjunction e -> Bool

Ord e => Ord (Disjunction e)

Defined in LTK.Factors

Methods

compare :: Disjunction e -> Disjunction e -> Ordering

(<) :: Disjunction e -> Disjunction e -> Bool

(<=) :: Disjunction e -> Disjunction e -> Bool

(>) :: Disjunction e -> Disjunction e -> Bool

(>=) :: Disjunction e -> Disjunction e -> Bool

max :: Disjunction e -> Disjunction e -> Disjunction e

min :: Disjunction e -> Disjunction e -> Disjunction e

newtype Conjunction e

Multiple disjunctions, joined by AND.

Constructors

Conjunction (Set (Disjunction e))

Instances

(Read e, Ord e) => Read (Conjunction e)

Defined in LTK.Factors

Methods

readsPrec :: Int -> ReadS (Conjunction e)

readList :: ReadS [Conjunction e]

readPrec :: ReadPrec (Conjunction e)

readListPrec :: ReadPrec [Conjunction e]

Show e => Show (Conjunction e)

Defined in LTK.Factors

Methods

showsPrec :: Int -> Conjunction e -> ShowS

show :: Conjunction e -> String

showList :: [Conjunction e] -> ShowS

Eq e => Eq (Conjunction e)

Defined in LTK.Factors

Methods

(==) :: Conjunction e -> Conjunction e -> Bool

(/=) :: Conjunction e -> Conjunction e -> Bool

Ord e => Ord (Conjunction e)

Defined in LTK.Factors

Methods

compare :: Conjunction e -> Conjunction e -> Ordering

(<) :: Conjunction e -> Conjunction e -> Bool

(<=) :: Conjunction e -> Conjunction e -> Bool

(>) :: Conjunction e -> Conjunction e -> Bool

(>=) :: Conjunction e -> Conjunction e -> Bool

max :: Conjunction e -> Conjunction e -> Conjunction e

min :: Conjunction e -> Conjunction e -> Conjunction e