Personal tools

Applications and libraries/Linguistics

From HaskellWiki

< Applications and libraries(Difference between revisions)
Jump to: navigation, search
(Natural language processing and combinatory logic: Small introductory text)
(Portals and other huge resorces)
(23 intermediate revisions by 10 users not shown)
Line 1: Line 1:
 
__TOC__
 
__TOC__
   
== Portals and other huge resorces ==
+
== Portals and other huge resources ==
   
Peter Ljunglöf's many [http://www.cs.chalmers.se/~peb/pubs.html publications] on natural language processing, parsing, formal semantics. Many of them uses Haskell, and there are [http://www.cs.chalmers.se/~peb/software.html downloadable] Haskell sources too.
+
Peter Ljunglöf's many [http://www.ling.gu.se/~peb/pubs.html publications] on natural language processing, parsing, formal semantics. Many of them use Haskell, and there are [http://www.ling.gu.se/~peb/software.html downloadable] Haskell sources too.
   
 
[http://homepages.cwi.nl/~jve/index.html Jan van Eijck's page] contains a huge amount of materials on logic and language:
 
[http://homepages.cwi.nl/~jve/index.html Jan van Eijck's page] contains a huge amount of materials on logic and language:
 
* computational linguistics
 
* computational linguistics
 
* logics (e.g. dynamic epistemic modelling)
 
* logics (e.g. dynamic epistemic modelling)
  +
  +
The [http://projects.haskell.org/nlp Haskell NLP projects] provides a mailing list for Haskellers doing NLP work, as well as a community wiki and darcs repository. Come join us!
  +
  +
[http://nlpwp.org/ Natural Language Processing for The Working Programmer] is a book that provides an introduction to Haskell and NLP.
  +
 
There are many Haskell resources, too.
 
There are many Haskell resources, too.
   
== Natural language processors (and generators) ==
+
== Tools and libraries ==
  +
 
* [http://cypher.monrai.com Cypher] is one of the first software program available which generates the metadata representation of natural language input. Cypher produces RDF graph and SeRQL query representations of sentences, clauses, phrases and questions. The Cypher framework provides a set of robust definition languages, which can be used to extend and create grammars and lexicons. Cypher programming is fun to learn and easy to use, and the specifications are designed to allow a novice to quickly and easily build transcoders for processing highly complex sentences and phrases of any natural language, and to cover any vocabulary
 
* [http://cypher.monrai.com Cypher] is one of the first software program available which generates the metadata representation of natural language input. Cypher produces RDF graph and SeRQL query representations of sentences, clauses, phrases and questions. The Cypher framework provides a set of robust definition languages, which can be used to extend and create grammars and lexicons. Cypher programming is fun to learn and easy to use, and the specifications are designed to allow a novice to quickly and easily build transcoders for processing highly complex sentences and phrases of any natural language, and to cover any vocabulary
* [http://trac.loria.fr/~geni GenI] is a surface realiser for Tree Adjoining Grammars. Surface realisation can be seen as the last stage in a natural language generation pipeline. GenI in particular takes an FB-LTAG grammar and an input semantics (a conjunction of first order terms), and produces the set of sentences associated to the input semantics by the grammar.
+
* [http://trac.loria.fr/~geni GenI] is a surface realiser for Tree Adjoining Grammars. Surface realisation can be seen as the last stage in a natural language generation pipeline. GenI in particular takes an FB-LTAG grammar and an input semantics (a conjunction of first order terms), and produces the set of sentences associated to the input semantics by the grammar. See also [http://www.loria.fr/~kow/ Eric Kow]'s recent publications on it.
  +
* [http://grammaticalframework.org/ Grammatical Framework] (GF) is a compiler and grammatical programming environment written entirely in Haskell, with an interactive interpreter and two GUI interfaces, one written in Fudgets and another written in Java. GF grammars are written in a subset of Haskell and compile into an internal GF format that may be used as embedded parsers in Haskell, parsers in Java (with an embedded Java interpreter gfc2java.jar) and subsequently converted to applets ([http://www.cs.chalmers.se/~markus/gramlets/ Gramlets]). (GF-Haskell to Java translation is performed through an Open Agent Architecture--the original .NET, see [http://www.cs.chalmers.se/~bringert/gf/gf-oaa.html GF OAA].) The GF grammatical formalism handles linguistic entities (morphemes, etc.) using type theory: an approach especially suited to machine translation of controlled natural languages. The [http://www.cs.chalmers.se/~aarne/GF/lib/resource-1.0/doc/index.html Grammar Resource Library], a set of basic grammars for Danish, English, Finnish, French, German, Italian, Norwegian, Russian, Spanish and Swedish, is available as a separate download. GF has been used to translate a fragment of C code to JVM (see [http://www.cs.chalmers.se/~aarne/GF/doc/gfcc.pdf GFCC (PDF document)]).
  +
* [http://www.cs.chalmers.se/~markus/FM/index.html Functional Morphology] - a toolkit for morphology development. Has been used for Swedish, Spanish, Urdu and more.
  +
* [http://www.cs.utah.edu/~hal/HWordNet/index.html HWordNet] - A Haskell interface to WordNet by Hal Daumé III.
  +
* '''Saxophone''' is a fun translator from German to the Saxon dialect. It is part of the [https://sourceforge.net/projects/parallelweb ParallelWeb] project which aims at translating Web pages including all of their links.
   
 
== Natural language processing and combinatory logic ==
 
== Natural language processing and combinatory logic ==
Line 34: Line 39:
   
 
On natural languages relating to combinatory logic, see also
 
On natural languages relating to combinatory logic, see also
* Peter Steedman's [http://citeseer.ist.psu.edu/steedman97does.html Does Grammar Make Use of Bound Variables?]
+
* Mark Steedman's [http://citeseer.ist.psu.edu/steedman97does.html Does Grammar Make Use of Bound Variables?]
 
* Mark Hepple: [http://citeseer.ist.psu.edu/hepple90grammar.html The Grammar and Processing of Order and Dependency: a Categorial Approach]
 
* Mark Hepple: [http://citeseer.ist.psu.edu/hepple90grammar.html The Grammar and Processing of Order and Dependency: a Categorial Approach]
  +
  +
=== Type-Logical Grammar ===
  +
  +
Matteo Capelletti's [http://www.let.uu.nl/users/Matteo.Capelletti/personal/Home.html home page] contains a parser based on the Non-associative Lambek calculus. It supports hypothetical reasoning and Montague style semantics.
   
 
=== Tree Adjoining Grammar ===
 
=== Tree Adjoining Grammar ===
Line 54: Line 63:
   
 
== Parsing natural languages ==
 
== Parsing natural languages ==
  +
===Parsing Natural Language with X-SAIGA parser===
   
  +
The goal of the [http://www.cs.uwindsor.ca/~hafiz/proHome.html X-SAIGA] project is to create algorithms and implementations which enable the construction of language processors (recognizers, parsers, interpreters, translators, etc.) to be constructed as modular and efficient embedded executable specifications of grammars. The syntax analysis is done with a set of parser combinators by overcoming some long standing limitations -
  +
# the simple implementations of parser combinators require [[exponential]] time and space when parsing an ambiguous context free grammar.
  +
# like any top-down recursive descent parsing, the conventional parser combinators won't terminate while processing a left-recursive grammar (i.e. <code>s ::= s *> s *> term 'x'|empty</code>).
  +
  +
As a part of the X-SAIGA project's syntax analysis, a [http://cs.uwindsor.ca/~hafiz/p46-frost.pdf recognition algorithm] that accommodates ambiguous grammars with direct [[left recursion|left-recursive]] rules is described by Frost and Hafiz in 2006. The algorithm curtails the otherwise ever-growing left-recursive parse by imposing depth restrictions. That algorithm was extended to a complete [http://cs.uwindsor.ca/~hafiz/iwpt-07.pdf parsing algorithm] to accommodate indirect as well as direct left-recursion in [[polynomial]] time, and to generate compact polynomial-size representations of the potentially-exponential number of parse trees for highly-ambiguous grammars by Frost, Hafiz and Callaghan in 2007. This extended algorithm accommodates indirect left-recursion by comparing its 'computed-context' with 'current-context'. The same authors also [http://cs.uwindsor.ca/~hafiz/PADL_PAPER_FINAL.pdf described their implementation of a set of parser combinators] written in the [[Haskell]] programming language based on the same algorithm in [http://www.ist.unomaha.edu/padl2008/ PADL 08]. The [http://www.cs.uwindsor.ca/~hafiz/proHome.html X-SAIGA] site has more about the algorithms, implementation details experimental results.
  +
  +
===Monadic Compositional Parsing===
 
Gordon J. Pace: [http://www.cs.um.edu.mt/~csaw/CSAW04/Proceedings/08.pdf Monadic Compositional Parsing with Context Using Maltese as a Case Study], see its [http://www.cs.um.edu.mt/~csaw/CSAW04/ context] too.
 
Gordon J. Pace: [http://www.cs.um.edu.mt/~csaw/CSAW04/Proceedings/08.pdf Monadic Compositional Parsing with Context Using Maltese as a Case Study], see its [http://www.cs.um.edu.mt/~csaw/CSAW04/ context] too.
   
 
== Other functional or Haskell-related approaches to linguistics ==
 
== Other functional or Haskell-related approaches to linguistics ==
   
  +
* [http://cs.uwindsor.ca/~richard/PUBLICATIONS/NLI_LFP_SURVEY_DRAFT.pdf A Survey on the Use of Haskell in Natural-Language Processing] (Report by Richard A. Frost). It is also a part of Haskell Communities and Activities Report, [http://www.haskell.org/communities/11-2006/html/report.html Eleventh edition – November 30, 2006].
 
* From [http://www.cs.chalmers.se/~aarne/ Aarne Ranta's homepage]
 
* From [http://www.cs.chalmers.se/~aarne/ Aarne Ranta's homepage]
** [http://www.cs.chalmers.se/~aarne/GF/index.html Grammatical Framework]
 
*: GF is a compiler and grammatical programming environment written entirely in Haskell, with an interactive interpreter and two GUI interfaces, one written in Fudgets and another written in Java. GF grammars are written in a subset of Haskell and compile into an internal GF format that may be used as embedded parsers in Haskell, parsers in Java (with an embedded Java interpreter gfc2java.jar) and subsequently converted to applets ([http://www.cs.chalmers.se/~markus/gramlets/ Gramlets]). (GF-Haskell to Java translation is performed through an Open Agent Architecture--the original .NET, see [http://www.cs.chalmers.se/~bringert/gf/gf-oaa.html GF OAA].) The GF grammatical formalism handles linguistic entities (morphemes, etc.) using type theory: an approach especially suited to machine translation of controlled natural languages. The [http://www.cs.chalmers.se/~aarne/GF/lib/resource-1.0/doc/index.html Grammar Resource Library], a set of basic grammars for Danish, English, Finnish, French, German, Italian, Norwegian, Russian, Spanish and Swedish, is available as a separate download. GF has been used to translate a fragment of C code to JVM (see [http://www.cs.chalmers.se/~aarne/GF/doc/gfcc.pdf GFCC (PDF document)]).
 
 
** [http://www.cs.chalmers.se/~aarne/course-langtech/ Natural Language Technology], with (among others) [http://www.cs.chalmers.se/~aarne/course-langtech/lectures/lectures.html online course slides]. They give huge insights, for example, see the slide example which discusses [[Dependent type#Type theory|the concept of dependent type and Curry Howard isomorphism]] in lingustical context.
 
** [http://www.cs.chalmers.se/~aarne/course-langtech/ Natural Language Technology], with (among others) [http://www.cs.chalmers.se/~aarne/course-langtech/lectures/lectures.html online course slides]. They give huge insights, for example, see the slide example which discusses [[Dependent type#Type theory|the concept of dependent type and Curry Howard isomorphism]] in lingustical context.
* [http://www.cs.chalmers.se/~markus/FM/index.html Functional Morphology]
+
* The [http://sanskrit.inria.fr/ZEN/ Zen Computational Linguistics Toolkit] has tools for efficiently processing linguistic data structures, like trees and automata. It's written in Literate O'Caml, though a Haskell port shouldn't be very hard to do.
* The [http://sanskrit.inria.fr/ZEN/ Zen Computational Linguistics Toolkit] has tools for efficiently processing linguistic data structures, like trees and automata. It's written in Literal O'Caml, though a Haskell port shouldn't be very hard to do.
 
 
* The [http://nlpers.blogspot.com/ natural language processing blog] written by [http://www.isi.edu/~hdaume/ Hal Daume III].
 
* The [http://nlpers.blogspot.com/ natural language processing blog] written by [http://www.isi.edu/~hdaume/ Hal Daume III].
   
Line 70: Line 86:
 
Dr. [http://www.haskell.org/haskellwiki/Libraries_and_tools/Linguistics Günter Neumann]'s homepage.
 
Dr. [http://www.haskell.org/haskellwiki/Libraries_and_tools/Linguistics Günter Neumann]'s homepage.
   
[[Lojban]], an artificial language. ([http://en.wikipedia.org/wiki/Lojban see also Wikipedia on it].) “Lojban was not designed primarily to be an international language, however, but rather as a linguistic tool for studying and understanding language. Its linguistic and computer applications make Lojban unique among international languages...” (NC:WhLoj, page 15 par 1)
+
== Specific topics ==
  +
  +
=== Lojban ===
  +
  +
Lojban, an artificial language ([[Lojban|see a separate HaskellWiki page on it with references]].) “Lojban was not designed primarily to be an international language, however, but rather as a linguistic tool for studying and understanding language. Its linguistic and computer applications make Lojban unique among international languages...” (NC:WhLoj, page 15 par 1)
  +
  +
=== Continuations in natural languages ===
   
  +
Some phenomena in natural languages can be grasped with the notion of [[continuation]]. For details, see
  +
Chris Barker's paper [http://www.cs.bham.ac.uk/~hxt/cw04/barker.pdf Continuations in Natural Language]. It is quite accessible to non-linguists.
 
== References ==
 
== References ==
   
;NC&#58;WhLoj
+
;barker2004cnl
  +
:Barker, Chris: [http://www.cs.bham.ac.uk/~hxt/cw04/barker.pdf Continuations in Natural Language] (pdf), 2004
  +
;nicholas2003wl
 
:Nicholas, Nick and Cowan, John (ed.): What is Lojban? [http://www.lojban.org/ Logical Language Group], 2003. Available also [http://www.lojban.org/tiki/tiki-index.php?page=What+Is+Lojban%3F%2C+The+Book&bl online].
 
:Nicholas, Nick and Cowan, John (ed.): What is Lojban? [http://www.lojban.org/ Logical Language Group], 2003. Available also [http://www.lojban.org/tiki/tiki-index.php?page=What+Is+Lojban%3F%2C+The+Book&bl online].
  +
;frost2006rnl
  +
:Frost, Richard: [http://cs.uwindsor.ca/~richard/PUBLICATIONS/NLI_LFP_SURVEY_DRAFT.pdf Realization of natural language interfaces using lazy functional programming] (pdf), 2006
  +
;frost2008pal
  +
:Frost, Richard; Hafiz, Rahmatullah and Callaghan, Paul: [http://cs.uwindsor.ca/~hafiz/PADL_PAPER_FINAL.pdf Parser Combinators for Ambiguous Left-Recursive Grammars.] Proceedings of the 10th International Symposium on Practical Aspects of Declarative Languages (PADL), ACM-SIGPLAN. January 2008, San Francisco, USA.
  +
;xsaiga2008exg
  +
:Frost, Richard; Hafiz, Rahmatullah and Callaghan, Paul: [http://cs.uwindsor.ca/~hafiz/proHome.html X-SAIGA] website - eXecutable SpecificAtIons of GrAmmars.
   
 
[[Category:Theoretical foundations]]
 
[[Category:Theoretical foundations]]

Revision as of 15:04, 29 March 2011

Contents


1 Portals and other huge resources

Peter Ljunglöf's many publications on natural language processing, parsing, formal semantics. Many of them use Haskell, and there are downloadable Haskell sources too.

Jan van Eijck's page contains a huge amount of materials on logic and language:

  • computational linguistics
  • logics (e.g. dynamic epistemic modelling)

The Haskell NLP projects provides a mailing list for Haskellers doing NLP work, as well as a community wiki and darcs repository. Come join us!

Natural Language Processing for The Working Programmer is a book that provides an introduction to Haskell and NLP.

There are many Haskell resources, too.

2 Tools and libraries

  • Cypher is one of the first software program available which generates the metadata representation of natural language input. Cypher produces RDF graph and SeRQL query representations of sentences, clauses, phrases and questions. The Cypher framework provides a set of robust definition languages, which can be used to extend and create grammars and lexicons. Cypher programming is fun to learn and easy to use, and the specifications are designed to allow a novice to quickly and easily build transcoders for processing highly complex sentences and phrases of any natural language, and to cover any vocabulary
  • GenI is a surface realiser for Tree Adjoining Grammars. Surface realisation can be seen as the last stage in a natural language generation pipeline. GenI in particular takes an FB-LTAG grammar and an input semantics (a conjunction of first order terms), and produces the set of sentences associated to the input semantics by the grammar. See also Eric Kow's recent publications on it.
  • Grammatical Framework (GF) is a compiler and grammatical programming environment written entirely in Haskell, with an interactive interpreter and two GUI interfaces, one written in Fudgets and another written in Java. GF grammars are written in a subset of Haskell and compile into an internal GF format that may be used as embedded parsers in Haskell, parsers in Java (with an embedded Java interpreter gfc2java.jar) and subsequently converted to applets (Gramlets). (GF-Haskell to Java translation is performed through an Open Agent Architecture--the original .NET, see GF OAA.) The GF grammatical formalism handles linguistic entities (morphemes, etc.) using type theory: an approach especially suited to machine translation of controlled natural languages. The Grammar Resource Library, a set of basic grammars for Danish, English, Finnish, French, German, Italian, Norwegian, Russian, Spanish and Swedish, is available as a separate download. GF has been used to translate a fragment of C code to JVM (see GFCC (PDF document)).
  • Functional Morphology - a toolkit for morphology development. Has been used for Swedish, Spanish, Urdu and more.
  • HWordNet - A Haskell interface to WordNet by Hal Daumé III.
  • Saxophone is a fun translator from German to the Saxon dialect. It is part of the ParallelWeb project which aims at translating Web pages including all of their links.

3 Natural language processing and combinatory logic

Combinatory logic contributed to develop powerful theories in linguistics..

3.1 Applicative universal grammar

Now it has got its own HaskellWiki page.

3.2 Categorial grammar

A general summary of modern semantic theories developed in the century is provided by Logical Aspects of Computational Linguistics: an introduction.

Gary Hardegree's portal-rich page provides a lot of materials on logic and linguistics, among them

The Combinatory Categorial Grammar Site contains links, papers (both introductory and developed) and software (OpenNLP open source projects, related to natural language processing, and OpenCCG)

On natural languages relating to combinatory logic, see also

3.3 Type-Logical Grammar

Matteo Capelletti's home page contains a parser based on the Non-associative Lambek calculus. It supports hypothetical reasoning and Montague style semantics.

3.4 Tree Adjoining Grammar

  • See GenI, mentioned above.

4 Game theoretic semantics

Game theoretic semantics presents an interesting concept of truth -- in another way than that of Tarski. Its connections to computer science and computer languages is described in Wikipedia's Game semantics article. Merlijn Sevenster's Game theoretical semantics and -logic is a good introductory material too.

Chiaki Ohkura's The Semantics of Metaphor in the Game Theoretic Semantics with at Least Two Coordination Equilibria article tries to catch the concept of metaphor.

4.1 Relatedness to linear logic

The Wikipedia article mentions also the relatedness of game theoretic semantics to linear logic. Philip Wadler's page on linear logic describes the topic and its relatedness to many concepts concerning Haskell. A taste of linear logic can serve as an introductory article.

5 Parsing natural languages

5.1 Parsing Natural Language with X-SAIGA parser

The goal of the X-SAIGA project is to create algorithms and implementations which enable the construction of language processors (recognizers, parsers, interpreters, translators, etc.) to be constructed as modular and efficient embedded executable specifications of grammars. The syntax analysis is done with a set of parser combinators by overcoming some long standing limitations -

  1. the simple implementations of parser combinators require exponential time and space when parsing an ambiguous context free grammar.
  2. like any top-down recursive descent parsing, the conventional parser combinators won't terminate while processing a left-recursive grammar (i.e. s ::= s *> s *> term 'x'|empty).

As a part of the X-SAIGA project's syntax analysis, a recognition algorithm that accommodates ambiguous grammars with direct left-recursive rules is described by Frost and Hafiz in 2006. The algorithm curtails the otherwise ever-growing left-recursive parse by imposing depth restrictions. That algorithm was extended to a complete parsing algorithm to accommodate indirect as well as direct left-recursion in polynomial time, and to generate compact polynomial-size representations of the potentially-exponential number of parse trees for highly-ambiguous grammars by Frost, Hafiz and Callaghan in 2007. This extended algorithm accommodates indirect left-recursion by comparing its 'computed-context' with 'current-context'. The same authors also described their implementation of a set of parser combinators written in the Haskell programming language based on the same algorithm in PADL 08. The X-SAIGA site has more about the algorithms, implementation details experimental results.

5.2 Monadic Compositional Parsing

Gordon J. Pace: Monadic Compositional Parsing with Context Using Maltese as a Case Study, see its context too.

6 Other functional or Haskell-related approaches to linguistics

7 Other linguistics-related resources

Dr. Günter Neumann's homepage.

8 Specific topics

8.1 Lojban

Lojban, an artificial language (see a separate HaskellWiki page on it with references.) “Lojban was not designed primarily to be an international language, however, but rather as a linguistic tool for studying and understanding language. Its linguistic and computer applications make Lojban unique among international languages...” (NC:WhLoj, page 15 par 1)

8.2 Continuations in natural languages

Some phenomena in natural languages can be grasped with the notion of continuation. For details, see Chris Barker's paper Continuations in Natural Language. It is quite accessible to non-linguists.

9 References

barker2004cnl
Barker, Chris: Continuations in Natural Language (pdf), 2004
nicholas2003wl
Nicholas, Nick and Cowan, John (ed.): What is Lojban? Logical Language Group, 2003. Available also online.
frost2006rnl
Frost, Richard: Realization of natural language interfaces using lazy functional programming (pdf), 2006
frost2008pal
Frost, Richard; Hafiz, Rahmatullah and Callaghan, Paul: Parser Combinators for Ambiguous Left-Recursive Grammars. Proceedings of the 10th International Symposium on Practical Aspects of Declarative Languages (PADL), ACM-SIGPLAN. January 2008, San Francisco, USA.
xsaiga2008exg
Frost, Richard; Hafiz, Rahmatullah and Callaghan, Paul: X-SAIGA website - eXecutable SpecificAtIons of GrAmmars.