NLP.GenI.Polarity

Documentation

module NLP.GenI.Polarity.Types

Entry point

type PolAut = NFA PolState PolTrans

data PolState

Constructors

PolSt Int [Literal GeniVal] [(Int, Int)]

position in the input semantics, extra semantics, polarity interval

Instances

Eq PolState

Methods

(==) :: PolState -> PolState -> Bool

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

Ord PolState

Methods

compare :: PolState -> PolState -> Ordering

(<) :: PolState -> PolState -> Bool

(<=) :: PolState -> PolState -> Bool

(>) :: PolState -> PolState -> Bool

(>=) :: PolState -> PolState -> Bool

max :: PolState -> PolState -> PolState

min :: PolState -> PolState -> PolState

Show PolState

Methods

showsPrec :: Int -> PolState -> ShowS

show :: PolState -> String

showList :: [PolState] -> ShowS

type AutDebug = (PolarityKey, PolAut, PolAut)

data PolResult

intermediate auts, seed aut, final aut, potentially modified sem

Constructors

PolResult

Fields

• prIntermediate :: [AutDebug]
• prInitial :: PolAut
• prFinal :: PolAut
• prSem :: Sem

buildAutomaton

Arguments

:: Set PolarityAttr

polarities to detect (eg. "cat")

-> FeatStruct GeniVal

root features to compensate for

-> PolMap

explicit extra polarities

-> SemInput

input semantics

-> [TagElem]

lexical selection

-> PolResult

Constructs a polarity automaton. For debugging purposes, it returns all the intermediate automata produced by the construction algorithm.

Polarity paths

type PolPathSet = IntSet

detectPolPaths :: [[TagElem]] -> [(TagElem, PolPathSet)]

Given a list of paths (i.e. a list of list of trees) return a list of trees such that each tree is annotated with the paths it belongs to.

hasSharedPolPaths :: PolPathSet -> PolPathSet -> Bool

polPathsToList :: PolPathSet -> [Int]

singletonPolPath :: Int -> PolPathSet

A (trivially) packed representation of the singleton set containing a single polarity path

emptyPolPaths :: PolPathSet

polPathsNull :: PolPathSet -> Bool

intersectPolPaths :: PolPathSet -> PolPathSet -> PolPathSet

unionPolPaths :: PolPathSet -> PolPathSet -> PolPathSet

Inner stuff (exported for debugging?)

makePolAut :: [TagElem] -> Sem -> PolMap -> [PolarityKey] -> PolResult

fixPronouns :: (Sem, [TagElem]) -> (Sem, [TagElem])

Returns a modified input semantics and lexical selection in which pronouns are properly accounted for.

detectSansIdx :: [TagElem] -> [TagElem]

suggestPolFeatures :: [TagElem] -> [Text]

detectPols :: Set PolarityAttr -> TagElem -> TagElem

declareIdxConstraints :: Flist GeniVal -> PolMap

detectIdxConstraints :: Flist GeniVal -> Flist GeniVal -> PolMap

prettyPolPaths :: PolPathSet -> Text

Render the list of polarity automaton paths as a string

automatonPaths :: Ord st => NFA st ab -> [[ab]]

Returns all possible paths through an automaton from the start state to any dead-end.

Each path is represented as a list of labels.

We assume that the automaton does not have any loops in it.

finalSt :: NFA st ab -> [st]

finalSt returns all the final states of an automaton

data NFA st ab

Note: you can define the final state either by setting isFinalSt to Just f where f is some function or by putting them in finalStList