pds
Transform probabilistic semantic grammar fragments based on the λ-calculus into code for fitting probabilistic models of human inference judgment data.
Modules
pds-0.1.0.0
- Analysis
- Adjectives
- Analysis.Adjectives.Adjectives Adjectives lexicon.
- Analysis.Adjectives.Signature Signature for gradable adjectives.
- Factivity
- Analysis.Factivity.Factivity Factivity lexicon.
- Analysis.Factivity.Signature Signature for factivity.
- Adjectives
- Framework
- Framework.Grammar Exports CCG operations, lexica, and parsers.
- Framework.Grammar.CCG CCG derivations.
- Lexica
- Framework.Grammar.Lexica.SynSem Components for defining CCG lexica with catogories and λ-terms.
- Framework.Grammar.Lexica.SynSem.Convenience Some convenience functions.
- Framework.Grammar.Lexica.SynSem Components for defining CCG lexica with catogories and λ-terms.
- Framework.Grammar.Parser CCG parsing, CKY-style (ish).
- Framework.Lambda Exports terms, types, and some delta rules.
- Framework.Lambda.Convenience Convenience functions, etc.
- Framework.Lambda.Delta Delta rules.
- Framework.Lambda.Signature Signatures for constants used across the framework.
- Framework.Lambda.Terms λ-calculus (with probabilistic programs).
- Framework.Lambda.Types Curry typing with probabilistic types.
- Framework.Target Exports target modules, e.g., translating to Stan code.
- Framework.Target.Stan Exports probabilistic programs as Stan code.
- Framework.Grammar Exports CCG operations, lexica, and parsers.
- Theory
- Theory.Signature Theory-level signatures