NLP.GenI.Polarity

Entry point

type PolAut = NFA PolState PolTrans

data PolState

Constructors

PolSt Int [Pred] [(Int, Int)]

position in the input semantics, extra semantics, polarity interval

Instances

Eq PolState

Ord PolState

Show PolState

type AutDebug = (String, PolAut, PolAut)

type PolResult = ([AutDebug], PolAut, PolAut, Sem)

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

buildAutomaton :: SemInput -> [TagElem] -> Flist -> PolMap -> PolResult

Constructs a polarity automaton from the surface realiser's input: input semantics, lexical selection, extra polarities and index constraints. For debugging purposes, it returns all the intermediate automata produced by the construction algorithm.

Inner stuff (exported for debugging?)

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

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

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

detectSansIdx :: [TagElem] -> [TagElem]

detectPolFeatures :: [TagElem] -> [String]

detectPols :: [TagElem] -> [TagElem]

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

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.

declareIdxConstraints :: Flist -> PolMap

detectIdxConstraints :: Flist -> Flist -> PolMap

showLite :: ShowLite a => a -> String

showLitePm :: PolMap -> String

Display a PolMap in human-friendly text. The advantage is that it displays fewer quotation marks.

showPolPaths :: BitVector -> String

Render the list of polarity automaton paths as a string

showPolPaths' :: BitVector -> Int -> [Int]

automatonPaths :: (Ord st, Ord ab) => NFA st ab -> [[ab]]

finalSt :: NFA st ab -> [st]

data NFA st ab

Note: there are two ways to define the final states. 1. you may define them as a list of states in finalStList 2. you may define them via the isFinalSt function The state list is ignored if you define isFinalSt