Packages

  • package root
    Definition Classes
    root
  • package provingground

    This is work towards automated theorem proving based on learning, using homotopy type theory (HoTT) as foundations and natural language processing.

    This is work towards automated theorem proving based on learning, using homotopy type theory (HoTT) as foundations and natural language processing.

    The implementation of homotopy type theory is split into:

    • the object HoTT with terms, types, functions and dependent functions, pairs etc
    • the package induction with general inductive types and recursion/induction on these.

    The learning package has the code for learning.

    Scala code, including the spire library, is integrated with homotopy type theory in the scalahott package

    We have implemented a functor based approach to translation in the translation package, used for nlp as well as serialization and parsing.

    The library package is contains basic structures implemented in HoTT.

    Definition Classes
    root
  • package translation

    Translation primarily using a functorial framework - see Translator$, for natural language processing as well as serialization, formatted output, parsing, interface with formal languages etc.

    Translation primarily using a functorial framework - see Translator$, for natural language processing as well as serialization, formatted output, parsing, interface with formal languages etc.

    Besides the Translator framework and helper typeclasses is Functors, several structures for concrete languages including our implementation of HoTT are in this package.

    Definition Classes
    provingground
  • object StanfordParser

    Interface to the Stanford parser, handling (inline) TeX by separating tokenizing and POS tagging from parsing.

    Interface to the Stanford parser, handling (inline) TeX by separating tokenizing and POS tagging from parsing. Parsing is done by the texParse method

    Definition Classes
    translation
  • TeXParsed

case class TeXParsed(preraw: String, wordTags: Vector[(String, String)] = baseWordTags, mweSubs: Vector[(Vector[String], TaggedWord)] = baseMweSubs) extends Product with Serializable

Linear Supertypes
Serializable, Product, Equals, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TeXParsed
  2. Serializable
  3. Product
  4. Equals
  5. AnyRef
  6. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new TeXParsed(preraw: String, wordTags: Vector[(String, String)] = baseWordTags, mweSubs: Vector[(Vector[String], TaggedWord)] = baseMweSubs)

Value Members

  1. lazy val deTeXTagged: List[TaggedWord]
  2. lazy val deTeXWords: Buffer[Word]
  3. lazy val deTeXed: String
  4. lazy val gs: GrammaticalStructure
  5. lazy val mergeSubsTagged: Vector[TaggedWord]
  6. val mweSubs: Vector[(Vector[String], TaggedWord)]
  7. lazy val parsed: Tree
  8. lazy val polyParsed: Vector[Tree]
  9. val preraw: String
  10. def productElementNames: Iterator[String]
    Definition Classes
    Product
  11. lazy val proseTree: ProseTree
  12. val raw: String
  13. def reTagged(tw: TaggedWord): TaggedWord
  14. lazy val tagged: Buffer[TaggedWord]
  15. lazy val tdl: List[TypedDependency]
  16. lazy val texMap: Map[String, String]
  17. def token(w: IndexedWord): Token
  18. lazy val typedDeps: Buffer[DepRel]
  19. val wordTags: Vector[(String, String)]