https://wiki.haskell.org/api.php?action=feedcontributions&user=R.hafiz&feedformat=atomHaskellWiki - User contributions [en]2019-09-15T10:34:49ZUser contributionsMediaWiki 1.27.4https://wiki.haskell.org/index.php?title=Applications_and_libraries/Linguistics&diff=21716Applications and libraries/Linguistics2008-07-10T00:48:14Z<p>R.hafiz: Parsing Natural Language with X-SAIGA parser</p>
<hr />
<div>__TOC__<br />
<br />
== Portals and other huge resorces ==<br />
<br />
Peter Ljunglöf's many [http://www.ling.gu.se/~peb/pubs.html publications] on natural language processing, parsing, formal semantics. Many of them uses Haskell, and there are [http://www.ling.gu.se/~peb/software.html downloadable] Haskell sources too.<br />
<br />
[http://homepages.cwi.nl/~jve/index.html Jan van Eijck's page] contains a huge amount of materials on logic and language:<br />
* computational linguistics<br />
* logics (e.g. dynamic epistemic modelling)<br />
There are many Haskell resources, too.<br />
<br />
== Tools and libraries ==<br />
<br />
* [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<br />
* [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.<br />
* [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)]).<br />
* [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.<br />
* [http://www.cs.utah.edu/~hal/HWordNet/index.html HWordNet] - A Haskell interface to WordNet by Hal Daumé III.<br />
* '''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.<br />
<br />
== Natural language processing and combinatory logic ==<br />
<br />
[[Combinatory logic]] contributed to develop powerful theories in linguistics..<br />
<br />
=== Applicative universal grammar ===<br />
<br />
Now it has got [[/Applicative universal grammar|its own HaskellWiki page]].<br />
<br />
=== Categorial grammar ===<br />
<br />
A general summary of modern semantic theories developed in the century<br />
is provided by [http://citeseer.ist.psu.edu/blackburn97logical.html Logical Aspects of Computational Linguistics: an introduction].<br />
<br />
[http://www-unix.oit.umass.edu/~gmhwww/ Gary Hardegree]'s portal-rich page provides a lot of materials on logic and linguistics, among them<br />
* [http://www-unix.oit.umass.edu/~gmhwww/scholar.htm The Axiomatic Theory of Truth] grasping concepts like truth, quotations, paradoxes, liar's paradox<br />
* [http://www-unix.oit.umass.edu/~gmhwww/scholar.htm Courses] ranging from the introductory level to developed topics, e.g. [http://www-unix.oit.umass.edu/~gmhwww/511/pdf/a3.pdf Basic Categorial Grammar].<br />
<br />
[http://groups.inf.ed.ac.uk/ccg/ The Combinatory Categorial Grammar Site] contains links, papers (both introductory and developed) and software ([http://opennlp.sourceforge.net/ OpenNLP] open source projects, related to natural language processing, and [http://openccg.sourceforge.net/ OpenCCG])<br />
<br />
On natural languages relating to combinatory logic, see also<br />
* Mark Steedman's [http://citeseer.ist.psu.edu/steedman97does.html Does Grammar Make Use of Bound Variables?]<br />
* Mark Hepple: [http://citeseer.ist.psu.edu/hepple90grammar.html The Grammar and Processing of Order and Dependency: a Categorial Approach]<br />
<br />
=== Type-Logical Grammar ===<br />
<br />
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. <br />
<br />
=== Tree Adjoining Grammar ===<br />
<br />
* See [http://trac.loria.fr/~geni GenI], mentioned above.<br />
<br />
== Game theoretic semantics ==<br />
<br />
Game theoretic semantics presents an interesting concept of ''truth'' -- in another way than that of Tarski.<br />
Its connections to computer science and computer languages is described in Wikipedia's [http://en.wikipedia.org/wiki/Game_semantics Game semantics] article. Merlijn Sevenster's [http://staff.science.uva.nl/~peter/teaching/merlijns20041129.pdf Game theoretical semantics and -logic] is a good introductory material too.<br />
<br />
Chiaki Ohkura's [http://acl.ldc.upenn.edu/W/W03/W03-1408.pdf The Semantics of Metaphor in the Game Theoretic Semantics with at Least Two Coordination Equilibria] article tries to catch the concept of ''metaphor''.<br />
<br />
=== Relatedness to linear logic ===<br />
<br />
The Wikipedia article mentions also the relatedness of game theoretic semantics to ''linear logic''.<br />
[http://homepages.inf.ed.ac.uk/wadler/ Philip Wadler]'s page on [http://homepages.inf.ed.ac.uk/wadler/topics/linear-logic.html linear logic] describes the topic and its relatedness to many concepts concerning Haskell. [http://homepages.inf.ed.ac.uk/wadler/topics/linear-logic.html#lineartaste A taste of linear logic] can serve as an introductory article.<br />
<br />
== Parsing natural languages ==<br />
===Parsing Natural Language with X-SAIGA parser===<br />
<br />
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 -<br />
# the simple implementations of parser combinators require [[exponential]] time and space when parsing an ambiguous context free grammar.<br />
# 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>).<br />
<br />
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.<br />
<br />
===Monadic Compositional Parsing===<br />
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.<br />
<br />
== Other functional or Haskell-related approaches to linguistics ==<br />
<br />
* [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].<br />
* From [http://www.cs.chalmers.se/~aarne/ Aarne Ranta's homepage]<br />
** [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.<br />
* 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.<br />
* The [http://nlpers.blogspot.com/ natural language processing blog] written by [http://www.isi.edu/~hdaume/ Hal Daume III].<br />
<br />
== Other linguistics-related resources ==<br />
<br />
Dr. [http://www.haskell.org/haskellwiki/Libraries_and_tools/Linguistics Günter Neumann]'s homepage.<br />
<br />
== Specific topics ==<br />
<br />
=== Lojban ===<br />
<br />
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)<br />
<br />
=== Continuations in natural languages ===<br />
<br />
Some phenomena in natural languages can be grasped with the notion of [[continuation]]. For details, see<br />
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.<br />
== References ==<br />
<br />
;barker2004cnl<br />
:Barker, Chris: [http://www.cs.bham.ac.uk/~hxt/cw04/barker.pdf Continuations in Natural Language] (pdf), 2004<br />
;nicholas2003wl<br />
: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].<br />
;frost2006rnl <br />
:Frost, Richard: [http://cs.uwindsor.ca/~richard/PUBLICATIONS/NLI_LFP_SURVEY_DRAFT.pdf Realization of natural language interfaces using lazy functional programming] (pdf), 2006<br />
;frost2008pal<br />
: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.<br />
;xsaiga2008exg<br />
:Frost, Richard; Hafiz, Rahmatullah and Callaghan, Paul: [http://cs.uwindsor.ca/~hafiz/proHome.html X-SAIGA] website - eXecutable SpecificAtIons of GrAmmars.<br />
<br />
[[Category:Theoretical foundations]]</div>R.hafiz