language-toolkit-1.2.0.0: A set of tools for analyzing languages via logic and automata
Copyright(c) 20202023 Dakotah Lambert
LicenseMIT
Safe HaskellSafe-Inferred
LanguageHaskell2010

LTK.Learn.TSL.ViaSL

Description

This module implements a string extension learner for the TSL class. A variant of the tier-finding algorithm of Jardine and McMullin (2017) is used. Under a Gold-style framework of learning in the limit from positive data, a strictly local grammar can be reinterpreted as a tier-based grammar.

For the original work, see https://doi.org/10.1007/978-3-319-53733-7_4

Since: 0.3

Synopsis

Documentation

data TSLG a #

A representation of a TSL grammar.

Instances

Instances details
HasAlphabet TSLG # 
Instance details

Defined in LTK.Learn.TSL.ViaSL

Methods

alphabet :: TSLG e -> Set e #

Grammar TSLG # 
Instance details

Defined in LTK.Learn.TSL.ViaSL

Methods

genFSA :: (NFData a, Ord a) => TSLG a -> FSA Integer a #

augmentG :: Ord a => TSLG a -> TSLG a -> TSLG a #

isSubGOf :: Ord a => TSLG a -> TSLG a -> Bool #

emptyG :: Ord a => TSLG a #

(Read a, Ord a) => Read (TSLG a) # 
Instance details

Defined in LTK.Learn.TSL.ViaSL

Show a => Show (TSLG a) # 
Instance details

Defined in LTK.Learn.TSL.ViaSL

Methods

showsPrec :: Int -> TSLG a -> ShowS #

show :: TSLG a -> String #

showList :: [TSLG a] -> ShowS #

Eq a => Eq (TSLG a) # 
Instance details

Defined in LTK.Learn.TSL.ViaSL

Methods

(==) :: TSLG a -> TSLG a -> Bool #

(/=) :: TSLG a -> TSLG a -> Bool #

Ord a => Ord (TSLG a) # 
Instance details

Defined in LTK.Learn.TSL.ViaSL

Methods

compare :: TSLG a -> TSLG a -> Ordering #

(<) :: TSLG a -> TSLG a -> Bool #

(<=) :: TSLG a -> TSLG a -> Bool #

(>) :: TSLG a -> TSLG a -> Bool #

(>=) :: TSLG a -> TSLG a -> Bool #

max :: TSLG a -> TSLG a -> TSLG a #

min :: TSLG a -> TSLG a -> TSLG a #

fTSL :: Ord a => Int -> [a] -> TSLG a #

Extract information from a word.