GenI

Surface realiser

A surface realiser using Tree Adjoining Grammar for Natural Language Generation, implemented in Haskell.

Surface realiser (part of a Natural Language Generation system) using Tree Adjoining Grammar

GitHub

21 stars
7 watching
2 forks
Language: Haskell
last commit: over 11 years ago
Linked from 1 awesome list


Backlinks from these awesome lists:

Related projects:

RepositoryDescriptionStars
swtwsk/vinci-langA proof-of-concept compiler targeting SPIR-V for a toy ML functional shading language15
ollef/earleyA Haskell implementation of Earley's algorithm for parsing context-free grammars.366
tweag/haskellrAn environment for efficient data processing using Haskell or R code.587
workday/upshot-montagueTranslates natural language into formal representations using Combinatory Categorial Grammar (CCG), enabling semantic parsing.59
jaredloomis/andromedaA Haskell-based library for writing and compiling OpenGL shaders77
lexi-lambda/freer-simpleA Haskell library for building effectful applications with a focus on type-level effects and composability228
georgestagg/webrCompiles R statistical language into WebAssembly for use in web browsers and Node1
simplenlg/simplenlgA Java API for generating natural language texts from syntactic forms810
hit-scir/elmoformanylangsProvides pre-trained ELMo representations for multiple languages to improve NLP tasks.1,462
guibou/pyfA Haskell library for string formatting with a mini language inspired by Python's printf.66
fjvallarino/monomerA cross-platform GUI library for writing native Haskell applications598
superstar64/aithA language project that aims to create a systems programming language with a strong emphasis on type systems and advanced features like levity polymorphism, first-class inline functions, linear types, and effectful regions.64
g-ford/cradleBuilding a compiler in Haskell using a hands-on, top-down approach inspired by the "Let's Build a Compiler" series161
aisamanra/rust-haskell-ffiA proof-of-concept demonstrating how to call Rust code from Haskell131
sweirich/graded-haskellMechanizations for two dependently-typed languages with graded types24