Proc. of a conference on Functional programming languages and computer architecture
Constructing natural language interpreters in a lazy functional language
The Computer Journal - Special issue on Lazy functional programming
An introduction to functional programming
An introduction to functional programming
A gentle introduction to Haskell
ACM SIGPLAN Notices - Haskell special issue
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
Relational program derivation and context-free language recognition
A classical mind
Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Journal of Functional Programming
Realization of natural language interfaces using lazy functional programming
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We describe a natural language parser that uses type information to determine the grammatical structure of simple sentences and phrases. This stands in contrast to studies of type inference where types and grammatical structure play opposite roles, the former being determined by the latter. Our parser is implemented in Haskell and is based on a linguistic theory called applicative universal grammar (AUG). Our results should be interesting to computer scientists in the way in which AUG relates to types and combinatory calculus, and to linguists in the way in which a very simple, brute force parsing strategy performs surprisingly well in both performance and accuracy.