Markus Forsberg

TL;DR: Finite functions over hereditarily finite algebraic datatypes are used to implement natural language morphology in the functional language Haskell to make it easy for linguists, who are not trained as functional programmers, to apply the ideas to new languages.

TL;DR: The search pattern syntax of extract as well as the search algorithm are explained, and the design of search patterns from the recall and precision point of view are discussed.

TL;DR: Purely functional programming and meta programming based on declarative models are productive approaches to language processing and language resource building, and three tools are presented as evidence of this: BNF Converter, Functional Morphology, and Extract.

TL;DR: This work demonstrates BNFC (the BNF Converter), a multi-lingual compiler tool that takes as its input a grammar written in LBNF (Labelled BNF) notation, and generates a compiler front-end (an abstract syntax, a lexer, and a parser).