article

Realization of natural language interfaces using lazy functional programming

Author:

Richard A. FrostAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 38, Issue 4

Pages 11 - es

https://doi.org/10.1145/1177352.1177353

Published: 25 December 2006 Publication History

Abstract

The construction of natural language interfaces to computers continues to be a major challenge. The need for such interfaces is growing now that speech recognition technology is becoming more readily available, and people cannot speak those computer-oriented formal languages that are frequently used to interact with computer applications. Much of the research related to the design and implementation of natural language interfaces has involved the use of high-level declarative programming languages. This is to be expected as the task is extremely difficult, involving syntactic and semantic analysis of potentially ambiguous input. The use of LISP and Prolog in this area is well documented. However, research involving the relatively new lazy functional programming paradigm is less well known. This paper provides a comprehensive survey of that research.

References

[1]

Abdullah, N. 2003. Two set-theoretic approaches to the semantics of adjective-noun combinations. M.S. thesis, School of Computer Science, University of Windsor, Ontario, Canada.]]

[2]

Abdullah, N. and Frost, R. A. 2005. Adjectives: A uniform semantic approach. In Proceedings of Advances in Artificial Intelligence: the 18th Conference of the Canadian Society for Computational Studies of Intelligence (AI'02). B. Kegl and G. Lapalme, Eds. Lecture Notes in Computer Science, vol. 3501. Springer-Verlag, 330--341.]]

Digital Library

[3]

Ahn, K., Bos, J., Clark, S., Curran, J. R., Dalmas, T., Leidner, J. L., Smillie, M. B., and Webber, B. 2004. Question answering with QED and WEE at TREC-2004. In Proceedings of the 13th Text Retrieval Conference (TREC'04). E. M. Voorhees and L. P. Buckland, Eds. U.S. National Institute of Standards and Technology, (NIST), Gaithesburg, MD.]]

[4]

Ajdukiewicz, K. 1935. Die syntaktische konnexitat. Studia Philosophica 1, 1--27.]]

[5]

Andersson, I. and Sodereberg, T. 2003. Spanish morphology implemented in a functional programming language. M.S. thesis, Department of Computing Science Chalmers University of Technology and the University of Gothenburg.]]

[6]

Androutsopoulos, I., Ritchie, G. D., and Thanisch, P. 1995. Natural language interfaces to databases: An introduction. J. Lang. Engin. 1, 1, 29--81.]]

[7]

Augusteijn, L. 1990. The elegant compiler generator system. In Proceedings of the International Conference WAGA: Attribute Grammars and their Applications, P. Dransart and M. Jourdan, Eds. Lecture Notes in Computer Science, vol. 461. Springer-Verlag, 238--254.]]

Digital Library

[8]

Backus, J. W. 1959. The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM conference. In Proceedings of the International Conference on Information Processing, UNESCO. 125--132.]]

[9]

Baldridge, J. M. and Kruijff, G. M. 2004. Course notes on combinatorial categorial grammar. http://esslli2004.loria.fr/content/readers/51.pdf.]]

[10]

Bar-Hillel, Y. 1953. A quasi-arithmetical notation for syntactic description. Language 29, 47--58.]]

[11]

Barker, C. 2002. Continuations and the nature of quantification. Natural Language Seman. 10, 211--242.]]

[12]

Barker, C. 2004. Continuations in natural language. In Proceedings of the 4th ACM SIGPLAN Continuations Workshop (CW'04), H. Thielecke, Ed. School of Computer Science, University of Birmingham, 1--11.]]

[13]

Benthem, J. V. 1986. Language in action: categories, lambdas and dynamic logic. Sudies in Logic and the Foundation of Mathematics. D. Reidel Publishing.]]

[14]

Benthem, J. V. 1987. Categorial grammars and lambda calculus. In Mathematical Logic and its Applications, D. Skordev, Ed. Plenum Press.]]

[15]

Benthem, J. V. 1991. Language in action: categories, lambdas and dynamic logic. Sudies in Logic and the Foundation of Mathematics, vol. 30. North-Holland.]]

[16]

Blackburn, P. and Bos, J. 2005. Representation and Inference for Natural Language. A First Course in Computational Semantics. CSLI Publications, Stanford University.]]

[17]

Blackburn, P., Dymetman, M., Lecomte, A., Ranta, A., Retore, C., and de la Clergerie, E. V. 1997. Logical aspects of computational linguistics: An introduction. In Logical Aspects of Computational Linguistics, C. Retore, Ed. Lecture Notes in Computer Science, vol. 1328. Springer-Verlag, 1--20.]]

Digital Library

[18]

Bogavac, L. 2004. Functional morphology for Russian. M.S. thesis, Department of Computing Science, Chalmers University of Technology and the University of Gothenburg.]]

[19]

Boszahin, C. 1997. Combinatory logic and natural language parsing. Elektrik, Turkish J. of EE and CS 5, 3, 347--357.]]

[20]

Bringet, B. 2005. Embedded grammars. M.S. thesis, Department of Computer Science and Engineering, Chalmers University of Technology and Gothenburg University.]]

[21]

Brus, T., Eekelen, M. V., Leer, M. V., Plasmeijer, M. J., and Barendregt, H. P. 1987. CLEAN---A language for functional graph rewriting. In Proceedings of Conference on Functional Programming Languages and Computer Architecture (FPCA'87), Kahn, Ed. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, 364--384.]]

Digital Library

[22]

Burge, W. H. 1975. Recursive Programming Techniques. Addison-Wesley Publishing Co., Reading, MA.]]

[23]

Burke, D. A. and Johannisson, K. 2005. Translating formal software specifications to natural language/a grammar based approach. In Proceedings of Logical Aspects of Computational Linguistics (LACL'05), P. Blace, E. Stabler, J. Busquets, and R. Moot, Eds. Lecture Notes in Artificial Intelligence, vol. 3402. Springer-Verlag, 52--66.]]

Digital Library

[24]

Callaghan, P. C. 1998. An evaluation of LOLITA and related natural language processing systems. Ph.D. thesis, Department of Computer Science, University of Durham.]]

[25]

Callaghan, P. C. 2005. Generalized LR parsing. In The Happy User Guide (Chap. 3). Simon Marlow.]]

[26]

Carpenter, R. 1998. Type-Logical Semantics. Bradford Books.]]

Digital Library

[27]

Chomsky, N. 1957. Syntactic Structures. Mouton de Gruyter, The Hague.]]

[28]

Constantino, M. 1999. IE-Expert: Integrating natural language processing and expert systems techniques for real-time equity derivatives trading. J. Computat. Intell. Finance 7, 2, 34--52.]]

[29]

Copestake, A. 2005. Natural language processing. Lecture Notes, Computer Laboratory, University of Cambridge.]]

[30]

Curry, H. and Feys, R. 1958. Combinatory logic. Studies in Logic, vol. 1. North Holland.]]

[31]

Dalmas, T. 2004. Wee/QAAM Manual. School of Informatics, University of Edinburgh.]]

[32]

Dowty, D. 1979. Word Meaning and Montague Grammar. D. Reidel Publishing Co.]]

[33]

Dowty, D. R., Wall, R. E., and Peters, S. 1981. Introduction to Montague Semantics. D. Reidel Publishing Co.]]

[34]

Dymetman, M., Lux, V., and Ranta, A. 2000. XML and multilingual document authoring: Convergent trends. In Proceedings of the 18th International Conference on Computational Linguistics (COLING'00). Morgan Kaufmann, 243--249.]]

Digital Library

[35]

Eijck, J. V. 2001. Incremental dynamics. J. Logic, Language and Inform. 10, 3, 319--351.]]

Digital Library

[36]

Eijck, J. V. 2003. Parser combinators for extraction. In Proceedings of the 14th Amsterdam Colloquium, P. Dekker and R. van Rooy, Eds. 99--104.]]

[37]

Eijck, J. V. 2004. Deductive parsing in haskell. Unpublished paper Uil-OTS/CWI/ILLC, Amsterdam and Utrecht.]]

[38]

Eijck, J. V. and Nouwen, R. 2002. Quantification and reference in incremental processing. Unpublished paper, UiL-OTS/CWI/ILLC, Amsterdam and Utrecht.]]

[39]

Fairburn, J. 1986. Making form follow function: An exercise in functional programming style. Tech. rep. 89, Computer Laboratory, University of Cambridge.]]

[40]

Fernandes, J. 2004. Generalized LR parsing in Haskell. Tech. rep. DI-PURe-04.11.01, Departamento de Informatica, da Universidade do Minho, Portugal.]]

[41]

Fernandez, M. 1995. Spanish generation in the NL system LOLITA. M.S. thesis, Department of Computer Science, University of Durham.]]

[42]

Fokker, J. 1995. Functional parsers. In Advanced Functional Programming: 1st International Spring School on Advanced Functional Programming Techniques, J. Jeuring and E. Meijer, Eds. Lecture Notes in Computer Science, vol. 924. Springer-Verlag, 1--23.]]

Digital Library

[43]

Ford, B. 2002. Packrat parsing: Simple, powerful, lazy, linear time. In Procedings of the ACM SIGPLAN ICFP, International Conference on Functional Programming. ACM Press, 36--47.]]

Digital Library

[44]

Forsberg, M. 2004. Applications of functional programming in processing formal and natural languages. Licentiate thesis, Department of Computer Science and Engineering. Chalmers University of Technology and Gothenburg University.]]

[45]

Forsberg, M. and Ranta, A. 2004. Functional morphology. In Procedings of the 9th ACM SIGPLAN International Conference on Functional Programming ICFP. ACM Press, 213--223.]]

Digital Library

[46]

Frank, A. U. 2001. Tiers of ontology and consistency constraints in geographical information systems. Int. J. Geograph. Inform. Science 15, 7, 667--678.]]

[47]

Frost, R. A. 1992. Constructing programs as executable attribute grammars. The Comput. J. 35, 4, 376--389.]]

Digital Library

[48]

Frost, R. A. 1993. Guarded attribute grammars. Softw. Pract. Exper. 23, 10, 1139--1156.]]

Digital Library

[49]

Frost, R. A. 2002. W/AGE the windsor attribute grammar programming environment. In Proceedings of IEEE Symposia on Human Centric Computing Languages and Environments (HCC'02). 96--99.]]

Digital Library

[50]

Frost, R. A. 2003. Monadic memoization: Towards correctness-preserving reduction of search. In Proceedings of Advances in Artificial Intelligence: 16th Conference of the Canadian Society for Computational Studies of Intelligence (AI'03), Y. Xiang and B. Chaib-draa, Eds. Lecture Notes in Artificial Intelligence, vol. 2671. Springer-Verlag, 66--80.]]

[51]

Frost, R. A. 2005. A call for a public-domain speechweb. Comm. ACM 48, 11, 45--49.]]

Digital Library

[52]

Frost, R. A. 2006. Functional pearl; polymorphism and the meaning of transitive verbs. Tech. rep. 06-006, School of Computer Science, University of Windsor, Ontario, Canada.]]

[53]

Frost, R. A. and Boulos, P. 2002. An efficient compositional semantics for natural language database queries with arbitrarily-nested quantification and negation. In Proceedings of Advances in Artificial Intelligence: 15th Conference of the Canadian Society for Computational Studies of Intelligence (AI'02). R. Cohen and B. Spencer, Eds. Lecture Notes in Artificial Intelligence, vol. 2338. Springer-Verlag, 252--267.]]

Digital Library

[54]

Frost, R. A. and Hafiz, R. 2006. A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time. SIGPLAN Notices 42, 5, 46--54.]]

Digital Library

[55]

Frost, R. A., Hafiz, R., and Callaghan, P. 2006. A general top-down parsing algorithm, accommodating ambiguity and left recursion in polynomial time. Tech. rep. 06-022, School of Computer Science, University of Windsor, Canada.]]

[56]

Frost, R. A. and Launchbury, E. J. 1989. Constructing natural language interpreters in a lazy functional language. Comput. J. (Special issue on Lazy Functional Programming) 32, 2, 108--121.]]

Digital Library

[57]

Frost, R. A. and Szydlowski, B. 1995. Memoizing purely-functional top-down backtracking language processors. Science Comput. Program. 27, 263--288.]]

Digital Library

[58]

Garigliano, R., Morgan, R., and Smith, M. 1992. LOLITA: Progress report 1. Tech. rep. 12/92, Department of Computer Science. University of Durham.]]

[59]

Garigliano, R., Morgan, R., and Smith, M. 1993. The LOLITA system as a contents scanning tool. In Proceedings of the 13th International Conference on Artificial Intelligence, Expert Systems and Natural Language Processing. Avignon, France.]]

[60]

Girard, J., Lafont, Y., and Taylor, P. 1988. Proofs and types. In Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press.]]

Digital Library

[61]

Grune, G. and Jacobs, C. J. H. 1990. Parsing Techniques; A Practical Guide. Ellis Horwood, Chichester, England.]]

Digital Library

[62]

Hahnle, R., Johannisson, K., and Ranta, A. 2002. An authoring tool for informal and formal requirements specifications. In Proceedings of FASE Fundamental Approchaes to Software Engineering. R. D. Kutsche and H. Weber, Eds. Lecture Notes in Computer Science, vol. 2306. Springer-Verlag, 233--248.]]

Digital Library

[63]

Hallgreen, T. and Ranta, A. 2000. An extensible proof text editor. In Proceedings of (LPAR'00). M. Parigot and A. Voronkov, Eds. Lecture Notes in Artificial Intelligence, vol. 1955. Springer-Verlag, 70--84.]]

[64]

Heitz, J. 1996. An investigation into figurative language in the LOLITA NLP system. M.S. thesis, Department of Computer Science, University of Durham.]]

[65]

Hendriks, H. 1993. Studied flexibility: Categories and types in syntax and semantics. Ph.D. thesis, Universiteit van Amsterdam.]]

[66]

Hill, S. 1996. Combinators for parsing expressions. J. Funct. Program. 6, 3, 445--463.]]

[67]

Hinrichs, E. W. 1988. Tense, quantifiers, and contexts. Computat. Linguist. 14, 2, 3--14.]]

Digital Library

[68]

Hopcroft, J. E., Ullman, J. D., and Motwani, R. 2000. Introduction to Automata Theory, Languages, and Computation, 2nd Ed. Addison Wesley.]]

Digital Library

[69]

Hudak, P., Peterson, J., and Fasel, J. 2000. A gentle introduction to Haskell. www.Haskell.org.]]

Digital Library

[70]

Hudak, P., Peyton-Jones, S. L., Wadler, P., Boutel, B., Fairbairn, J., Fasel, J. H., Guzman, M. M., Hammond, K., Hughes, J., Johnsson, T., Kierburtz, R. B., Nikhil, R. S., Partain, W., and Peterson, J. 1992. Report on the programming language Haskell, a non-strict, purely functional language. SIGPLAN Notices 27, 5, R1--R164.]]

Digital Library

[71]

Huet, G. 2003. Zen and the art of symbolic computing: Light and fast applicative algorithms for computational linguistics. In Proceedings of Practical Aspects of Declarative Languages Symposium (PADL'03), V. Dahl and P. Wadler, Eds. Lecture Notes in Artificial Intelligence, vol. 2562. Springer-Verlag, 252--267.]]

Digital Library

[72]

Hughes, R. J. M. 1989. Why functional programming matters. Comput. J. (Special Issue on Lazy Functional Programming). 32, 2, 98--107.]]

Digital Library

[73]

Hughes, R. J. M. 2000. Generalizing monads to arrows. Science Comp. Program. 37, 67--111.]]

Digital Library

[74]

Hutton, G. 1992. Higher-order functions for parsing. J. Funct. Program. 2, 3, 323--343.]]

[75]

Hutton, G. and Meijer, E. 1998. Monadic parser combinators. J. Funct. Program. 8, 4, 437--444.]]

Digital Library

[76]

Iwanska, L. 1992. A general semantic model of negation in natural language: Representation and inference. Ph.D. thesis, Computer Science, University of Illinois at Urbana-Champaign.]]

Digital Library

[77]

Jeuring, J. and Swierstra, S. D. 1994. Bottom-up grammar analysis. In Proceedings of Programming Languages and Systems, (ESOP'94), D. Sannella, Ed. Lecture Notes in Computer Science, vol. 788. Springer-Verlag, 317--332.]]

Digital Library

[78]

Johannisson, K. 2005. Formal and informal software specifications. Ph.D. thesis, Department of Computer Science and Engineering. Chalmers University of Technology and Gothenburg University.]]

[79]

Johnson, M. 1995. Squibs and discussions: Memoization in top-down parsing. Computat. Linguist 21, 3, 405--417.]]

Digital Library

[80]

Johnsson, T. 1987. Attribute grammars as a functional programming paradigm. In Functional Programming Languages and Computer Architecture, G. Kahn, Ed. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, 154--173.]]

Digital Library

[81]

Jones, M. P., Hudak, P., and Shuamyan, S. 1995. Using types to parse natural language. In Proceedings of the Glasgow Workshop on Functional Programming. Workshops in Computer Science Series. (IFIP), Springer-Verlag.]]

[82]

Khegai, J., Nordstrm, B., and Ranta, A. 2003. Multilingual syntax editing in GF. In Proceedings of the 4th International Conference on Intelligent Text Processing and Computational Linguistics (CICLing'03), A. F. Gelbukh, Ed. Lecture Notes in Computer Science, vol. 2588. Springer-Verlag, 453--464.]]

[83]

Khegai, J. and Ranta, A. 2004. Building and using a Russian resource grammar in GF. In Proceedings of the 5th International Conference on Intelligent Text Processing and Computational Linguistics (CICLing'04), A. F. Gelbukh, Ed. Lecture Notes in Computer Science, vol. 2945. Springer-Verlag, 38--41.]]

[84]

Koopman, P. and Plasmeijer, R. 1999. Efficient combinator parsers. In Proceedings of Implementation of Functional Languages: Tenth International Workshop (IFL'98). K. Hammand, T. Davie, and C. Clack, Eds. Lecture Notes in Computer Science, vol. 1595. Springer-Verlag, 122--138.]]

Digital Library

[85]

Korte, L. 2004. Deep types for categorial grammar: A side effect analysis. In Proceedings of TAAL Postgraduate Conference. Edinburgh University.]]

[86]

Kudlek, M., Martin-Vide, C., Mateescu, A., and Mitrana, V. 2003. Contexts and the concept of mild-context-sensitivity. Linguist. Philos. 26, 703--725.]]

[87]

Kuhn, W. 2002. Modelling the semantics of geographical categories through conceptual integration. In GIScience. Lecture Notes in Computer Science, vol. 2478. Springer-Verlag, 108--118.]]

Digital Library

[88]

Kuno, S. 1965. The predictive analyzer and a path elimination technique. Comm. ACM 8, 7, 453--462.]]

Digital Library

[89]

Lambek, J. 1958. The mathematics of sentence structure. Amer. Mathemat. Month. 65, 154--170.]]

[90]

Lapalme, G. and Lavier, F. 1990. Using a functional language for parsing and semantic processing. Tech. rep. 715a, Departement d'informatique et recherche operationelle, Universite de Montreal.]]

[91]

Lapalme, G. and Lavier, F. 1993. Using a functional language for parsing and semantic processing. Computat. Intell. 9, 111--131.]]

[92]

Leermakers, R. 1993. The Functional Treatment of Parsing. International Series in Engineering and Computer Science. Kluwar Academic Publishers.]]

Digital Library

[93]

Leijen, D. and Meijer, E. 2001. Parsec: Direct style monadic parser combinators for the real world. Tech. rep. UU-CS-2001-35, Department of Computer Science, University of Utrecht.]]

[94]

Lickman, P. 1995. Parsing with fixed points. M.S. thesis, University of Cambridge.]]

[95]

Ljunglof, P. 2002a. Functional programming and NLP. Tech. rep., Department of Computer Science, Chalmers University.]]

[96]

Ljunglof, P. 2002b. Pure functional parsing-an advanced tutorial. Licentiate thesis, Department of Computing Science, University of Gothenburg.]]

[97]

Ljunglof, P. 2004. Functional pearls: Functional chart parsing of context-free grammars. functional pearl. J. Funct. Program. 14, 6, 669--680.]]

Digital Library

[98]

Loidl, H., Morgan, R., Trinder, P., Poria, S., Cooper, C., Peyton-Jones, S., and Garigliano, R. 1997. Parallelising a large functional program, or: keeping LOLITA busy. In International Workshop on the Implementation of Functional Languages, C. Clack, K. Hammond, and T. Davie, Eds. Lecture Notes in Computer Science, vol. 1467. Springer-Verlag, 198--213.]]

Digital Library

[99]

Long, D. and Garigliano, R. 1994. Analogy and Causality (A Model and Application). Ellis Horwood, Chichester, UK.]]

Digital Library

[100]

Marlow, S. 2005. The Happy User Guide. http://www.Haskell.org/happy/doc/html/index.html.]]

[101]

Medlock, B. 2002. A tool for generalized LR parsing in Haskell. Single honours C.S. project report, Department of Computer Science, University of Durham.]]

[102]

Meziane, F. and Metais, E., Eds. 2004. Natural Language Processing and Information Systems: 9th International Conference on Applications of Natural Language to Information Systems, (NLDB'04). Lecture Notes in Computer Science, vol. 3136. Springer-Verlag.]]

Digital Library

[103]

Montague, R. 1970. Universal grammar. Theoria 36, 373--398. (Reprinted in Thomason 1974, 222--246.)]]

[104]

Montague, R. 1973. The proper treatment of quantification in ordinary English. In Approaches to Natural Language, K. J. J. Hintikka, J. M. E. Moravcsik, and P. Suppes, Eds. D. Reidel Publishing Co., 221--242.]]

[105]

Moortgat, M. 1988. Categorial Investigations. Logical and Linguistic Aspects of the Lambek Calculus. Foris Publications, Dordrecht.]]

[106]

Morgan, K., Garigliano, R., Callaghan, P., Poria, S., Smith, M., Urbanowicz, A., Collingham, R., Constantino, M., Cooper, C., and the LOLITA group, University of Durham, U. 1995. Description of the LOLITA system as used for MUC-6. In Proceedings of the 6th Message Understanding Conference (MUC6). NIST, Morgan-Kaufmann.]]

Digital Library

[107]

Naur, P., Backus, J. W. (and Collegues) 1960. Report on the algorithmic language ALGOL 60. Comm. ACM 3, 5, 299--314.]]

Digital Library

[108]

Nikhil, R. S. 1993. A multithreaded implementation of Id using P-RISC graphs. In Proceedings of Languages and Compilers for Parallel Computing LCPC, 6th International Workshop, U. Banerjee, D. Gelernter, A. Nicolau, and D. A. Padua, Eds. Lecture Notes in Computer Science, vol. 768. Springer-Verlag (1994), 390--405.]]

Digital Library

[109]

Norvig, P. 1991. Techniques for automatic memoisation with applications to context-free parsing. Computat. Linguist. 17, 1, 91--98.]]

Digital Library

[110]

Paaki, J. 1995. Attribute grammar paradigms---A high-level methodology in language implementation. ACM Comput. Surv. 27, 2, 196--256.]]

Digital Library

[111]

Pace, G. 2004. Monadic compositional parsing with context using maltese as a case study. In Proceedings of the Computer Science Annual Workshop (CSAW'04), University of Malta, G. Pace and J. Cordina, Eds. 60--70.]]

[112]

Panitz, S. E. 1996. Termination proofs for a lazy functional language by abstract reduction. Tech. rep. 06, J. W. Goethe-Universitat. citeseer.nj.nec.com/panitz96termination.html.]]

[113]

Partee, B. H. 1975. Montague grammar and transformational grammar. Linguis. Inquiry 6, 2, 203--300.]]

[114]

Partee, B. H., Ed. 1976. Montague Grammar. Academic Press, New York, NY.]]

[115]

Partee, B. H. 2001. Montague Grammar. In International Encyclopedia of the Social and Behavioral Sciences, N. J. Smelser and P. B. Baltes, Eds. Elsevier.]]

[116]

Partee, B. H. and Hendricks, L. W. 1997. Montague Grammar. In Handbook of Logic and Language, J. van Benthem and A. ter Meulen, Eds. Elsevier, 5--91.]]

[117]

Partridge, A. and Wright, D. 1996. Predictive parser combinators need four values to report errors. J. Funct. Program. 6, 2, 355--364.]]

[118]

Pembecci, I. 1995. A combinator parser for the morphological analysis of Turkish. Senior project report, Department of Computer Engineering, Middle East Technical University, Ankara.]]

[119]

Pereira, F. 1990. Categorial semantics and scoping. Computat. Linguis. 16, 1--10.]]

Digital Library

[120]

Peyton-Jones, S. 2003. The Haskell 98 language. J. Funct. Program. 13, 1, 0--255.]]

[121]

Ranta, A. 1994. Type-Theoretical Grammar. Oxford University Press, Oxford, UK.]]

Digital Library

[122]

Ranta, A. 1995. Type-theoretical interpretation and generalization of phrase structure grammar. Bull. of the IGPL 3, 2, 319--342.]]

[123]

Ranta, A. 2001. 1+n representations of Italian morphology. Essays dedicated to Jan von Plato on the occasion of his 50th birthday.]]

[124]

Ranta, A. 2004. Grammatical framework. J. Funct. Program. 14, 2, 145--189.]]

Digital Library

[125]

Ranta, A. and Cooper, R. 2004. Dialogue systems as proof editors. J. Logic, Language Inform. 13, 2, 225--240.]]

Digital Library

[126]

Reed, C., Long, D., Fox, M., and Garagnani, M. 1997. Persuasion as a form of inter-agent negotiation. In Proceedings of Workshop on Distributed Artificial Intelligence (PRICAI'96). Lecture Notes in Computer Science, vol. 1286. Springer-Verlag, 120--136.]]

Digital Library

[127]

Roche, E. and Schabes, Y. 1997. Finite-State Language Processing. Bradford Books.]]

Digital Library

[128]

Rose, T., Elworthy, D., Kotche, A., Clare, A., and Tsonis, P. 2000. ANVIL: A system for the retrieval of captioned images using NLP techniques. In Proceedings of Challenge of Image Retrieval (CIR'00). J. P. Eakins and P. G. B. Enser, Eds. University of Brighton, UK.]]

[129]

Roy, M. 2005. Extending a set-theoretic implementation of Montague Semantics to accommodate n-ary trnasitive verbs. M.S. thesis, School of Computer Science, University of Windsor, Ontario, Canada.]]

[130]

Roy, M. and Frost, R. 2004. Extending Montague Sematics for use in natural language database-query processing. In Proceedings of Advances in Artificial Intelligence: The 17th Conference of the Canadian Society for Computational Studies of Intelligences (AI'04). A. Tawfik and S. Goodwin, Eds. Lecture Notes in Computer Science, vol. 3060. Springer-Verlag, 567--568.]]

[131]

Savitch, W. J. 1989. A formal model for context-free languages augmented with reduplication. Computat. Linguist. 15, 4, 250--261.]]

Digital Library

[132]

Shan, C. 2001a. Monads for natural language semantics. In Proceedings of the 13th European Summer School in Logic, Language and Information.Student Session (ESSLLI'01), K. Striegnitz, Ed. Helsinki, Finland, 285--298.]]

[133]

Shan, C. 2001b. A variable-free dynamic semantics. In Proceedings of the 13th Amsterdam Colloquium, R. van Rooy and M. Stokhof, Eds. Institute for Logic, Language and Computation, Universiteit van Amsterdam, 204--209.]]

[134]

Shan, C. 2002. A continuation semantics of interrogatives that accounts for baker's ambiguity. In Semantics and Linguistic Theory (SALT XII). B. Jackson, Ed. Cornell University Press, 246--265.]]

[135]

Shan, C. 2003. Linguistic side effects. In Proceedings of the 18th Annual IEEE Symposium on Logic and Computer Science (LICS'03) Workshop on Logic and Computational Linguistics. L. Libkin and G. Penn, Eds. Ottawa, Canada.]]

[136]

Shan, C. and Barker, C. 2004. Explaining crossover and superiority as left-to-right evaluation. In Worshop on Semantic Approaches to Binding Theory (ESSLLI'04), the 16th European Summer School in Logic, Language and Information. E. Keenan and P. Schlenker, Eds. Nancy, France.]]

[137]

Shaumyan, S. 1977. Applicational Grammar as a Semantic Theory of Natural Language. Edinburgh University Press.]]

[138]

Shaumyan, S. and Hudak, P. 1997. Linguistic, philosophical, and pragmatics aspects of type-directed natural langugae. In Proceedings of Logical Aspects of Computational Linguistics: 2nd International Conference (LACL'97). A. Lecomte, F. Lamarche, and G. Perrier, Eds. Lecture Notes in Computer Science, vol. 1582. Springer-Verlag, 70--91.]]

Digital Library

[139]

Shaumyan, S. and Segond, F. 1994. Long-distance dependencies and applicative universal grammar. In Proceedings of the 15th International Conference on Computational Linguistics (COLING). Kyoto, Japan, 853--858.]]

Digital Library

[140]

Shieber, S. M. 1985. Evidence against the context-freeness of natural language. Linguist. Philos. 8, 333--343.]]

[141]

Shiel, B. A. 1976. Observations on context-free parsing. Tech. rep. TR 12-76, Center for Research in Computing Technology, Aiken Computational Laboratory, Harvard University.]]

[142]

Shiu, S., Luo, Z., and Garigliano, R. 1996. Type theoretic semantics for SemNet. In Practical Reasoning: International Conference on Formal and Applied Practical Reasoning (FAPR'96). D. Gabbay and H. J. Ohlbach, Eds. Lecture Notes in Artificial Intelligence, vol. 1085. Springer-Verlag, 582--595.]]

Digital Library

[143]

Shiu, S. K. Y. 1997. Type theoretic semantics for semantic networks: An application to natural language engineering. Ph.D. thesis, Department of Computer Science, University of Durham.]]

[144]

Short, S., Shiu, S., and Garigliano, R. 1996. Distributedness and non-linearity of LOLITA's semantic network. In Proceedings of the 16th International Conference on Computational Linguistics. Center for Sprogteknologi, Copenhagen, 436--441.]]

Digital Library

[145]

Smith, M. H. 1996. Natural language generation in the LOLITA system: An engineering approach. Ph.D. thesis, Department of Computer Science, University of Durham.]]

[146]

Smith, M. H., Garigliano, R., and Morgan, R. 1994. Generation in the LOLITA system: An engineering approach. In Proceedings of the 16th International Natural Language Generation Workshop. 241--244.]]

[147]

Steedman, M. 1991. Type-raising and directionality in combinatory grammar. In Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics (ACL). Berkeley CA, 71--79.]]

Digital Library

[148]

Steedman, M. 1996. A very short introduction to CCG. Unpublished paper. http://www.coqsci.ed.ac.uk/steedman/paper.html]]

[149]

Steedman, M. 1999. Alternating quantifier scope in CCG. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL). Morgan Kaufmann, 301--308.]]

Digital Library

[150]

Steedman, M. and Baldridge, J. 2003. Combinatory categorial grammar. Unpublished tutorial, School of Informatics, Edinburgh University. ftp://ftp.cogsci.ed.ac.uk/pub/steedman/ccg/manifesto.pdf.]]

[151]

Stoy, J. E. 1977. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA.]]

Digital Library

[152]

Swierstra, S. and Duponcheel, L. 1996. Deterministic, error-correcting combinator parsers. In Advanced Functional Programmin, J. Launchbury, E. Meijer, and T. Sheard, Eds. Lecture Notes in Computer Science, vol. 1129. Springer-Verlag, 184--207.]]

Digital Library

[153]

Sypniewski, B. P. 1999. An introduction to applicative universal grammar. Unpublished paper. http://elvis.rowan.edu/bps/ling/introAUG.pdf.]]

[154]

Szydlowski, B. 1996. Complexity analysis and monadic specification of memoized functional parsers. M.S. thesis, School of Computer Science, University of Windsor.]]

Digital Library

[155]

Thomason, R. H. 1974. Formal Philosophy: Selected Papers of Richard Montague. Yale University Press, New Haven CT.]]

[156]

Tomita, M. 1985. Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers.]]

Digital Library

[157]

Turner, D. A. 1979. A new implementation technique for applicative languages. Softw. Pract. Exper. 9, 1, 31--49.]]

[158]

Turner, D. A. 1981. Aspects of the implementation of programming languages. Ph.D. thesis, Oxford University, Oxford, UK.]]

[159]

Turner, D. A. 1985. Miranda: a lazy functional programming language with polymorphic types. In Proceedings of the IFIP International Conference on Functional Programmiong Languages and Computer Architecture. J. Jouannaud, Ed. Lecture Notes in Computer Science, vol. 201. Springer Verlag, 1--16.]]

Digital Library

[160]

Turner, D. A. 1986. An overview of miranda. SIGPLAN Notices 21, 12, 158--166.]]

Digital Library

[161]

Udderborg, G. 1988. A functional parser generator. Licentiate thesis, Chalmers University of Technology, Gothenburg.]]

[162]

Wadler, P. J. 1985. How to replace failure by a list of successes. In Proceedings of the IFIP International Conference on Functional Programmiong Languages and Computer Architecture, J. Jouannaud, Ed. Lecture Notes in Computer Science, vol. 201. Springer-Verlag, 113--128.]]

Digital Library

[163]

Wadler, P. J. 1989. Special edition on lazy functional programming. Comput. J. 32, 2.]]

[164]

Wadler, P. J. 1990. Comprehending monads. In Proceedings of the ACM SIGPLAN/SIGACT/SIGART Symposium on Lisp and Functional Programming. ACM Press, 61--78.]]

Digital Library

[165]

Wadler, P. J. 1994. Tech. rep., http://homepages.inf.ed.ac.uk/wadler/realworld/satelite.html.]]

[166]

Wadler, P. J. 1995. Monads for functional programming. In 1st International Spring School on Advanced Functional Programming Techniques, J. Jeuring and E. Meijer, Eds. Lecture Notes in Computer Science, vol. 924. Springer-Verlag, 24--52.]]

Digital Library

[167]

Wang, Y. 1994. An intelligent computer-based tutoring approach for the management of negative transfer. Ph.D. thesis, Department of Computer Science, Durham University.]]

[168]

Ziff, D. A., Spackman, S. P., and Waclena, K. 1995. Funser: A functional server for textual information retrieval. J. Funct. Program. 5, 3, 317--343.]]

Cited By

Peelar SFrost R(2020)A Compositional Semantics for a Wide-Coverage Natural-Language Query Interface to a Semantic Web Triplestore2020 IEEE 14th International Conference on Semantic Computing (ICSC)10.1109/ICSC.2020.00054(257-262)Online publication date: Feb-2020
https://doi.org/10.1109/ICSC.2020.00054
Gudivada V(2018)Natural Language Core Tasks and ApplicationsComputational Analysis and Understanding of Natural Languages: Principles, Methods and Applications10.1016/bs.host.2018.07.010(403-428)Online publication date: 2018
https://doi.org/10.1016/bs.host.2018.07.010
Faris WCheng K(2009)Understanding and executing a declarative sentence involving a forms-of-be verbProceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics10.5555/1732323.1732602(1633-1638)Online publication date: 11-Oct-2009
https://dl.acm.org/doi/10.5555/1732323.1732602
Show More Cited By

Index Terms

Realization of natural language interfaces using lazy functional programming

Recommendations

Heap recycling for lazy languages
PEPM '08: Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Pure functional programming languages preclude destructive updates of heap-allocated data. In such languages, all newly computed algebraic values claim freshly allocated heap space, which typically causes idiomatic programs to be notoriously inefficient ...
The design and implementation of the GILENA natural language interfaces specification system

This paper considers a finite-state parsing algorithm for implementing natural language interfaces. The algorithm has some practical improvements compared to other recognizing algorithms. Resolution of syntax ambiguity, programming facilities and post ...
Purely functional lazy non-deterministic programming
ICFP '09

Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-determinism. Yet these benefits are seldom enjoyed in functional ...

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 38, Issue 4

2006

153 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/1177352

Issue’s Table of Contents

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 December 2006

Published in CSUR Volume 38, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
3,734
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)1

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Peelar SFrost R(2020)A Compositional Semantics for a Wide-Coverage Natural-Language Query Interface to a Semantic Web Triplestore2020 IEEE 14th International Conference on Semantic Computing (ICSC)10.1109/ICSC.2020.00054(257-262)Online publication date: Feb-2020
https://doi.org/10.1109/ICSC.2020.00054
Gudivada V(2018)Natural Language Core Tasks and ApplicationsComputational Analysis and Understanding of Natural Languages: Principles, Methods and Applications10.1016/bs.host.2018.07.010(403-428)Online publication date: 2018
https://doi.org/10.1016/bs.host.2018.07.010
Faris WCheng K(2009)Understanding and executing a declarative sentence involving a forms-of-be verbProceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics10.5555/1732323.1732602(1633-1638)Online publication date: 11-Oct-2009
https://dl.acm.org/doi/10.5555/1732323.1732602
Cheng KFaris W(2009)A multi-dimensional data organization for natural language processingJournal of Computational Methods in Sciences and Engineering10.5555/1608790.16087979:1,2S1(81-90)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.5555/1608790.1608797
Ranta A(2009)GF: A Multilingual Grammar FormalismLanguage and Linguistics Compass10.1111/j.1749-818X.2009.00155.x3:5(1242-1265)Online publication date: 10-Sep-2009
https://doi.org/10.1111/j.1749-818X.2009.00155.x
Faris WCheng K(2009)Understanding and executing a declarative sentence involving a forms-of-be verb2009 IEEE International Conference on Systems, Man and Cybernetics10.1109/ICSMC.2009.5346782(1633-1638)Online publication date: Oct-2009
https://doi.org/10.1109/ICSMC.2009.5346782
Frost RHafiz RCallaghan P(2008)Parser combinators for ambiguous left-recursive grammarsProceedings of the 10th international conference on Practical aspects of declarative languages10.5555/1785754.1785766(167-181)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.5555/1785754.1785766
Frost RHafiz RCallaghan P(2008)Parser Combinators for Ambiguous Left-Recursive GrammarsPractical Aspects of Declarative Languages10.1007/978-3-540-77442-6_12(167-181)Online publication date: 2008
https://doi.org/10.1007/978-3-540-77442-6_12
Frost RFortier R(2007)An efficient denotational semantics for natural language database queriesProceedings of the 12th international conference on Applications of Natural Language to Information Systems10.5555/2394705.2394709(12-24)Online publication date: 27-Jun-2007
https://dl.acm.org/doi/10.5555/2394705.2394709
Frost RHafiz RCallaghan PBunt HMerlo P(2007)Modular and efficient top-down parsing for ambiguous left-recursive grammarsProceedings of the 10th International Conference on Parsing Technologies10.5555/1621410.1621425(109-120)Online publication date: 23-Jun-2007
https://dl.acm.org/doi/10.5555/1621410.1621425
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents