ACM Home Page
Please provide us with feedback. Feedback
GenI: natural language generation in Haskell
Full text PdfPdf (973 KB)
Source Haskell archive
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell table of contents
Portland, Oregon, USA
SESSION: Session 4 table of contents
Pages: 110 - 119  
Year of Publication: 2006
ISBN:1-59593-489-8
Author
Eric Kow  INRIA/LORIA/UHP
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 33,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1159842.1159858
What is a DOI?

ABSTRACT

In this article we present GenI, a chart based surface realisation tool implemented in Haskell. GenI takes as input a set of first order terms (the input semantics) and a grammar for a given target language (e.g., English, French, Spanish, etc.) and generates sentences in the target language, whose semantic meaning corresponds to the input semantics.The aim of the article is not so much to present GenI or to describe how it is implemented. Rather, we will focus on the aspects of functional programming (higher order functions, monads) and Haskell (typeclasses) that we found important to its design.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
The DOT language. http://www.graphviz.org/doc/info/lang.html.
 
2
Text.Show API documentation.
 
3
CabalGet. http://www.haskell.org/hawiki/CabalGet, 2005.
 
4
H. P. Barendregt. The Lambda Calculus (Studies in Logic and the Foundations of Mathematics). North Holland, October 1984.
 
5
J. Carroll and S. Oepen. High efficiency realization for a widecoverage unification grammar. In Proceedings of the Second International Joint Conference on Natural Language Processing (IJCNLP05), 2005.
6
 
7
D. Roundy et al. Data.ByteString / FPS. http://www.cse.unsw.edu.au/~dons/fps.html, 2006.
 
8
9
 
10
 
11
E. Kow. Adapting polarised disambiguation to surface realisation. In 17th European Summer School in Logic, Language and Information - ESSLLI'05, Edinburgh, UK, Aug 2005.
12
 
13
D. Leijen and E. Meijer. Parsec: Direct style monadic parser combinators for the real world. Technical Report UU-CS-2001-27, Department of Computer Science, Universiteit Utrecht, 2001.
 
14
S. Marlow, S. Jones, and A. Moran. Asynchronous exceptions in Haskell. 2000.
 
15
C. Okasaki. An overview of Edison. In ICFP 2000 (Haskell Workshop), 2000.
16
 
17
J. Saraiva. Halex: A haskell library to model, manipulate and animate regular languages. In Proceedings of the ACM Workshop on Functional and Declarative Programming in Education (FDPE/PLI'02), 2002.
 
18
 
19
Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1&2):3--36, 1995.
 
20
A. van IJzendoorn et al. Blobs diagram editor. http://www.cs.york.ac.uk/fp/darcs/Blobs.
 
21
 
22
K. Vijay-Shanker and A. Joshi. Feature based tags. In Proceedings of the 12th ACL, pages 573--577, Budapest, 1988.
23