<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.aclweb.org/aclwiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Oe</id>
	<title>ACL Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.aclweb.org/aclwiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Oe"/>
	<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/Special:Contributions/Oe"/>
	<updated>2026-04-30T18:58:08Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.6</generator>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11514</id>
		<title>Graph Parsing (State of the Art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11514"/>
		<updated>2016-06-07T20:45:51Z</updated>

		<summary type="html">&lt;p&gt;Oe: /* SDP: Semantic Dependency Parsing */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Background and Motivation =&lt;br /&gt;
&lt;br /&gt;
Graphs exceeding the formal complexity of rooted trees are of&lt;br /&gt;
growing relevance to much NLP research.&lt;br /&gt;
We interpret the term &#039;&#039;graph parsing&#039;&#039; broadly as mapping from surface&lt;br /&gt;
strings to graph-structured target representations, which typically&lt;br /&gt;
provide some level of syntactico-semantic analysis.&lt;br /&gt;
Although formally well-understood in graph theory, there is&lt;br /&gt;
substantial variation in the types of linguistic graphs, as well as&lt;br /&gt;
in the interpretation of various structural properties.&lt;br /&gt;
To provide a common terminology and transparent statistics across&lt;br /&gt;
different collections of graphs in NLP, we propose to establish&lt;br /&gt;
a ‘catalogue’ of graph banks and associated parsing results.&lt;br /&gt;
&lt;br /&gt;
We anticipate a bit of a cottage industry in linguistic graph banks and&lt;br /&gt;
graph processing tasks over the next few years, which may make&lt;br /&gt;
it difficult to keep track of contentful similarities&lt;br /&gt;
and differences across frameworks and approaches.&lt;br /&gt;
This page is intended to stimulate community work towards an up-to-date&lt;br /&gt;
resource combining the following components: (a) formal definitions of&lt;br /&gt;
(relevant) structural graph properties; (b) in-depth descriptions of how&lt;br /&gt;
these apply to different graph banks; (c) constantly growing surveys of&lt;br /&gt;
graph bank statistics; and (d) a continuously evolving record of&lt;br /&gt;
state-of-the-art processing results.&lt;br /&gt;
Of these, components (a) and (b) are provided by&lt;br /&gt;
Kuhlmann and Oepen (2016)&amp;lt;ref name=&amp;quot;kuhlmann2016&amp;quot;&amp;gt;Marco Kuhlmann and Stephan Oepen. Towards a Catalogue of Linguistic Graph Banks. Computational Linguistics, 2016. In press. [http://www.mn.uio.no/ifi/english/people/aca/oe/cl.pdf Preprint]&amp;lt;/ref&amp;gt;,&lt;br /&gt;
while (c) and (d) are maintained below.&lt;br /&gt;
&lt;br /&gt;
This page was initiated by&lt;br /&gt;
[http://www.ida.liu.se/~marku61/ Marco Kuhlmann] and&lt;br /&gt;
[http://www.mn.uio.no/ifi/english/people/aca/oe/ Stephan Oepen], and for the&lt;br /&gt;
time being (mid-May 2016) is very much a work in progress.&lt;br /&gt;
We intend to have a first complete draft available for community review&lt;br /&gt;
by early June 2016.&lt;br /&gt;
&lt;br /&gt;
= Software: Graph Analysis Toolkit =&lt;br /&gt;
&lt;br /&gt;
An open-source reference implementation of the toolkit that was built to conduct the study of Kuhlmann and Oepen (2016)&amp;lt;ref name=&amp;quot;kuhlmann2016&amp;quot;/&amp;gt; will be available later this summer.&lt;br /&gt;
&lt;br /&gt;
= AMR: Abstract Meaning Representation =&lt;br /&gt;
&lt;br /&gt;
Abstract Meaning Representation (AMR) eschews explicit syntactic derivations and consideration of the syntax–semantics interface; it rather seeks to directly annotate “whole-sentence logical meanings” (Banarescu et al. 2013&amp;lt;ref name=&amp;quot;banarescu2013&amp;quot;&amp;gt;Banarescu, Laura, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Philipp Koehn, Martha Palmer, and Nathan Schneider. 2013. Abstract Meaning Representation for sembanking. In Proceedings of the 7th Linguistic Annotation Workshop and Interoperability with Discourse, pages 178–186, Sofia, Bulgaria, August.&amp;lt;/ref&amp;gt;). Node labels in AMR name abstract concepts, which in large parts draw on the ontology of OntoNotes predicate senses and corresponding semantic roles. Nodes are not overtly related to surface lexical units, and thus are unordered. Although AMR has its roots in semantic networks and earlier knowledge representation approaches (Langkilde and Knight 1998&amp;lt;ref name=&amp;quot;langkilde1998&amp;quot;&amp;gt;Langkilde, Irene and Kevin Knight. 1998. Generation that exploits corpus-based statistical&lt;br /&gt;
knowledge. In Proceedings of the 17th International Conference on Computational Linguistics and the 36th Meeting of the Association for Computational Linguistics, pages 704–710, Montréal, Canada.&amp;lt;/ref&amp;gt;), larger-scale manual AMR annotation is a recent development only. We sample two variants of AMR, viz. (a) the graphs as annotated in AMRBank 1.0 (LDC2014T12), and (b) a normalized version that we call AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;, where so-called “inverse roles” (like ARG0-of) are reversed. Such inverted edges are frequently used in AMR in order to render the graph as a single rooted structure, where the root is interpreted as the top-level focus. (The graph bank is natively constructed and released with inverted edges, but for parser evaluation the AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt; normalization is typically assumed; our conversion builds on the code of Cai and Knight (2013)&amp;lt;ref name=&amp;quot;cai2013&amp;quot;&amp;gt;Cai, Shu and Kevin Knight. 2013. Smatch. An evaluation metric for semantic feature structures. In Proceedings of the 51th Meeting of the Association for Computational Linguistics, pages 748–752, Sofia, Bulgaria, August.&amp;lt;/ref&amp;gt;.) In the context of this comparison, we map this interpretation to a general concept of “top nodes” for both AMR and AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;. Flanigan et al. (2014)&amp;lt;ref name=&amp;quot;flanigan2014&amp;quot;&amp;gt;Flanigan, Jeffrey, Sam Thomson, Jaime Carbonell, Chris Dyer, and Noah A. Smith. 2014. A discriminative graph-based parser for the Abstract Meaning Representation. In Proceedings of the 52nd Meeting of the Association for Computational Linguistics, pages 1426–1436, Baltimore, MD, USA, June.&amp;lt;/ref&amp;gt; published the first parser targeting AMR, and the state of the art has been repeatedly updated since.&lt;br /&gt;
&lt;br /&gt;
{|&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Property&lt;br /&gt;
! style=&amp;quot;text-align:center;&amp;quot;| AMR&lt;br /&gt;
! style=&amp;quot;text-align:center;&amp;quot;| AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|number of graphs&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|10309&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|10309&lt;br /&gt;
|-&lt;br /&gt;
|average number of tokens&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|20.62&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|20.62&lt;br /&gt;
|-&lt;br /&gt;
|average number of nodes per token&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.67&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.67&lt;br /&gt;
|-&lt;br /&gt;
|number of edge labels&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|135&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|100&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are trees&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|52.48&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|18.60&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs with treewidth one&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|52.72&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|52.72&lt;br /&gt;
|-&lt;br /&gt;
|average treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.524&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.524&lt;br /&gt;
|-&lt;br /&gt;
|maximal treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|4&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|4&lt;br /&gt;
|-&lt;br /&gt;
|average edge density&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.065&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.065&lt;br /&gt;
|-&lt;br /&gt;
|percentage of nodes that are reentrant&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|5.23&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|18.95&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are cyclic&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|3.15&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.71&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are not connected&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.00&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.00&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are multi-rooted&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.00&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|77.50&lt;br /&gt;
|-&lt;br /&gt;
|percentage of non-top roots&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|47.78&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|19.39&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
= CCD: Combinatory Categorial Grammar Dependencies =&lt;br /&gt;
&lt;br /&gt;
Hockenmaier and Steedman (2007)&amp;lt;ref name=&amp;quot;hockenmaier2007&amp;quot;&amp;gt;Hockenmaier, Julia and Mark Steedman. 2007. CCGbank. A corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Computational Linguistics, 33:355–396.&amp;lt;/ref&amp;gt; construct CCGbank from a combination of careful interpretation of the syntactic annotations in the PTB with additional, manually curated lexical and constructional knowledge. In CCGbank (LDC2005T13), the strings of the venerable PTB Wall Street Journal (WSJ) corpus are annotated with pairs of (a) CCG syntactic derivations and (b) sets of semantic bi-lexical dependency triples, which we term CCD. The latter “include most semantically relevant non-anaphoric local and long-range dependencies” and are suggested by the CCGbank creators as a proxy for predicate–argument structure. While CCD has mainly been used for contrastive parser evaluation (Clark and Curran [2007]&amp;lt;ref name=&amp;quot;clark2007&amp;quot;&amp;gt;Clark, Stephen and James R. Curran. 2007. Wide-coverage efficient statistical parsing with CCG and log-linear models. Computational Linguistics, 33(4):493–552.&amp;lt;/ref&amp;gt;, Fowler and Penn [2010]&amp;lt;ref name=&amp;quot;fowler2010&amp;quot;&amp;gt;Fowler, Timothy A. D. and Gerald Penn. 2010. Accurate context-free parsing with Combinatory Categorial Grammar. In Proceedings of the 48th Meeting of the Association for Computational Linguistics, pages 335–344, Uppsala, Sweden.&amp;lt;/ref&amp;gt;; inter alios), there is current work that views each set of triples as a directed graph and parses directly into these target representations (Du, Sun, and Wan 2015&amp;lt;ref name=&amp;quot;du2015&amp;quot;&amp;gt;Du, Yantao, Weiwei Sun, and Xiaojun Wan. 2015. A data-driven, factorization parser for CCG dependency structures. In Proceedings of the 53rd Meeting of the Association for Computational Linguistics and of the 7th International Joint Conference on Natural Language Processing, pages 1545–1555, Bejing, China.&amp;lt;/ref&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
{|&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Property&lt;br /&gt;
! style=&amp;quot;text-align:center;&amp;quot;| CCD&lt;br /&gt;
|-&lt;br /&gt;
|number of graphs&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|39604&lt;br /&gt;
|-&lt;br /&gt;
|average number of tokens&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|23.47&lt;br /&gt;
|-&lt;br /&gt;
|average number of nodes per token&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.88&lt;br /&gt;
|-&lt;br /&gt;
|number of edge labels&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|6&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are trees&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.45&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs with treewidth one&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|29.27&lt;br /&gt;
|-&lt;br /&gt;
|average treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.742&lt;br /&gt;
|-&lt;br /&gt;
|maximal treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|5&lt;br /&gt;
|-&lt;br /&gt;
|average edge density&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.070&lt;br /&gt;
|-&lt;br /&gt;
|percentage of nodes that are reentrant&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|28.09&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are cyclic&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.28&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are not connected&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|12.53&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are multi-rooted&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|99.67&lt;br /&gt;
|-&lt;br /&gt;
|percentage of non-top roots&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|47.78&lt;br /&gt;
|-&lt;br /&gt;
|average edge length&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|2.582&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are noncrossing&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|48.23&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs with pagenumber at most two&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|98.64&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
= EDS: Elementary Dependency Structures =&lt;br /&gt;
&lt;br /&gt;
= SDP: Semantic Dependency Parsing =&lt;br /&gt;
&lt;br /&gt;
= UCCA: Universal Conceptual Cognitive Annotation =&lt;br /&gt;
&lt;br /&gt;
= References =&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11504</id>
		<title>Graph Parsing (State of the Art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11504"/>
		<updated>2016-05-30T09:26:18Z</updated>

		<summary type="html">&lt;p&gt;Oe: /* SDP: Semantic Dependency Parsing */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Background and Motivation =&lt;br /&gt;
&lt;br /&gt;
Graphs exceeding the formal complexity of rooted trees are of&lt;br /&gt;
growing relevance to much NLP research.&lt;br /&gt;
We interpret the term &#039;&#039;graph parsing&#039;&#039; broadly as mapping from surface&lt;br /&gt;
strings to graph-structured target representations, which typically&lt;br /&gt;
provide some level of syntactico-semantic analysis.&lt;br /&gt;
Although formally well-understood in graph theory, there is&lt;br /&gt;
substantial variation in the types of linguistic graphs, as well as&lt;br /&gt;
in the interpretation of various structural properties.&lt;br /&gt;
To provide a common terminology and transparent statistics across&lt;br /&gt;
different collections of graphs in NLP, we propose to establish&lt;br /&gt;
a ‘catalogue’ of graph banks and associated parsing results.&lt;br /&gt;
&lt;br /&gt;
We anticipate a bit of a cottage industry in linguistic graph banks and&lt;br /&gt;
graph processing tasks over the next few years, which may make&lt;br /&gt;
it difficult to keep track of contentful similarities&lt;br /&gt;
and differences across frameworks and approaches.&lt;br /&gt;
This page is intended to stimulate community work towards an up-to-date&lt;br /&gt;
resource combining the following components: (a) formal definitions of&lt;br /&gt;
(relevant) structural graph properties; (b) in-depth descriptions of how&lt;br /&gt;
these apply to different graph banks; (c) constantly growing surveys of&lt;br /&gt;
graph bank statistics; and (d) a continuously evolving record of&lt;br /&gt;
state-of-the-art processing results.&lt;br /&gt;
Of these, components (a) and (b) are provided by&lt;br /&gt;
Kuhlmann and Oepen (2016)&amp;lt;ref name=&amp;quot;kuhlmann2016&amp;quot;&amp;gt;Marco Kuhlmann and Stephan Oepen. Towards a Catalogue of Linguistic Graph Banks. Computational Linguistics, 2016. In press. [http://www.mn.uio.no/ifi/english/people/aca/oe/cl.pdf Preprint]&amp;lt;/ref&amp;gt;,&lt;br /&gt;
while (c) and (d) are maintained below.&lt;br /&gt;
&lt;br /&gt;
This page was initiated by&lt;br /&gt;
[http://www.ida.liu.se/~marku61/ Marco Kuhlmann] and&lt;br /&gt;
[http://www.mn.uio.no/ifi/english/people/aca/oe/ Stephan Oepen], and for the&lt;br /&gt;
time being (mid-May 2016) is very much a work in progress.&lt;br /&gt;
We intend to have a first complete draft available for community review&lt;br /&gt;
by early June 2016.&lt;br /&gt;
&lt;br /&gt;
= Software: Graph Analysis Toolkit =&lt;br /&gt;
&lt;br /&gt;
An open-source reference implementation of the toolkit that was built to conduct the study of Kuhlmann and Oepen (2016)&amp;lt;ref name=&amp;quot;kuhlmann2016&amp;quot;/&amp;gt; will be available later this summer.&lt;br /&gt;
&lt;br /&gt;
= AMR: Abstract Meaning Representation =&lt;br /&gt;
&lt;br /&gt;
Abstract Meaning Representation (AMR) eschews explicit syntactic derivations and consideration of the syntax–semantics interface; it rather seeks to directly annotate “whole-sentence logical meanings” (Banarescu et al. 2013&amp;lt;ref name=&amp;quot;banarescu2013&amp;quot;&amp;gt;Banarescu, Laura, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Philipp Koehn, Martha Palmer, and Nathan Schneider. 2013. Abstract Meaning Representation for sembanking. In Proceedings of the 7th Linguistic Annotation Workshop and Interoperability with Discourse, page 178–186, Sofia, Bulgaria, August.&amp;lt;/ref&amp;gt;). Node labels in AMR name abstract concepts, which in large parts draw on the ontology of OntoNotes predicate senses and corresponding semantic roles. Nodes are not overtly related to surface lexical units, and thus are unordered. Although AMR has its roots in semantic networks and earlier knowledge representation approaches (Langkilde and Knight 1998&amp;lt;ref name=&amp;quot;langkilde1998&amp;quot;&amp;gt;Langkilde, Irene and Kevin Knight. 1998. Generation that exploits corpus-based statistical&lt;br /&gt;
knowledge. In Proceedings of the 17th International Conference on Computational Linguistics and the 36th Meeting of the Association for Computational Linguistics, page 704–710, Montréal, Canada.&amp;lt;/ref&amp;gt;), larger-scale manual AMR annotation is a recent development only. We sample two variants of AMR, viz. (a) the graphs as annotated in AMRBank 1.0 (LDC2014T12), and (b) a normalized version that we call AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;, where so-called “inverse roles” (like ARG0-of) are reversed. Such inverted edges are frequently used in AMR in order to render the graph as a single rooted structure, where the root is interpreted as the top-level focus. (The graph bank is natively constructed and released with inverted edges, but for parser evaluation the AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt; normalization is typically assumed; our conversion builds on the code of Cai and Knight (2013)&amp;lt;ref name=&amp;quot;cai2013&amp;quot;&amp;gt;Cai, Shu and Kevin Knight. 2013. Smatch. An evaluation metric for semantic feature structures. In Proceedings of the 51th Meeting of the Association for Computational Linguistics, page 748–752, Sofia, Bulgaria, August.&amp;lt;/ref&amp;gt;.) In the context of this comparison, we map this interpretation to a general concept of “top nodes” for both AMR and AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;. Flanigan et al. (2014)&amp;lt;ref name=&amp;quot;flanigan2014&amp;quot;&amp;gt;Flanigan, Jeffrey, Sam Thomson, Jaime Carbonell, Chris Dyer, and Noah A. Smith. 2014. A discriminative graph-based parser for the Abstract Meaning Representation. In Proceedings of the 52nd Meeting of the Association for Computational Linguistics, page 1426–1436, Baltimore, MD, USA, June.&amp;lt;/ref&amp;gt; published the first parser targeting AMR, and the state of the art has been repeatedly updated since.&lt;br /&gt;
&lt;br /&gt;
{|&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Property&lt;br /&gt;
! style=&amp;quot;text-align:center;&amp;quot;| AMR&lt;br /&gt;
! style=&amp;quot;text-align:center;&amp;quot;| AMR&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
|number of graphs&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|10309&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|10309&lt;br /&gt;
|-&lt;br /&gt;
|average number of tokens&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|20.62&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|20.62&lt;br /&gt;
|-&lt;br /&gt;
|average number of nodes per token&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.67&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.67&lt;br /&gt;
|-&lt;br /&gt;
|number of edge labels&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|135&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|100&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are trees&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|52.48&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|18.60&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs with treewidth one&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|52.72&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|52.72&lt;br /&gt;
|-&lt;br /&gt;
|average treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.524&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.524&lt;br /&gt;
|-&lt;br /&gt;
|maximal treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|4&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|4&lt;br /&gt;
|-&lt;br /&gt;
|average edge density&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.065&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.065&lt;br /&gt;
|-&lt;br /&gt;
|percentage of nodes that are reentrant&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|5.23&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|18.95&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are cyclic&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|3.15&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.71&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are not connected&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.00&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.00&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are multi-rooted&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.00&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|77.50&lt;br /&gt;
|-&lt;br /&gt;
|percentage of non-top roots&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|47.78&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|19.39&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
= CCD: Combinatory Categorial Grammar Dependencies =&lt;br /&gt;
&lt;br /&gt;
Hockenmaier and Steedman (2007)&amp;lt;ref name=&amp;quot;hockenmaier2007&amp;quot;&amp;gt;Hockenmaier, Julia and Mark Steedman. 2007. CCGbank. A corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Computational Linguistics, 33:355–396.&amp;lt;/ref&amp;gt; construct CCGbank from a combination of careful interpretation of the syntactic annotations in the PTB with additional, manually curated lexical and constructional knowledge. In CCGbank (LDC2005T13), the strings of the venerable PTB Wall Street Journal (WSJ) corpus are annotated with pairs of (a) CCG syntactic derivations and (b) sets of semantic bi-lexical dependency triples, which we term CCD. The latter “include most semantically relevant non-anaphoric local and long-range dependencies” and are suggested by the CCGbank creators as a proxy for predicate–argument structure. While CCD has mainly been used for contrastive parser evaluation (Clark and Curran [2007]&amp;lt;ref name=&amp;quot;clark2007&amp;quot;&amp;gt;Clark, Stephen and James R. Curran. 2007. Wide-coverage efficient statistical parsing with CCG and log-linear models. Computational Linguistics, 33(4):493–552.&amp;lt;/ref&amp;gt;, Fowler and Penn [2010]&amp;lt;ref name=&amp;quot;fowler2010&amp;quot;&amp;gt;Fowler, Timothy A. D. and Gerald Penn. 2010. Accurate context-free parsing with Combinatory Categorial Grammar. In Proceedings of the 48th Meeting of the Association for Computational Linguistics, page 335–344, Uppsala, Sweden.&amp;lt;/ref&amp;gt;; inter alios), there is current work that views each set of triples as a directed graph and parses directly into these target representations (Du, Sun, and Wan 2015&amp;lt;ref name=&amp;quot;du2015&amp;quot;&amp;gt;Du, Yantao, Weiwei Sun, and Xiaojun Wan. 2015. A data-driven, factorization parser for CCG dependency structures. In Proceedings of the 53rd Meeting of the Association for Computational Linguistics and of the 7th International Joint Conference on Natural Language Processing, page 1545–1555, Bejing, China.&amp;lt;/ref&amp;gt;).&lt;br /&gt;
&lt;br /&gt;
{|&lt;br /&gt;
! style=&amp;quot;text-align:left;&amp;quot;| Property&lt;br /&gt;
! style=&amp;quot;text-align:center;&amp;quot;| CCD&lt;br /&gt;
|-&lt;br /&gt;
|number of graphs&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|39604&lt;br /&gt;
|-&lt;br /&gt;
|average number of tokens&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|23.47&lt;br /&gt;
|-&lt;br /&gt;
|average number of nodes per token&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|0.88&lt;br /&gt;
|-&lt;br /&gt;
|number of edge labels&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|6&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are trees&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.45&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs with treewidth one&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|29.27&lt;br /&gt;
|-&lt;br /&gt;
|average treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.742&lt;br /&gt;
|-&lt;br /&gt;
|maximal treewidth&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|5&lt;br /&gt;
|-&lt;br /&gt;
|average edge density&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.070&lt;br /&gt;
|-&lt;br /&gt;
|percentage of nodes that are reentrant&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|28.09&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are cyclic&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|1.28&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are not connected&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|12.53&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are multi-rooted&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|99.67&lt;br /&gt;
|-&lt;br /&gt;
|percentage of non-top roots&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|47.78&lt;br /&gt;
|-&lt;br /&gt;
|average edge length&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|2.582&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs that are noncrossing&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|48.23&lt;br /&gt;
|-&lt;br /&gt;
|percentage of graphs with pagenumber at most two&lt;br /&gt;
|style=&amp;quot;text-align:right;&amp;quot;|98.64&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
= EDS: Elementary Dependency Structures =&lt;br /&gt;
&lt;br /&gt;
= SDP: Semantic Dependency Parsing =&lt;br /&gt;
&lt;br /&gt;
= References =&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11494</id>
		<title>Graph Parsing (State of the Art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11494"/>
		<updated>2016-05-23T22:35:42Z</updated>

		<summary type="html">&lt;p&gt;Oe: /* Background and Motivation */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Background and Motivation =&lt;br /&gt;
&lt;br /&gt;
Graphs exceeding the formal complexity of rooted trees are of&lt;br /&gt;
growing relevance to much NLP research.&lt;br /&gt;
We interpret the term &#039;&#039;graph parsing&#039;&#039; broadly as mapping from surface&lt;br /&gt;
strings to graph-structured target representations, which typically&lt;br /&gt;
provide some level of syntactico-semantic analysis.&lt;br /&gt;
Although formally well-understood in graph theory, there is&lt;br /&gt;
substantial variation in the types of linguistic graphs, as well as&lt;br /&gt;
in the interpretation of various structural properties.&lt;br /&gt;
To provide a common terminology and transparent statistics across&lt;br /&gt;
different collections of graphs in NLP, we propose to establish&lt;br /&gt;
a ‘catalogue’ of graph banks and associated parsing results.&lt;br /&gt;
&lt;br /&gt;
We anticipate a bit of a cottage industry in linguistic graph banks and&lt;br /&gt;
graph processing tasks over the next few years, which may make&lt;br /&gt;
it difficult to keep track of contentful similarities&lt;br /&gt;
and differences across frameworks and approaches.&lt;br /&gt;
This page is intended to stimulate community work towards an up-to-date&lt;br /&gt;
resource combining the following components: (a) formal definitions of&lt;br /&gt;
(relevant) structural graph properties; (b) in-depth descriptions of how&lt;br /&gt;
these apply to different graph banks; (c) constantly growing surveys of&lt;br /&gt;
graph bank statistics; and (d) a continuously evolving record of&lt;br /&gt;
state-of-the-art processing results.&lt;br /&gt;
Of these, components (a) and (b) are provided by&lt;br /&gt;
[http://www.mn.uio.no/ifi/english/people/aca/oe/cl.pdf Kuhlmann &amp;amp; Oepen (2016; in press)],&lt;br /&gt;
while (c) and (d) are maintained below.&lt;br /&gt;
&lt;br /&gt;
This page was initiated by&lt;br /&gt;
[http://www.ida.liu.se/~marku61/ Marco Kuhlmann] and&lt;br /&gt;
[http://www.mn.uio.no/ifi/english/people/aca/oe/ Stephan Oepen], and for the&lt;br /&gt;
time being (mid-May 2016) is very much a work in progress.&lt;br /&gt;
We intend to have a first complete draft available for community review&lt;br /&gt;
by early June 2016.&lt;br /&gt;
&lt;br /&gt;
= Software: Graph Analysis Toolkit =&lt;br /&gt;
&lt;br /&gt;
= AMR: Abstract Meaning Representation =&lt;br /&gt;
&lt;br /&gt;
= CCD: Combinatory Categorial Grammar Dependencies =&lt;br /&gt;
&lt;br /&gt;
= EDS: Elementary Dependency Structures =&lt;br /&gt;
&lt;br /&gt;
= SDP: Semantic Dependency Parsing =&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11487</id>
		<title>Graph Parsing (State of the Art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11487"/>
		<updated>2016-05-09T18:57:33Z</updated>

		<summary type="html">&lt;p&gt;Oe: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Background and Motivation =&lt;br /&gt;
&lt;br /&gt;
Graphs exceeding the formal complexity of rooted trees are of&lt;br /&gt;
growing relevance to much NLP research.&lt;br /&gt;
We interpret the term &#039;&#039;graph parsing&#039;&#039; broadly as mapping from surface&lt;br /&gt;
strings to graph-structured target representations, which typically&lt;br /&gt;
provide some level of syntactico-semantic analysis.&lt;br /&gt;
Although formally well-understood in graph theory, there is&lt;br /&gt;
substantial variation in the types of linguistic graphs, as well as&lt;br /&gt;
in the interpretation of various structural properties.&lt;br /&gt;
To provide a common terminology and transparent statistics across&lt;br /&gt;
different collections of graphs in NLP, we propose to establish&lt;br /&gt;
a ‘catalogue’ of graph banks and associated parsing results.&lt;br /&gt;
&lt;br /&gt;
We anticipate a bit of a cottage industry in linguistic graph banks and&lt;br /&gt;
graph processing tasks over the next few years, which may make&lt;br /&gt;
it difficult to keep track of contentful similarities&lt;br /&gt;
and differences across frameworks and approaches.&lt;br /&gt;
This page is intended to stimulate community work towards an up-to-date&lt;br /&gt;
resource combining the following components: (a) formal definitions of&lt;br /&gt;
(relevant) structural graph properties; (b) in-depth descriptions of how&lt;br /&gt;
these apply to different graph banks; (c) constantly growing surveys of&lt;br /&gt;
graph bank statistics; and (d) a continuously evolving record of&lt;br /&gt;
state-of-the-art processing results.&lt;br /&gt;
&lt;br /&gt;
This page was initiated by&lt;br /&gt;
[http://www.ida.liu.se/~marku61/ Marco Kuhlmann] and&lt;br /&gt;
[http://www.mn.uio.no/ifi/english/people/aca/oe/ Stephan Oepen], and for the&lt;br /&gt;
time being (mid-May 2016) is very much a work in progress.&lt;br /&gt;
We intend to have a first complete draft available for community review&lt;br /&gt;
by early June 2016.&lt;br /&gt;
&lt;br /&gt;
= Software: Graph Analysis Toolkit =&lt;br /&gt;
&lt;br /&gt;
= AMR: Abstract Meaning Representation =&lt;br /&gt;
&lt;br /&gt;
= CCD: Combinatory Categorial Grammar Dependencies =&lt;br /&gt;
&lt;br /&gt;
= EDS: Elementary Dependency Structures =&lt;br /&gt;
&lt;br /&gt;
= SDP: Semantic Dependency Parsing =&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11486</id>
		<title>Graph Parsing (State of the Art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11486"/>
		<updated>2016-05-09T15:37:15Z</updated>

		<summary type="html">&lt;p&gt;Oe: /* Background and Motivation */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Background and Motivation =&lt;br /&gt;
&lt;br /&gt;
Graphs exceeding the formal complexity of rooted trees are of&lt;br /&gt;
growing relevance to much NLP research.&lt;br /&gt;
We interpret the term &#039;&#039;graph parsing&#039;&#039; broadly as mapping from surface&lt;br /&gt;
strings to graph-structured target representations, which typically&lt;br /&gt;
provide some level of syntactico-semantic analysis.&lt;br /&gt;
Although formally well-understood in graph theory, there is&lt;br /&gt;
substantial variation in the types of linguistic graphs, as well as&lt;br /&gt;
in the interpretation of various structural properties.&lt;br /&gt;
To provide a common terminology and transparent statistics across&lt;br /&gt;
different collections of graphs in NLP, we propose to establish&lt;br /&gt;
a ‘catalogue’ of graph banks and associated parsing results.&lt;br /&gt;
&lt;br /&gt;
We anticipate a bit of a cottage industry in linguistic graph banks and&lt;br /&gt;
graph processing tasks over the next few years, which may make&lt;br /&gt;
it difficult to keep track of contentful similarities&lt;br /&gt;
and differences across frameworks and approaches.&lt;br /&gt;
This page is intended to stimulate community work towards an up-to-date&lt;br /&gt;
resource combining the following components: (a) formal definitions of&lt;br /&gt;
(relevant) structural graph properties; (b) in-depth descriptions of how&lt;br /&gt;
these apply to different graph banks; (c) constantly growing surveys of&lt;br /&gt;
graph bank statistics; and (d) a continuously evolving record of&lt;br /&gt;
state-of-the-art processing results.&lt;br /&gt;
&lt;br /&gt;
This page was initiated by&lt;br /&gt;
[http://www.ida.liu.se/~marku61/ Marco Kuhlmann] and&lt;br /&gt;
[http://www.mn.uio.no/ifi/english/people/aca/oe/ Stephan Oepen], and for the&lt;br /&gt;
time being (mid-May 2016) is very much a work in progress.&lt;br /&gt;
We intend to have a first complete draft available for community review&lt;br /&gt;
by early June 2016.&lt;br /&gt;
&lt;br /&gt;
= Software: Graph Analysis Toolkit =&lt;br /&gt;
&lt;br /&gt;
= AMR: Abstract Meaning Representation =&lt;br /&gt;
&lt;br /&gt;
= EDS: Elementary Dependency Structures =&lt;br /&gt;
&lt;br /&gt;
= SDP: Semantic Dependency Parsing =&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_art)&amp;diff=11485</id>
		<title>Graph Parsing (State of the art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_art)&amp;diff=11485"/>
		<updated>2016-05-09T11:40:42Z</updated>

		<summary type="html">&lt;p&gt;Oe: Oe moved page Graph Parsing (State of the art) to Graph Parsing (State of the Art): consistency&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#REDIRECT [[Graph Parsing (State of the Art)]]&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11484</id>
		<title>Graph Parsing (State of the Art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11484"/>
		<updated>2016-05-09T11:40:42Z</updated>

		<summary type="html">&lt;p&gt;Oe: Oe moved page Graph Parsing (State of the art) to Graph Parsing (State of the Art): consistency&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Background and Motivation =&lt;br /&gt;
&lt;br /&gt;
Graphs exceeding the formal complexity of rooted trees are of&lt;br /&gt;
growing relevance to much NLP research.&lt;br /&gt;
We interpret the term &#039;&#039;graph parsing&#039;&#039; broadly as mapping from surface&lt;br /&gt;
strings to graph-structured target representations, which typically&lt;br /&gt;
provide some level of syntactico-semantic analysis.&lt;br /&gt;
Although formally well-understood in graph theory, there is&lt;br /&gt;
substantial variation in the types of linguistic graphs, as well as&lt;br /&gt;
in the interpretation of various structural properties.&lt;br /&gt;
To provide a common terminology and transparent statistics across&lt;br /&gt;
different collections of graphs in NLP, we propose to establish&lt;br /&gt;
a ‘catalogue’ of graph banks and associated parsing results.&lt;br /&gt;
&lt;br /&gt;
We anticipate a bit of a cottage industry in linguistic graph banks and&lt;br /&gt;
graph processing tasks over the next few years, which may make&lt;br /&gt;
it difficult to keep track of contentful similarities&lt;br /&gt;
and differences across frameworks and approaches.&lt;br /&gt;
This page is intended to stimulate community work towards an up-to-date&lt;br /&gt;
resource combining the following components: (a) formal definitions of&lt;br /&gt;
(relevant) structural graph properties; (b) in-depth descriptions of how&lt;br /&gt;
these apply to different graph banks; (c) constantly growing surveys of&lt;br /&gt;
graph bank statistics; and (d) a continuously evolving record of&lt;br /&gt;
state-of-the-art processing results.&lt;br /&gt;
&lt;br /&gt;
This page was initiated by Marco Kuhlmann and Stephan Oepen, and for the&lt;br /&gt;
time being (mid-May 2016) is very much a work in progress.&lt;br /&gt;
We intend to have a first complete draft available for community review&lt;br /&gt;
by early June 2016.&lt;br /&gt;
&lt;br /&gt;
= Software: Graph Analysis Toolkit =&lt;br /&gt;
&lt;br /&gt;
= AMR: Abstract Meaning Representation =&lt;br /&gt;
&lt;br /&gt;
= EDS: Elementary Dependency Structures =&lt;br /&gt;
&lt;br /&gt;
= SDP: Semantic Dependency Parsing =&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11483</id>
		<title>Graph Parsing (State of the Art)</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Graph_Parsing_(State_of_the_Art)&amp;diff=11483"/>
		<updated>2016-05-09T11:38:38Z</updated>

		<summary type="html">&lt;p&gt;Oe: initial page creation (so there is a URL)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Background and Motivation =&lt;br /&gt;
&lt;br /&gt;
Graphs exceeding the formal complexity of rooted trees are of&lt;br /&gt;
growing relevance to much NLP research.&lt;br /&gt;
We interpret the term &#039;&#039;graph parsing&#039;&#039; broadly as mapping from surface&lt;br /&gt;
strings to graph-structured target representations, which typically&lt;br /&gt;
provide some level of syntactico-semantic analysis.&lt;br /&gt;
Although formally well-understood in graph theory, there is&lt;br /&gt;
substantial variation in the types of linguistic graphs, as well as&lt;br /&gt;
in the interpretation of various structural properties.&lt;br /&gt;
To provide a common terminology and transparent statistics across&lt;br /&gt;
different collections of graphs in NLP, we propose to establish&lt;br /&gt;
a ‘catalogue’ of graph banks and associated parsing results.&lt;br /&gt;
&lt;br /&gt;
We anticipate a bit of a cottage industry in linguistic graph banks and&lt;br /&gt;
graph processing tasks over the next few years, which may make&lt;br /&gt;
it difficult to keep track of contentful similarities&lt;br /&gt;
and differences across frameworks and approaches.&lt;br /&gt;
This page is intended to stimulate community work towards an up-to-date&lt;br /&gt;
resource combining the following components: (a) formal definitions of&lt;br /&gt;
(relevant) structural graph properties; (b) in-depth descriptions of how&lt;br /&gt;
these apply to different graph banks; (c) constantly growing surveys of&lt;br /&gt;
graph bank statistics; and (d) a continuously evolving record of&lt;br /&gt;
state-of-the-art processing results.&lt;br /&gt;
&lt;br /&gt;
This page was initiated by Marco Kuhlmann and Stephan Oepen, and for the&lt;br /&gt;
time being (mid-May 2016) is very much a work in progress.&lt;br /&gt;
We intend to have a first complete draft available for community review&lt;br /&gt;
by early June 2016.&lt;br /&gt;
&lt;br /&gt;
= Software: Graph Analysis Toolkit =&lt;br /&gt;
&lt;br /&gt;
= AMR: Abstract Meaning Representation =&lt;br /&gt;
&lt;br /&gt;
= EDS: Elementary Dependency Structures =&lt;br /&gt;
&lt;br /&gt;
= SDP: Semantic Dependency Parsing =&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Academic_departments&amp;diff=9294</id>
		<title>Academic departments</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Academic_departments&amp;diff=9294"/>
		<updated>2012-04-03T10:20:42Z</updated>

		<summary type="html">&lt;p&gt;Oe: /* Norway */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Africa==&lt;br /&gt;
&lt;br /&gt;
===South Africa===&lt;br /&gt;
*[http://www.ctext.co.za North-West University, Potchefstroom Campus: Centre for Text Technology (CTexT)]&lt;br /&gt;
*[http://www.nu.ac.za/department/default.asp?dept=linguistund University of Natal - Dept. of Linguistics]&lt;br /&gt;
&lt;br /&gt;
==Asia==&lt;br /&gt;
*[http://www.ims.uni-stuttgart.de/info/SitesAsia.html Computational Linguistics in Asia] &lt;br /&gt;
*[http://www.first-institute.com/ The First Institute Of Dynamic Learning] &lt;br /&gt;
&lt;br /&gt;
===Bangladesh===&lt;br /&gt;
*[http://www.bracuniversity.ac.bd/research/crblp BRAC University, Dhaka - Center for Research on Bangla Language Processing]&lt;br /&gt;
&lt;br /&gt;
===China===&lt;br /&gt;
*[http://nlp.suda.edu.cn/ Soochow University - Natural Language Processing Lab]&lt;br /&gt;
*[http://www.cs.hit.edu.cn/ Harbin Institute of Technology - CS School]&lt;br /&gt;
*[http://www.icl.pku.edu.cn/ Peking University - Institute of Computational Linguistics]&lt;br /&gt;
*[http://nlp.csai.tsinghua.edu.cn/ Tsinghua University - Group of Natural Language Processing]&lt;br /&gt;
&lt;br /&gt;
===Hong Kong===&lt;br /&gt;
*[http://corpora.ctl.cityu.edu.hk/ City University of Hong Kong - The Dialogue Systems Group]&lt;br /&gt;
*[http://www.comp.polyu.edu.hk/ Hong Kong Polytechnic University - Department of Computing]&lt;br /&gt;
*[http://www.cs.ust.hk/ Hong Kong University of Science and Technology - CS Department]&lt;br /&gt;
&lt;br /&gt;
===India===&lt;br /&gt;
*[http://www.iiit.net/ltrc/pgprogrammes.html IIIT, Hyderabad - Academic Programmes]&lt;br /&gt;
*[http://www.ciil.org/ Central Institute of Indian Languages]&lt;br /&gt;
*[http://www.cdacindia.com/ Centre for Development of Advanced Computing]&lt;br /&gt;
*[http://www.hpl.hp.com/india/ HP Research Labs, India]&lt;br /&gt;
*[http://www.iisc.ernet.in/ IISc, Bangalore]&lt;br /&gt;
*[http://www.isical.ac.in/ Indian Statistical Institute]&lt;br /&gt;
*[http://www.iiit.net International Institute of Information Technology, Hyderabad]&lt;br /&gt;
*[http://www.au-kbc.org/research_areas/nlp.html Language Technology Research at AU-KBC, Chennai]&lt;br /&gt;
*[http://www.cse.iitk.ac.in/users/langtech/hist.htm IIT, Kanpur - Language Technology Research]&lt;br /&gt;
*[http://tdil.mit.gov.in/introindx.html TDIL]&lt;br /&gt;
*[http://www.uohyd.ernet.in/ University of Hyderabad]&lt;br /&gt;
&lt;br /&gt;
===Israel===&lt;br /&gt;
*[http://cl.haifa.ac.il/ University of Haifa - Computational Linguistics Group] &lt;br /&gt;
*[http://www.cs.technion.ac.il/~lcl Laboratory for Computational Linguistics, Technion, Israel] &lt;br /&gt;
*[http://www.cs.huji.ac.il/~arir/ Hebrew University - NLP at the CS Institute]&lt;br /&gt;
*[http://www.cs.biu.ac.il/~nlp NLP lab at Bar-Ilan University]&lt;br /&gt;
&lt;br /&gt;
===Japan===&lt;br /&gt;
*[http://cl.naist.jp/en/ Nara Institute of Science and Technology - Computational Linguistics Laboratory]&lt;br /&gt;
*[http://www-tsujii.is.s.u-tokyo.ac.jp/ The University of Tokyo - Tsujii group]&lt;br /&gt;
*[http://www.r.dl.itc.u-tokyo.ac.jp/index-e.html The University of Tokyo - Language Informatics Laboratory]&lt;br /&gt;
*[http://www.lr.pi.titech.ac.jp/en/index.html Tokyo Institute of Technology - Okumura group]&lt;br /&gt;
&lt;br /&gt;
===Korea===&lt;br /&gt;
*[http://nlp.korea.ac.kr/ Korea University - NLP lab] &lt;br /&gt;
*[http://kle.postech.ac.kr/ The Knowledge and Language Engineering Laboratory]&lt;br /&gt;
&lt;br /&gt;
===Singapore===&lt;br /&gt;
*[http://www.comp.nus.edu.sg/~nght/cllab.html National University of Singapore - Computational Linguistics Lab]&lt;br /&gt;
*[http://wing.comp.nus.edu.sg/ National University of Singapore - Web, IR / NLP Group (WING)]&lt;br /&gt;
*[http://www.ntu.edu.sg/HSS/Linguistics/ Nanyang Technological University - Division of Linguistics and Multilingual Studies]&lt;br /&gt;
&lt;br /&gt;
===Sri Lanka===&lt;br /&gt;
*[http://www.ucsc.cmb.ac.lk/ltrl University of Colombo School of Computing - Language Technology Research Lab]&lt;br /&gt;
&lt;br /&gt;
===Taiwan===&lt;br /&gt;
*[http://nlg3.csie.ntu.edu.tw/ NTU - CSIE - Natural Language Processing Lab]&lt;br /&gt;
*[http://clclp.ling.sinica.edu.tw/ Computational Linguistics and Chinese Language Processing]&lt;br /&gt;
&lt;br /&gt;
===Thailand===&lt;br /&gt;
*[http://crcl.th.net/ Center for Research in Computational Linguistics]  &lt;br /&gt;
*[http://www.crslp.chula.ac.th/ Chulalongkorn University - Center for Research in Speech and Language Processing]&lt;br /&gt;
*[http://naist.cpe.ku.ac.th/ Kasetsart University - NAiST-Lab]&lt;br /&gt;
*[http://dict.longdo.com/ Longdo Thai-Multilingual Dictionary]&lt;br /&gt;
*[http://kind.siit.tu.ac.th/ Sirindhorn International Institute of Technology, Thammasat University - Knowledge Information &amp;amp; Data Management Lab]&lt;br /&gt;
*[http://thaispeech.longdo.org/ Thai Speech Community]  &lt;br /&gt;
*[http://www.tcllab.org/ Thai Computational Linguistics Laboratory]&lt;br /&gt;
&lt;br /&gt;
===Uzbekistan===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Uzbekistan Language Engineering in Uzbekistan (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
==North America==&lt;br /&gt;
&lt;br /&gt;
===Canada===&lt;br /&gt;
*[http://www.cs.concordia.ca/CLAC/ Concordia University - Computational Linguistics]&lt;br /&gt;
*[http://www.cs.dal.ca/~nlp/ Dalhousie University - Natural Language Processing Group]  &lt;br /&gt;
*[http://fas.sfu.ca/0/cs/research/groups/NLL/toc.html Simon Fraser University - Natural Language Laboratory]  &lt;br /&gt;
*[http://www.umanitoba.ca/linguistics/local.html University of Manitoba - Dept. of Linguistics]  &lt;br /&gt;
*[http://mapageweb.umontreal.ca/dasylval Université de Montr&amp;amp;eacute;al - Lyne Da Sylva] &lt;br /&gt;
*[http://rali.iro.umontreal.ca/ Université de Montréal - Laboratoire de Recherche Appliqu&amp;amp;eacute;e en Linguistique Informatique (RALI)]  &lt;br /&gt;
*[http://www.csi.uottawa.ca/dept/kaml/KAML.html University of Ottawa - Knowledge Acquisition and Machine Learning (KAML) Group] &lt;br /&gt;
*[http://www.cs.toronto.edu/compling/ University of Toronto - Computational Linguistics Group]&lt;br /&gt;
&lt;br /&gt;
===Mexico===&lt;br /&gt;
&lt;br /&gt;
*[http://www.iling.unam.mx Universidad Nacional Autonoma de Mexico - Grupo de Ingenieria Linguistica]&lt;br /&gt;
*[http://nlp.cic.ipn.mx National Polytechnic Institute - Center for Computing Research - Natural Language and Text Processing Laboratory]&lt;br /&gt;
&lt;br /&gt;
===USA===&lt;br /&gt;
*[http://www.ims.uni-stuttgart.de/info/SitesNorthAmerica.html Computational Linguistics in North America]&lt;br /&gt;
====California====&lt;br /&gt;
*[http://www-rohan.sdsu.edu/dept/linguist/index.html San Diego State University - Dept. of Linguistics]&lt;br /&gt;
*[http://www-cs.stanford.edu/ Stanford University - Computer Science Department]&lt;br /&gt;
*[http://www-csli.stanford.edu/ Stanford University - CSLI]&lt;br /&gt;
*[http://www-linguistics.stanford.edu/ Stanford University - Linguistics Department]&lt;br /&gt;
*[http://symsys.stanford.edu/ Stanford University - Symbolic Systems]&lt;br /&gt;
*[http://crl.ucsd.edu/ University of California, San Diego - Center for Research in Language]&lt;br /&gt;
*[http://liso.ucsb.edu/ University of California, Santa Barbara - Language, Interaction, and Social Organization Group]&lt;br /&gt;
*[http://ling.ucsc.edu/ University of California, Santa Cruz - Linguistics Dept.]&lt;br /&gt;
*[http://www.humnet.ucla.edu/humnet/linguistics/general/linguist.htm University of California, Los Angeles - Dept. of Linguistics]&lt;br /&gt;
*[http://www.isi.edu/natural-language/nlp-at-isi.html USC - NLP group]&lt;br /&gt;
*[http://www.isi.edu/ USC - Information Sciences Institute (ISI)] &lt;br /&gt;
*[http://www.ict.usc.edu/ USC - Institute for Creative Technologies]&lt;br /&gt;
&lt;br /&gt;
====Connecticut====&lt;br /&gt;
*[http://www.cis.yale.edu/linguist/ Yale University - Department of Linguistics]&lt;br /&gt;
*[http://www.haskins.yale.edu/ Yale University - Haskins Laboratories] &lt;br /&gt;
&lt;br /&gt;
====Delaware====&lt;br /&gt;
*[http://www.ling.udel.edu/ling/ University of Delaware - Department of Linguistics] &lt;br /&gt;
*[http://www.asel.udel.edu/natlang/nli.html University of Delaware - Natural Languages Interface Group] &lt;br /&gt;
*[http://www.asel.udel.edu/natlang/nlp/nlp.html University of Delaware - Natural Language Processing Lab] &lt;br /&gt;
*[http://www.cis.udel.edu/~decker/ai_nlp.html University of Delaware - Natural Language Processing]&lt;br /&gt;
&lt;br /&gt;
====Illinois====&lt;br /&gt;
*[http://l2r.cs.uiuc.edu/~cogcomp/ University of Illinois, Urbana Champaign - Cognitive Computation Group at CS dept] &lt;br /&gt;
*[http://www.siu.edu/departments/cola/ling01 Southern Illinois University at Carbondale - Department of Linguistics] &lt;br /&gt;
*[http://www.cas.northwestern.edu/linguistics/ Nothwestern University - Department of Linguistics, Weinberg College of Arts and Sciences] &lt;br /&gt;
*[http://ap-www.uchicago.edu/AcaPubs/GradAnno/HumDiv/Lingf.html University of Chicago - Dept. of Linguistics]&lt;br /&gt;
&lt;br /&gt;
====Indiana====&lt;br /&gt;
*[http://www.indiana.edu/~lingdept Indiana University - Department of Linguistics]&lt;br /&gt;
&lt;br /&gt;
====Iowa====&lt;br /&gt;
*[http://www.uiowa.edu/~linguist/ University of Iowa - Department of Linguistics] &lt;br /&gt;
&lt;br /&gt;
====Maryland====&lt;br /&gt;
*[http://www.umiacs.umd.edu/labs/CLIP University of Maryland - Computational Linguistics and Information Processing Lab] &lt;br /&gt;
*[http://www.clsp.jhu.edu Johns Hopkins University - Center for Language and Speech Processing]&lt;br /&gt;
*[http://www.cog.jhu.edu/index.html Johns Hopkins University - Dept. of Cognitive Science] &lt;br /&gt;
*[http://nlp.cs.jhu.edu/nlp Johns Hopkins University - Natural Language Processing group]&lt;br /&gt;
*[http://www.usna.edu/LangStudy/ US Naval Academy - Language Studies Department]&lt;br /&gt;
&lt;br /&gt;
====Massachusetts====&lt;br /&gt;
*[http://das-www.harvard.edu/aiken.html Harvard University - Computer Science Department]&lt;br /&gt;
&lt;br /&gt;
====Michigan====&lt;br /&gt;
*[http://ai.eecs.umich.edu/ University of Michigan - AI Lab] &lt;br /&gt;
*[http://www.lsa.umich.edu/eli/research/library/ University of Michigan - English Language Institute Library]&lt;br /&gt;
&lt;br /&gt;
====Minnesota====&lt;br /&gt;
*[http://carla.acad.umn.edu/ CARLA: Center for Advanced Research on Language Acquisition]&lt;br /&gt;
&lt;br /&gt;
====New Jersey====&lt;br /&gt;
*[http://www.tcnj.edu/~mmmartin/CMSC485/CMSC485.html The College of New Jersey - CMSC 485: Special Topics : Question Answering Systems]&lt;br /&gt;
&lt;br /&gt;
====New York====&lt;br /&gt;
*[http://www.cs.columbia.edu/nlp/ Columbia University - NLP Group]&lt;br /&gt;
*[http://www.cs.columbia.edu/nlp/sgd/ Columbia University - Statistical Generation Day]&lt;br /&gt;
*[http://www.cs.cornell.edu/Info/Projects/NLP/ Cornell University - Natural Language Processing, Computer Science]&lt;br /&gt;
*[http://web.gc.cuny.edu/linguistics/ CUNY (City University of New York) - Graduate Center Linguistics Program]&lt;br /&gt;
*[http://cs.nyu.edu/cs/projects/proteus New York University - Proteus Project]&lt;br /&gt;
*[http://www.nyu.edu/pages/linguistics New York University - Linguistics Department]&lt;br /&gt;
*[http://www.cs.buffalo.edu/ SUNY Buffalo - Department of Computer Science]&lt;br /&gt;
*[http://www.cs.rochester.edu/ University of Rochester - CS Department]&lt;br /&gt;
*[http://www.ling.rochester.edu/ University of Rochester - Linguistics department]&lt;br /&gt;
&lt;br /&gt;
====New Mexico====&lt;br /&gt;
*[http://crl.nmsu.edu/Home.html New Mexico State University - Computing Research Lab]&lt;br /&gt;
&lt;br /&gt;
====North Carolina====&lt;br /&gt;
*[http://www.ils.unc.edu/~losee University of North Carolina - Bob Losee]&lt;br /&gt;
&lt;br /&gt;
====Ohio====&lt;br /&gt;
*[http://cllt.osu.edu/ Computational Linguistics and Language Technology at OSU]&lt;br /&gt;
*[http://www.ling.ohio-state.edu/research/comp/ The Ohio State University - Computational Linguistics]&lt;br /&gt;
*[http://www.cse.ohio-state.edu/slate/ SLATE Lab Speech and Language Technologies at OSU]&lt;br /&gt;
&lt;br /&gt;
====Oregon====&lt;br /&gt;
*[http://www.cse.ogi.edu/CHCC Oregon Graduate Institute - Center for Human-Computer Interaction]&lt;br /&gt;
*[http://www.cse.ogi.edu/CSLU/ Oregon Graduate Institute - Center for Spoken Language Understanding]&lt;br /&gt;
&lt;br /&gt;
====Pennsylvania====&lt;br /&gt;
*[http://www.lti.cs.cmu.edu/ Carnegie Mellon University - Language Technologies Institute]&lt;br /&gt;
*[http://www.speech.cs.cmu.edu/ Carnegie Mellon University - Speech Webpage (Sphinx Group)]&lt;br /&gt;
*[http://www.cs.cmu.edu/afs/cs/project/soar/public/www/home-page.html Carnegie Mellon University - The SOAR project]&lt;br /&gt;
*[http://www.cis.upenn.edu/~ircs/homepage.html University of Pennsylvania - Institute for Research in Cognitive Science]&lt;br /&gt;
*[http://www.cis.upenn.edu/~cliff-group/94/cliffnotes.html University of Pennsylvania - Research in the Language, Information and Computation Laboratory]&lt;br /&gt;
*[http://ling.upenn.edu/ University of Pennsylvania - Dept. of Linguistics]&lt;br /&gt;
*[http://www.isp.pitt.edu/ University of Pittsburgh - Intelligent Systems Program]&lt;br /&gt;
&lt;br /&gt;
====Rhode Island====&lt;br /&gt;
*[http://www.cog.brown.edu/ Brown University - Department of Cognitive and Linguistic Sciences] &lt;br /&gt;
*[http://bllip.cs.brown.edu/ Brown Laboratory for Linguistic Information Processing (BLLIP)]&lt;br /&gt;
&lt;br /&gt;
====Texas====&lt;br /&gt;
*[http://www.cs.utexas.edu/users/mfkb/papers University of Texas, Austin - KBS Group, Selected Publications] &lt;br /&gt;
*[http://www.utexas.edu/cola/centers/lrc/ University of Texas, Austin - Linguistics Research Center (LRC)]&lt;br /&gt;
*[http://www.cs.utexas.edu/users/mfkb/knight.html University of Texas, Austin - NLG in Computer Science]&lt;br /&gt;
*[http://comp.ling.utexas.edu University of Texas, Austin - Computational Linguistics Lab] &lt;br /&gt;
*[http://ling.uta.edu/ University of Texas, Arlington - Linguistics Dept.]&lt;br /&gt;
*[http://www.hlt.utdallas.edu University of Texas, Dallas - Human Language Technology Research Institute]&lt;br /&gt;
&lt;br /&gt;
====Utah====&lt;br /&gt;
*[http://nlp.cs.byu.edu/mediawiki/index.php/Main_Page Brigham Young University - Natural Language Processing Lab]&lt;br /&gt;
*[http://www.cs.utah.edu/projects/nlp/ University of Utah - Natural Language Processing Group]&lt;br /&gt;
&lt;br /&gt;
====Washington====&lt;br /&gt;
*[http://depts.washington.edu/uwcl/ University of Washington - Computational Linguistics Laboratory]&lt;br /&gt;
*[http://www.compling.uw.edu/ University of Washington - Computational Linguistics MA program]&lt;br /&gt;
*[http://depts.washington.edu/lingweb University of Washington - Dept of Linguistics]&lt;br /&gt;
*[http://turing.cs.washington.edu/ University of Washington - Turing Center]&lt;br /&gt;
*[http://ssli.ee.washington.edu/ssli/ University of Washington - Signal, Speech and Language Interpretation Lab]&lt;br /&gt;
&lt;br /&gt;
====Washington D.C.====&lt;br /&gt;
*[http://www.georgetown.edu/departments/linguistics/news/CLIPos.htm Georgetown University - Department of Linguistics] &lt;br /&gt;
*[http://summerschool.georgetown.edu/ Georgetown University - Summer Institute] &lt;br /&gt;
*[http://www.georgetown.edu/compling/home.html Georgetown University - Department of Linguistics]&lt;br /&gt;
&lt;br /&gt;
====Wisconsin====&lt;br /&gt;
*[http://tigger.cs.uwm.edu/~nlkrrg University of Wisconsin, Milwaukee - Natural Language and Knowledge Representation Research Group]&lt;br /&gt;
&lt;br /&gt;
==Europe==&lt;br /&gt;
*[http://www.ims.uni-stuttgart.de/info/SitesEurope.html Computational Linguistics in Europe]  &lt;br /&gt;
*[http://www.coli.uni-saarland.de/msc/lct/ European Masters Program in Language and Communication Technologies (LCT)] &lt;br /&gt;
*[http://www.coli.uni-sb.de/egk/ European Post-Graduate College Language Technology and Cognitive Systems]  &lt;br /&gt;
*[http://ixa.si.ehu.es IXA Group, Kepa Sarasola]  &lt;br /&gt;
*[http://www.langsoft.ch NLP software]  &lt;br /&gt;
*[http://www.shef.ac.uk/dcs/postgrad/taught/hlt.html University of Sheffield - Department of Computer Science]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Belarus===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Belarus Language Engineering in Belarus (from Univ. of Edinburgh/ELSNET)]   &lt;br /&gt;
===Belgium===&lt;br /&gt;
*[http://www.fltr.ucl.ac.be/fltr/germ/etan/cecl/cecl.html UCLouvain - Centre for English Corpus Linguistics (CECL)] &lt;br /&gt;
*[http://cental.fltr.ucl.ac.be/ UCLouvain - Centre for Natural Language Processing (CENTAL)]&lt;br /&gt;
*[http://www.ccl.kuleuven.be/ Katholieke Universiteit Leuven - Centre for Computational Linguistics]&lt;br /&gt;
&lt;br /&gt;
===Bulgaria===&lt;br /&gt;
*[http://www.bacl.org/ Bulgarian Association for Computational Linguistics] &lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Bulgaria Language Engineering in Bulgaria (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Croatia===&lt;br /&gt;
*[http://www.ihjj.hr/ Institute of Croatian Language and Linguistics]&lt;br /&gt;
*[http://ling.unizd.hr/ University of Zadar - Linguistics Department]&lt;br /&gt;
*[http://www.ffzg.hr/zzl/ University of Zagreb - Institute of Linguistics, Faculty of Philosophy]&lt;br /&gt;
*[http://www.ffzg.hr/oling/ University of Zagreb - Department of Linguistics, Faculty of Philosophy]&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Croatia Language Engineering in Croatia (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Czech Republic===&lt;br /&gt;
*[http://www.cuni.cz/ Univerzita Karlova] (Charles University) [http://en.wikipedia.org/wiki/Prague Praha]&lt;br /&gt;
**[http://www.mff.cuni.cz/ Matematicko-fyzikální fakulta] (Faculty of Mathematics and Physics)&lt;br /&gt;
***[http://ufal.mff.cuni.cz/ Ústav formální a aplikované lingvistiky] (Institute of Formal and Applied Linguistics)&lt;br /&gt;
**[http://www.ff.cuni.cz/ Filozofická fakulta] (Faculty of Philosophy and Arts)&lt;br /&gt;
***[http://utkl.ff.cuni.cz/ Ústav teoretické a komputační lingvistiky] (Institute of Theoretical and Computational Linguistics)&lt;br /&gt;
***[http://ucnk.ff.cuni.cz/ Ústav Českého národního korpusu] (Institute of the Czech National Corpus)&lt;br /&gt;
*[http://www.cas.cz/ Česká akademie věd] (Czech Academy of Sciences)&lt;br /&gt;
**[http://www.ujc.cas.cz/ Ústav jazyka českého] (Institute of the Czech Language)&lt;br /&gt;
*[http://www.muni.cz/ Masarykova univerzita] (Masaryk University) [http://en.wikipedia.org/wiki/Brno Brno]&lt;br /&gt;
**[http://www.fi.muni.cz/ Fakulta informatiky] (Faculty of Computer Science)&lt;br /&gt;
***[http://nlp.fi.muni.cz/ Laboratoř zpracování přirozeného jazyka] (Natural Language Processing Laboratory)&lt;br /&gt;
*[http://www.zcu.cz/ Západočeská univerzita] (University of West Bohemia) [http://en.wikipedia.org/wiki/Pilsen Plzeň]&lt;br /&gt;
**[http://www.fav.zcu.cz/ Fakulta aplikovaných věd] (Faculty of Applied Science)&lt;br /&gt;
***[http://www.kky.zcu.cz/ Katedra kybernetiky] (Department of Cybernetics)&lt;br /&gt;
***[http://www.kiv.zcu.cz/ Katedra informatiky a výpočetní techniky] (Department of Computer Science and Engineering)&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/ Language Engineering in the Czech Republic (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Denmark===&lt;br /&gt;
*[http://www.cst.dk/ University of Copenhagen - Center for Sprogteknologi (Centre for Language Technology)] &lt;br /&gt;
*[http://www.cphling.dk/ University of Copenhagen - Linguistics Department] &lt;br /&gt;
*[http://isle.nis.sdu.dk/ NIMM workgroup on Natural Interaction and MultiModality]&lt;br /&gt;
&lt;br /&gt;
===Estonia===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Estonia Language Engineering in Estonia (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Finland===&lt;br /&gt;
*[http://www.ling.helsinki.fi/ University of Helsinki - Department of General Linguistics] &lt;br /&gt;
&lt;br /&gt;
===France===&lt;br /&gt;
*[http://lia.univ-avignon.fr/fileadmin/axes/TALNE/ Université d&#039;Avignon - LIA TALNE | NLP ]&lt;br /&gt;
*[http://lia.univ-avignon.fr/thematiques/langage/index.html?L=lctajrdpfjmaan Université d&#039;Avignon - Laboratoire Informatique d&#039;Avignon (LIA) : Language]&lt;br /&gt;
*[http://www.limsi.fr/Recherche/LIR/presentationLIRgb.html Limsi, group LIR: Language, Information and Representation] &lt;br /&gt;
*[http://www.med.univ-rennes1.fr/menelas.html University of Rennes - MENELAS PROJECT] &lt;br /&gt;
*[http://infolingu.univ-mlv.fr/english/International/postDocResources.html Postdoctoral Fellowship at Institut Gaspard-Monge] &lt;br /&gt;
*[http://www.linguist.jussieu.fr/ UFRL - Linguistics, Jussieu, Paris]&lt;br /&gt;
*[http://talc.loria.fr/-Enseignement-.html Two NLP masters at University of Nancy (in English and French)]&lt;br /&gt;
&lt;br /&gt;
===Georgia===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Georgia Language Engineering in Georgia (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Germany===&lt;br /&gt;
*[http://mm-werkstatt.informatik.uni-augsburg.de/ University of Augsburg - Multimedia Concepts and Their Applications] &lt;br /&gt;
&lt;br /&gt;
*[http://hpsg.fu-berlin.de/ Freie Universität Berlin (FU Berlin) - German Grammar and General Linguistics] (HPSG group)&lt;br /&gt;
&lt;br /&gt;
*University of Bielefeld (Universität Bielefeld)&lt;br /&gt;
**[http://www.cit-ec.de/ Center of Excellence in Cognitive Interaction Technology] (CITEC)&lt;br /&gt;
**[http://coli.lili.uni-bielefeld.de/ Dept. of Applied Computational Linguistics and Text Technology]&lt;br /&gt;
**[http://wwwhomes.uni-bielefeld.de/mkracht/index-en.html Dept. of Theoretical Computational Linguistics and Mathematical Linguistics]&lt;br /&gt;
**[http://www.uni-bielefeld.de/lili/forschung/ag_fachber/theoling/ Dept. of Theoretical Linguistics]&lt;br /&gt;
**[http://www.techfak.uni-bielefeld.de/ags/wbski/wbski_engl.html Artificial Intelligence Group]&lt;br /&gt;
**[http://www.techfak.uni-bielefeld.de/ags/soa/ Sociable Agents Group]&lt;br /&gt;
**[http://aiweb.techfak.uni-bielefeld.de/ Applied Computer Science Group]&lt;br /&gt;
&lt;br /&gt;
*[http://www.linguistics.ruhr-uni-bochum.de/ University of Bochum - Dept. of General and Comparative Linguistics] &lt;br /&gt;
&lt;br /&gt;
*[http://www-user.uni-bremen.de/~bateman/ University of Bremen - English/Computational Linguistics] &lt;br /&gt;
&lt;br /&gt;
*[http://www.ukp.tu-darmstadt.de/ Darmstadt University - Ubiquitous Knowledge Processing Group, Dept. of Telecooperation]&lt;br /&gt;
&lt;br /&gt;
*[http://www.dfki.de/ DFKI] - German Research Center for Artificial Intelligence (Kaiserslautern, Saarbrücken, Bremen, Berlin) &lt;br /&gt;
&lt;br /&gt;
*[http://pi7.fernuni-hagen.de/ University Hagen - Dept. of Artificial Intelligence and Natural Language Processing] &lt;br /&gt;
&lt;br /&gt;
*University of Heidelberg&lt;br /&gt;
**[http://www.cl.uni-heidelberg.de/ Computational Linguistics]&lt;br /&gt;
**[http://www.gs.uni-heidelberg.de/ Germanistisches Seminar] (visiting profs wanted)&lt;br /&gt;
&lt;br /&gt;
*[http://www.ids-mannheim.de/ Institut fuer deutsche Sprache] (Mannheim) &lt;br /&gt;
&lt;br /&gt;
*[http://www.uni-koblenz.de/~compling University of Koblenz - Institute for Computational Linguistics] &lt;br /&gt;
&lt;br /&gt;
*[http://ling.uni-konstanz.de/ University of Konstanz - Linguistics dept.]&lt;br /&gt;
&lt;br /&gt;
*[http://www.asv.informatik.uni-leipzig.de/index.php?lan=en University of Leipzig - NLP Department]&lt;br /&gt;
&lt;br /&gt;
*University of Munich (LMU München)&lt;br /&gt;
**[http://www.phonetik.uni-muenchen.de/Bas/BasHomeeng.html Bayerisches Archiv f&amp;amp;uuml;r Sprachsignale]&lt;br /&gt;
**[http://www.phonetik.uni-muenchen.de/ Phonetics Department] &lt;br /&gt;
&lt;br /&gt;
*[http://www.phil.uni-passau.de/linguistik/ University of Passau - Linguistics dept.] &lt;br /&gt;
&lt;br /&gt;
*[http://www.ling.uni-potsdam.de/ University of Potsdam - Linguistics dept.] &lt;br /&gt;
&lt;br /&gt;
*Saarland University (Saarbrücken)&lt;br /&gt;
**[http://www.coli.uni-saarland.de/ Dept. of Computational Linguistics and Phonetics]&lt;br /&gt;
**[http://www.lsv.uni-saarland.de/ Dept. of Spoken Language Systems]&lt;br /&gt;
&lt;br /&gt;
*University of Stuttgart&lt;br /&gt;
**[http://www.ims.uni-stuttgart.de/ Institute for Natural Language Processing]&lt;br /&gt;
**[http://www.ims.uni-stuttgart.de/projekte/gramotron/ IMS Theoretical Computational Linguistics: GRAMOTRON Group] &lt;br /&gt;
&lt;br /&gt;
*[http://www.ldv.uni-trier.de/ University of Trier - Computational Linguistics] &lt;br /&gt;
&lt;br /&gt;
*[http://www.sfs.nphil.uni-tuebingen.de/ University of T&amp;amp;uuml;bingen - Dept. of Linguistics]&lt;br /&gt;
&lt;br /&gt;
===Greece===&lt;br /&gt;
*[http://nlp.cs.aueb.gr/ Athens University of Economics and Business, Department of Informatics, Natural Language Processing Group] &lt;br /&gt;
*[http://www.ilsp.gr/ Institute for Language and Speech Processing, Athens] &lt;br /&gt;
*[http://glotta.ntua.gr/nlp Natural Language Processing Lab, NTUA, Greece] &lt;br /&gt;
*[http://www.iit.demokritos.gr/skel Software and Knowledge Engineering Lab, NCSR &amp;quot;Demokritos&amp;quot;, Athens, Greece] &lt;br /&gt;
*[http://slt.wcl.ee.upatras.gr/ U. of Patras - Speech and Language Technology group]&lt;br /&gt;
&lt;br /&gt;
===Hungary===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Hungary Language Engineering in Hungary (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Iceland===&lt;br /&gt;
*[http://tungutaekni.is/english.html University of Iceland - Icelandic Centre for Language Technology]&lt;br /&gt;
&lt;br /&gt;
===Ireland===&lt;br /&gt;
*[http://www.cs.tcd.ie/courses/csll/CSLLcourse.html University of Dublin - Trinity College - Undergraduate Degree in Computational Linguistics]&lt;br /&gt;
&lt;br /&gt;
===Italy===&lt;br /&gt;
*[http://www.ciscl.unisi.it/ University of Siena - Centro Interdipartimentale di Studi Cognitivi sul Linguaggio (CISCL)]&lt;br /&gt;
*[http://tcc.itc.it/ ITC-Irst - Cognitive and Communication Technologies division] &lt;br /&gt;
*[http://www.ilc.pi.cnr.it/ ILC - Istituto di Linguistica Computazionale]&lt;br /&gt;
*[http://lcl.di.uniroma1.it/ Linguistic Computing Laboratory - University of Rome La Sapienza]&lt;br /&gt;
&lt;br /&gt;
===Latvia===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Latvia Language Engineering in Latvia (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Lithuania===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Lithuania Language Engineering in Lithuania (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Netherlands===&lt;br /&gt;
*[http://ilk.uvt.nl/~antalb/ Tilburg University - Antal van den Bosch, Computational Linguistics and AI] &lt;br /&gt;
*[http://www.let.rug.nl/~vannoord/Clin/clin.html CLIN - Computational Lingustics in the Netherlands] &lt;br /&gt;
*[http://wwwseti.cs.utwente.nl/Docs/parlevink/parlevink.html Univ. of Twente - Parlevink Linguistic Engineering Project] &lt;br /&gt;
*[http://fonsg3.let.uva.nl/ University of Amsterdam - Institute of Phonetic Sciences] &lt;br /&gt;
*[http://www.hum.uva.nl/graduateschool University of Amsterdam - Masters Program in Linguistics] &lt;br /&gt;
*[http://www.cs.kun.nl/agfl/ University of Nijmegen - Affix Grammars over a Finite Lattice (AGFL)] &lt;br /&gt;
*[http://www-uilots.let.uu.nl/ Utrecht University - Institute of Linguistics OTS]&lt;br /&gt;
&lt;br /&gt;
===Norway===&lt;br /&gt;
*[http://multilingua.uib.no/ University of Bergen - MULTILINGUA]&lt;br /&gt;
*[http://www.mn.uio.no/ifi/english/research/groups/ltg/ University of Oslo - Language Technology Group (LTG)]&lt;br /&gt;
*[http://giellatekno.uit.no/ University of Tromsø - Sámi language technology]&lt;br /&gt;
&lt;br /&gt;
===Poland===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Poland Language Engineering in Poland (from Univ. of Edinburgh/ELSNET; &amp;lt;strong&amp;gt;outdated!&amp;lt;/strong&amp;gt;)]&lt;br /&gt;
*[http://nlp.ipipan.waw.pl/ Polish Academy of Sciences - Language Engineering Group]&lt;br /&gt;
&lt;br /&gt;
===Romania===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Romania Language Engineering in Romania (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Russia===&lt;br /&gt;
*[http://rykov-cl.narod.ru/ Corpus Linguistics - course of lectures read in Grodno in 2002]&lt;br /&gt;
&lt;br /&gt;
===Slovakia===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Slovak Republic Language Engineering in Slovakia (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Slovenia===&lt;br /&gt;
*[http://kt.ijs.si/ Jozef Stefan Institute - Department of Knowledge Technologies] &lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Slovenia Language Engineering in Slovenia (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
===Spain===&lt;br /&gt;
*[http://www.grupocole.org/ COLE Research Group] &lt;br /&gt;
*[http://www.deli.deusto.es Deusto University - DELi: Digital edition and language engineering] &lt;br /&gt;
*[http://www.upf.es/dtf Universitat Pompeu,Fabra (UPF), Barcelona - Department of Translation and Philology] &lt;br /&gt;
*[http://www.dq-salamanca.com don Quijote Salamanca Spanish Language School]&lt;br /&gt;
*[http://protos.dis.ulpgc.es Universidad de Las Palmas de Gran Canaria - Grupo de Estructuras de Datos y Linguistica Computacional]&lt;br /&gt;
*[http://www.iiia.csic.es/ Institut d&#039;Investigaci&amp;amp;oacute; en Intellig&amp;amp;egrave;ncia Artificial]&lt;br /&gt;
*[http://www.lllf.uam.es/ Universidad Autonoma de Madrid - Laboratorio de Linguistica Informatica (LLI-UAM)]&lt;br /&gt;
*[http://www.um.es/lacell/ University of Murcia - LACELL Research Group]&lt;br /&gt;
*[http://gplsi.dlsi.ua.es/ University of Alicante - Natural Language Processing Research Group]&lt;br /&gt;
*[http://transducens.dlsi.ua.es/ University of Alicante - Transducens Group]&lt;br /&gt;
*[http://www.lsi.upc.es/~nlp/ Technical University of Catalonia - Natural Language Research Group]&lt;br /&gt;
*[http://sli.uvigo.es Universidade de Vigo - Seminario de Linguistica Informatica (SLI)]&lt;br /&gt;
*[http://www.talp.upc.es/ TALP Research Center]&lt;br /&gt;
*[http://www.vai.dia.fi.upm.es/ Validation and Bussiness Applications Group. Linguistic team.]&lt;br /&gt;
*[http://sinai.ujaen.es/ University of Jaén - SINAI Research Group -]&lt;br /&gt;
*[http://ixa.si.ehu.es/ University of the Basque Country - IXA Group]&lt;br /&gt;
*[http://aholab.ehu.es University of the Basque Country - Aholab group]&lt;br /&gt;
&lt;br /&gt;
===Sweden===&lt;br /&gt;
*[http://www.ling.gu.se/ Univ. of Goteborg - Department of Linguistics]&lt;br /&gt;
*[http://www.speech.kth.se/ KTH - Department of Speech Communication and Music Acoustics]&lt;br /&gt;
*[http://www.ling.lu.se/ Lund University  - Dept. of Linguistics and Phonetics]&lt;br /&gt;
*[http://www.ida.liu.se/~nlplab/ Link&amp;amp;ouml;ping University - NLPLAB, Department of Computer and Information Science]&lt;br /&gt;
*[http://www.ling.gu.se/~cooper Robin Cooper]&lt;br /&gt;
*[http://www.sics.se/nlp/nlp.html SICS - Natural Language Processing Group]&lt;br /&gt;
*[http://www.ling.uu.se/ University of Uppsala - Linguistics]&lt;br /&gt;
*[http://stp.ling.uu.se/stp/ University of Uppsala - STP: Language Engineering Programme]&lt;br /&gt;
*[http://jean.ling.umu.se/ Umea University - Institute of Linguistics]&lt;br /&gt;
&lt;br /&gt;
===Switzerland===&lt;br /&gt;
*[http://www.ifi.unizh.ch/groups/CL/ Univ. of Zurich - Computational Linguistics Group, Dept. of Computer Science] &lt;br /&gt;
*[http://www.unifr.ch/ l&#039;Universite de Fribourg - Institut d&#039;Informatique] &lt;br /&gt;
*[http://www.idiap.ch/ Institut Dalle Molle d&#039;Intelligence Artificielle Perceptive] &lt;br /&gt;
*[http://www.unil.ch/ling/Bienvenue.html Univ. de Lausanne - Linguistics Department] &lt;br /&gt;
*[http://www.unil.ch/ling UNIL - Linguistique]&lt;br /&gt;
*[http://www.issco.unige.ch Multilingual Information Processing Unit (TIM), School of Translation and Interpretation (ETI), University of Geneva]&lt;br /&gt;
*[http://www.latl.unige.ch LATL - Language Technology Laboratory, Department of Linguistics, University of Geneva]&lt;br /&gt;
&lt;br /&gt;
===Turkey===&lt;br /&gt;
*[http://ai.ku.edu.tr Koç University - Artificial Intelligence Laboratory]&lt;br /&gt;
*[http://www.lcsl.metu.edu.tr/ Middle East Technical University - Laboratory for the Computational Studies of Language]&lt;br /&gt;
*[http://www.hlst.sabanciuniv.edu Sabanci Univ. - Human Language and Speech Technologies Labratory]&lt;br /&gt;
&lt;br /&gt;
===UK===&lt;br /&gt;
*[http://www.csd.abdn.ac.uk/research/nlg/ University of Aberdeen - Natural Language Generation Group] &lt;br /&gt;
*[http://www.csd.abdn.ac.uk/research/babytalk/ University of Aberdeen - Babytalk: Generating Textual Summaries of Clinical Temporal Data]&lt;br /&gt;
*[http://www.cl.cam.ac.uk/Research/NL/index.html University of Cambridge - NLP group] &lt;br /&gt;
*[http://svr-www.eng.cam.ac.uk/cstit/ University of Cambridge - Computer speech, text, and internet technology]&lt;br /&gt;
*[http://rdues.uce.ac.uk/ University of Central England - Research and Development Unit for English Studies (RSDUES)] &lt;br /&gt;
*[http://www.dai.ed.ac.uk/ University of Edinburgh - Department of Artificial Intelligence]&lt;br /&gt;
*[http://www.cogsci.ed.ac.uk/ccs/home.html University of Edinburgh - Alexander Holt, Centre for Cognitive Science]&lt;br /&gt;
*[http://www.cogsci.ed.ac.uk/hcrc/home.html University of Edinburgh - Human Communication Research Center] &lt;br /&gt;
*[http://www.essex.ac.uk/linguistics/ University of Essex - Department of Linguistics]&lt;br /&gt;
*[http://cswww.essex.ac.uk/LAC/ University of Essex - Language and Computation Group] &lt;br /&gt;
*[http://clwww.essex.ac.uk/ University of Essex - CL/MT Research Group Home Page]&lt;br /&gt;
*[http://www.dcs.kcl.ac.uk/research/groups/nlp/index.html King&#039;s College - MSc and MPhil/PhD Programs in NLP in the Computer Science Dept.] &lt;br /&gt;
*[http://mcs.open.ac.uk/nlg/ The Open University - Natural Language Generation group, Centre for Research in Computing] &lt;br /&gt;
*[http://www.clg.ox.ac.uk Oxford University - CL group]&lt;br /&gt;
*[http://www.comp.lancs.ac.uk/computing/research/ucrel/corpora.html Lancaster University - UCREL corpus page] &lt;br /&gt;
*[http://www.comp.lancs.ac.uk/computing/research/ucrel/ Lancaster University - Unit for Computer Research on the English Language] &lt;br /&gt;
*[http://www.comp.leeds.ac.uk/nlp/ University of Leeds - School of Computing, NLP group]&lt;br /&gt;
*[http://www.phon.ucl.ac.uk/ Univ. of London - University College Dept. of Phonetics and Linguistics] &lt;br /&gt;
*[http://osiris.sunderland.ac.uk/jta/nl-grp.htm University of Sunderland - Natural Language Engineering Group]&lt;br /&gt;
*[http://www.surrey.ac.uk/ELI/eli.htm University of Surrey - English Language Institute]&lt;br /&gt;
*[http://www.cogs.susx.ac.uk/lab/nlp/index.html University of Sussex - Computational Linguistics]&lt;br /&gt;
*[http://clg.wlv.ac.uk/ University of Wolverhampton - Computational Linguistics]&lt;br /&gt;
&lt;br /&gt;
===Ukraine===&lt;br /&gt;
*[http://www.elsnet.org/publications/survey/#Ukraine Language Engineering in Ukraine (from Univ. of Edinburgh/ELSNET)]&lt;br /&gt;
&lt;br /&gt;
==Oceania==&lt;br /&gt;
*[http://www.clt.mq.edu.au/ Macquarie University - Centre for Language Technology] &lt;br /&gt;
*[http://www.ims.uni-stuttgart.de/info/SitesAustralia.html Computational Linguistics in Australia] &lt;br /&gt;
*[http://www.vuw.ac.nz/ling Victoria University of Wellington, New Zealand - Department of Linguistics] &lt;br /&gt;
*[http://www.auckland.ac.nz/asi/asi_home.html The University of Auckland, New Zealand - Dept. of Asian Languages &amp;amp; Literatures] &lt;br /&gt;
*[http://www.cs.mu.oz.au/research/lt/ University of Melbourne - Language Technology Group, Department of Computer Science and Software Engineering] &lt;br /&gt;
*[http://www.cs.usyd.edu.au/~rcdmnl/ University of Sydney - Language Technology Research Group, School of Information Technologies]&lt;br /&gt;
*[http://www.arts.unimelb.edu.au/Dept/LALX University of Melbourne - Department of Linguistics &amp;amp; Applied Linguistics]&lt;br /&gt;
*[http://www.csse.monash.edu.au/research/umnl/ Monash University - User Modeling and Natural Language Group, ]&lt;br /&gt;
&lt;br /&gt;
==South America==&lt;br /&gt;
&lt;br /&gt;
===Brazil===&lt;br /&gt;
*[http://www.di.ufpe.br/ Federal University of Pernambuco - Jacques Robin, CS Department]&lt;br /&gt;
*[http://www.nilc.icmc.usp.br/nilc/ NILC - An Interinstitutional Center for Research and Development in Computational Linguistics]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See Also==&lt;br /&gt;
*[[Organizations, departments, institutions, groups, companies]] - full list of organizations that do CL&lt;br /&gt;
&lt;br /&gt;
[[Category:Education]]&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
	<entry>
		<id>https://www.aclweb.org/aclwiki/index.php?title=Employment_opportunities,_postdoctoral_positions,_summer_jobs&amp;diff=7213</id>
		<title>Employment opportunities, postdoctoral positions, summer jobs</title>
		<link rel="alternate" type="text/html" href="https://www.aclweb.org/aclwiki/index.php?title=Employment_opportunities,_postdoctoral_positions,_summer_jobs&amp;diff=7213"/>
		<updated>2009-09-08T16:27:16Z</updated>

		<summary type="html">&lt;p&gt;Oe: Associate Professorship at University of Oslo&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;* Please post your job ad below. &lt;br /&gt;
* Jobs are listed in chronological order of posting: &#039;&#039;&#039;first is newest, last is oldest&#039;&#039;&#039;. &lt;br /&gt;
* &#039;&#039;&#039;Please remove your posting when the position is filled.&#039;&#039;&#039; &lt;br /&gt;
* Please include the following information:&lt;br /&gt;
** Employer&lt;br /&gt;
** Rank or Title&lt;br /&gt;
** Specialty (e.g., Computational Linguistics, Natural Language Processing, Machine Translation)&lt;br /&gt;
** Location&lt;br /&gt;
** Deadline&lt;br /&gt;
** Date Posted&lt;br /&gt;
** Contact email or link to website&lt;br /&gt;
* See also the [http://linguistlist.org/jobs/index.html Linguist Job List].&lt;br /&gt;
* Archived postings:&lt;br /&gt;
** [[Employment opportunities posted 2008]]&lt;br /&gt;
** [[Employment opportunities posted 2007]]&lt;br /&gt;
&lt;br /&gt;
== Associate Professorship in Natural Language Processing, University of Oslo ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; [http://www.ifi.uio.no Department of Informatics], [http://www.uio.no University of Oslo]&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Associate Professor (tenured)&lt;br /&gt;
* &#039;&#039;&#039;Specialization:&#039;&#039;&#039; data-driven and hybrid approaches to NLP&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; Friday, October 9, 2009&lt;br /&gt;
* &#039;&#039;&#039;Announcement:&#039;&#039;&#039; [http://www.emmtee.net/ap.09.09.html job posting]&lt;br /&gt;
&lt;br /&gt;
== Text Mining Positions, JULIE Lab (Germany) ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; JULIE Lab, Friedrich-Schiller-Universität Jena, Germany&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Post doc or Ph.D.&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; NLP&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; Open until filled&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; Aug 26, 2009&lt;br /&gt;
* &#039;&#039;&#039;Contact:&#039;&#039;&#039; Katrin Tomanek &amp;lt;katrin.tomanek@uni-jena.de&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://www.julielab.de JULIE Lab Web Site] &lt;br /&gt;
&lt;br /&gt;
The Jena University Language &amp;amp; Information Engineering (JULIE) Lab has two vacant text mining positions available, a Post Doc and a Ph.D. position, to boost its research efforts in advanced text analytics, i.e., named entity and relation extraction, knowledge discovery from texts. Annual salary ranges from 40,000 – 45,000 € (approximately 60,000 $) for the post doc position and 35,000 – 40,000 € (approximately 55,000 $) for the Ph.D. position, both dependent on previous work experience. JULIE Lab has a strong reputation in biomedical information extraction and text mining and is an international leader in research in the field of text analytics (please, visit http://www.julielab.de).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Requirements for Candidates:&lt;br /&gt;
&lt;br /&gt;
*  outstanding degree in computational linguistics/language technology or related fields in computer science (information retrieval, data mining, artificial intelligence, machine learning, information systems, human-computer interaction, Semantic Web, etc.) from a major school/department/university&lt;br /&gt;
* necessary: good proficiency in statistics and machine learning methodologies&lt;br /&gt;
* desired: solid information extraction/text mining skills&lt;br /&gt;
* excellent programming skills (Java), awareness of software engineering discipline in coding (UIMA, coding conventions, SE tools, etc.)&lt;br /&gt;
* background knowledge in the life sciences (can also be acquired or deepened while staying in the lab)&lt;br /&gt;
* strong dedication to scientific excellence&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Informal inquiries can be addressed to: &lt;br /&gt;
Katrin Tomanek, Friedrich-Schiller-Universität Jena, Email: katrin.tomanek@uni-jena.de&lt;br /&gt;
&lt;br /&gt;
Applications (e-mail preferred) should be sent to: &lt;br /&gt;
Prof. Dr. Udo Hahn, Friedrich-Schiller-Universität Jena, 07743 Jena, Fürstengraben 30, Germany, Email: udo.hahn@uni-jena.de&lt;br /&gt;
&lt;br /&gt;
== Programmer Analyst, Linguistic Data Consortium, University of Pennsylvania (Philadelphia, PA, USA) ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; Linguistic Data Consortium, University of Pennsylvania&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Programmer Analyst (Ref #: 090727106)&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Language Resource Creation, Natural Language Processing&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; Open untill filled&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; Aug 12, 2009&lt;br /&gt;
* &#039;&#039;&#039;Contact:&#039;&#039;&#039; Kazuaki Maeda &amp;lt;maeda@ldc.upenn.edu&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [https://jobs.hr.upenn.edu/applicants/Central?quickFind=190206 Online Application] [http://www.ldc.upenn.edu/ LDC Web Site] &lt;br /&gt;
&lt;br /&gt;
Linguistic Data Consortium at the University of Pennsylvania has an immediate opening for a full-time programmer analyst to support our &lt;br /&gt;
rapidly growing linguistic resource creation projects, including the DARPA Machine Reading program.  &lt;br /&gt;
&lt;br /&gt;
Duties: This position will support multiple, concurrent language resource creation projects by providing programming, technical and research support in a lead capacity.  Working with internal and external stakeholders, the position will develop achievable technical roadmaps for each project and will oversee their execution.&lt;br /&gt;
&lt;br /&gt;
Tasking may include:&lt;br /&gt;
&lt;br /&gt;
# design and develop flexible user interfaces for manual annotation of linguistic data&lt;br /&gt;
# prepare linguistic resources for annotation, including indexing and format normalization&lt;br /&gt;
# negotiate project technical specifications with key internal and external stakeholders&lt;br /&gt;
# develop data formats to support collection and annotation tasks&lt;br /&gt;
# research, evaluate and integrate third-party software into LDC&#039;s data production pipeline&lt;br /&gt;
# perform statistical analysis of linguistic data&lt;br /&gt;
# train and supervise full-time or part-time technical staff&lt;br /&gt;
# assist with corpus publication including data validation and sanity checks&lt;br /&gt;
# provide technical support to linguistic annotators and other project staff&lt;br /&gt;
# represent technical aspects of LDC&#039;s linguistic resource creation efforts at workshops and in publications, as required.&lt;br /&gt;
&lt;br /&gt;
This position is contingent upon funding.  For further information or to apply online, please go to [https://jobs.hr.upenn.edu/applicants/Central?quickFind=190206 Online Application].  The University of Pennsylvania is an affirmative action/equal opportunity employer.&lt;br /&gt;
&lt;br /&gt;
== Postdoctoral Fellowship, Department of Biomedical Informatics, University of Utah  ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; Department of Biomedical Informatics, University of Utah&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Postdoctoral Fellowship&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Natural Language Processing (machine learning and/or UIMA experience a plus!)&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; Open, hope to fill to fill by October 01, 2009&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; July 05, 2009&lt;br /&gt;
* &#039;&#039;&#039;Contact:&#039;&#039;&#039; &lt;br /&gt;
Jo Ann Thompson (administrative issues)=&amp;gt; JoAnn.Thompson@hsc.utah.edu;&lt;br /&gt;
 &lt;br /&gt;
John Hurdle, MD, PhD (PI)=&amp;gt; john.hurdle@utah.edu &lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://www.bmi.utah.edu/ UU Biomedical Informatics Website] &lt;br /&gt;
&lt;br /&gt;
    Postdoctoral Fellowship in clinical NLP (one year, possibly two)&lt;br /&gt;
    Salary is based on NIH postdoctoral pay scales (see [http://grants.nih.gov/grants/guide/notice-files/NOT-OD-07-057.html NIH postdoc stipends])&lt;br /&gt;
&lt;br /&gt;
In an effort to improve clinical NLP, the POET project researches ways to preprocess raw clinical text into a form amenable for high-level NLP systems. This postdoctoral fellowship offers an opportunity to play a substantial role in the development of advanced technologies for resolving clinical short forms (e.g., abbreviations and shorthand); to  re-write templated text; and to formally explore clinical sub-languages. The recipient of the fellowship, funded under an a grant from the NIH, will be expected to add his/her own research project to the over goals of POET and will be mentored in 1) clinical NLP in a high-performance, clustered computing environment; 2) in preparing manuscripts for publication; 3) and in biomedical informatics grant writing (with a special focus on the NIH K99/R00 grant process).&lt;br /&gt;
&lt;br /&gt;
POET is being built around a UIMA pipeline architecture and is implemented on a small, dedicated, HIPAA-compliant high-performance compute cluster (56 cores and counting…). POET currently has access to &amp;gt;700,000 clinical notes spanning multiple clinical disciplines and clinical settings from two different healthcare networks.&lt;br /&gt;
&lt;br /&gt;
Qualifications: PhD-level experience in natural language processing is a must.  An NLP focus in biomedical NLP experience is desired but not mandatory, as is some experience in machine learning techniques. UIMA experience is a definite plus. For more information on POET, query grant number &amp;quot;1R21LM009967-01&amp;quot; at [http://crisp.cit.nih.gov/crisp/crisp_query.generate_screen NIH grant queries]&lt;br /&gt;
&lt;br /&gt;
If you are interested AND if you will have in your PhD in-hand by the time you start the fellowship (can start ASAP, position open till filled), then please send your CV and a statement of research interests to the contact for Jo Ann Thompson above.&lt;br /&gt;
&lt;br /&gt;
The University of Utah is committed to policies of equal opportunity and nondiscrimination. The University pursues a vigorous program of affirmative action in all classifications of employment in order to prevent any form of discrimination, harassment, or prejudicial treatment on the basis of race, color, religion, national origin, sex, age, sexual orientation, status as a disabled individual, disabled veteran, or veteran of the Vietnam Era.&lt;br /&gt;
&lt;br /&gt;
== Research Programmer, University of Illinois, Urbana, Illinois  ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; University of Illinois, Urbana, Illinois&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Research Programmer&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Natural Language Processing, Machine Learning, Web Programming&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; July 10, 2009-&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; June 21, 2009&lt;br /&gt;
* &#039;&#039;&#039;Contact:&#039;&#039;&#039; Jennifer Dittmar at 217-244-6241 &lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://www.cs.uiuc.edu/join/aponlap.html] &lt;br /&gt;
&lt;br /&gt;
    Visiting Research Programmer&lt;br /&gt;
    Department of Computer Science&lt;br /&gt;
    University of Illinois Urbana-Champaign&lt;br /&gt;
    Extended and Revised Search&lt;br /&gt;
&lt;br /&gt;
The Department of Computer Science is seeking a Visiting Research Programmer to take part in the development of Natural Language Processing and Machine Learning technologies embedded in a Web-based application.&lt;br /&gt;
&lt;br /&gt;
This position requires knowledge in one or more of the following: information retrieval techniques and tools, natural language processing, language models, machine learning techniques, and web programming (e.g., browsers plug-ins). Algorithmic maturity and experience dealing with large amounts of data are essential. Outstanding attention to detail is required, along with strong written and verbal communication skills and the ability to quickly learn new technologies. The Visiting Research Programmer will join the Cognitive Computation Group led by Prof. Dan Roth, to work on a standalone project with possibilities for commercialization.&lt;br /&gt;
&lt;br /&gt;
Job Duties include:&lt;br /&gt;
&lt;br /&gt;
    * Designing and implementing algorithms, software systems and user interfaces&lt;br /&gt;
    * Writing design documents and code documentation&lt;br /&gt;
    * Interacting with other group members and presenting technical information&lt;br /&gt;
&lt;br /&gt;
A minimum of a Bachelor&#039;s degree in Computer Science or a related field is required. Individuals with a more advanced degree are encouraged to apply and salary will be commensurate with level of education and experience. This position will be available as soon as possible after the closing date, and is a 12-month, temporary, full-time academic professional appointment with standard University benefits with the possibility of becoming permanent at a future date. Salary is commensurate with education and experience. For full consideration, applications should be received by 7/10/09. Applicants may be interviewed before the closing date; however, no hiring decision will be made until after that date.&lt;br /&gt;
&lt;br /&gt;
To apply, please submit your application online at: http://www.cs.uiuc.edu/join/aponlap.html.&lt;br /&gt;
&lt;br /&gt;
If you do not have Internet access, please call Jennifer Dittmar at 217-244-6241 to make other arrangements for submitting your application. Refer to search #12309 in all communications.&lt;br /&gt;
&lt;br /&gt;
Minorities, women, and other designated class members are encouraged to apply.&lt;br /&gt;
&lt;br /&gt;
The University of Illinois is an Affirmative Action-Equal Opportunity Employer.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Postdoc or doctoral research assistant, Bremen University, Bremen, Germany  ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; Bremen University, Bremen, Germany&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Research assistant (Postdoc or doctoal level)&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Dialogue Systems and Human-Robot Interaction&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; June 15, 2009&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; May 17, 2009&lt;br /&gt;
* &#039;&#039;&#039;Contact:&#039;&#039;&#039; John Bateman &amp;lt;bateman@uni-NOSPAM-bremen.de&amp;gt; [remove 6 chars]&lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://www.diaspace.uni-bremen.de | Research Position] &lt;br /&gt;
&lt;br /&gt;
The I5-DiaSpace project of the Collaborative Research Center on&lt;br /&gt;
Spatial Cognition in Bremen, N. Germany, is looking for a&lt;br /&gt;
computational linguistic or informatics PhD or Postdoc researcher&lt;br /&gt;
ready and willing to take on the further development of our&lt;br /&gt;
information-state based dialogue system. The system backbone is&lt;br /&gt;
implemented in Java with plug-ins to state of the art natural language&lt;br /&gt;
analysis, generation, dialogue management, and knowledge&lt;br /&gt;
representation components. The system offers an outstanding foundation&lt;br /&gt;
for carrying out further research at both doctoral and postdoc&lt;br /&gt;
levels. The successful applicant will be expected to take over&lt;br /&gt;
responsibility for system design and implementation, and so excellent&lt;br /&gt;
programming skills will be crucial. The selection of research topic&lt;br /&gt;
within the general area of dialogue systems is open to negotiation,&lt;br /&gt;
although spatially-situated dialogue with autonomous systems including&lt;br /&gt;
robots is one of the demonstration areas that we cover. The position&lt;br /&gt;
is to be filled as quickly as possible.&lt;br /&gt;
&lt;br /&gt;
The Natural Language Interaction Group at Bremen is a highly&lt;br /&gt;
multidisciplinary team combining discourse analysts, psycholinguists,&lt;br /&gt;
computational linguists and ontological engineers. We work in close&lt;br /&gt;
cooperation with several projects within the Collaborative Research&lt;br /&gt;
Center, which spans cognitive science, neurocognition, perception,&lt;br /&gt;
formal spatial calculi, architecture, and AI. The environment is&lt;br /&gt;
highly international and at the cutting edge of several related&lt;br /&gt;
disciplines. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Requirements:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
:&amp;amp;#8226; completed first degree in computational linguistics, artificial intelligence, linguistics, informatics or similar&lt;br /&gt;
:&amp;amp;#8226;  interest in dialogue&lt;br /&gt;
:&amp;amp;#8226;  very good programming skills (necessarily Java; Lisp, Perl, etc. advantageous)&lt;br /&gt;
:&amp;amp;#8226;  good English writing skills&lt;br /&gt;
:&amp;amp;#8226;  ability to work both independently and in a team  in a  multidisciplinary environment  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Approximate salary:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Payment is according to the German Federal pay scale (TV-L 13,&lt;br /&gt;
approx. 34,000 Euros annually). The position is full-time.&lt;br /&gt;
&lt;br /&gt;
Interested applicants should send their CV and any supporting&lt;br /&gt;
information or further queries to John Bateman at the above contact&lt;br /&gt;
address. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Scientist I, J.D. Power and Associates, Boulder, CO ==&lt;br /&gt;
&lt;br /&gt;
{|&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Employer:&#039;&#039;&#039;         ||Web Intelligence Division, J.D. Power and Associates (McGraw-Hill)&lt;br /&gt;
|-&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Title, Rank:&#039;&#039;&#039;      ||Scientist I.&lt;br /&gt;
|-&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Specialty:&#039;&#039;&#039;        ||Machine Learning, Computational Linguistics, Natural Language Processing.&lt;br /&gt;
|-&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Location:&#039;&#039;&#039;         ||Boulder, Colorado.&lt;br /&gt;
|-&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Start date:&#039;&#039;&#039;       ||The position is available immediately.&lt;br /&gt;
|-&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Date Posted:&#039;&#039;&#039;      ||May 1st, 2009.&lt;br /&gt;
|-&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Links to website:&#039;&#039;&#039; ||http://jdpowerwebintelligence.com&lt;br /&gt;
|-&lt;br /&gt;
| &#039;&#039;&#039;&amp;amp;#8226; Contact:&#039;&#039;&#039;          ||Nicolas Nicolov &amp;lt;nicolas_nicolovNOSPAM@jdpa.com&amp;gt; [remove six chars]&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
J.D.Power and Associates is growing and hiring top-notch scientists to develop cutting-edge web mining technology. Our science team is working on advanced text analysis of vast amounts of data, scalable information retrieval, learning semantic concepts and lots of cool new stuff.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Requirements:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
:&amp;amp;#8226; Recent Ph.D. in Machine Learning, Computational Linguistics, Artificial Intelligence, Computer Science or equivalent.&lt;br /&gt;
:&amp;amp;#8226; Strong statistical, natural language processing, machine learning background with emphasis on coreference, meronymy, dependency parsing, sentiment/opinion analysis, text clustering and categorization, graph analysis.&lt;br /&gt;
:&amp;amp;#8226; Experience with scientific computing on large datasets, natural language processing, information extraction, information retrieval, multilingual datasets, distributed systems is a plus.&lt;br /&gt;
:&amp;amp;#8226; Strong experience with C++/Java, Scala/Ruby/Python development of large software systems, Linux/Windows environments.&lt;br /&gt;
:&amp;amp;#8226; Proven track record of publications/patents preferred.&lt;br /&gt;
:&amp;amp;#8226; Multilingual processing is a plus.&lt;br /&gt;
:&amp;amp;#8226; Strong verbal and written communication skills; UML, LaTEX, beamer.&lt;br /&gt;
:&amp;amp;#8226; At least 4 years of research experience (relevant university experience - ok).&lt;br /&gt;
:&amp;amp;#8226; Enthusiasm for solving challenging problems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Research Position in Computational Linguistics at Austrian Research Institute for AI (OFAI), Vienna ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; OFAI, Vienna, Austria&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Researcher&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Computational Linguistics&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; April 15, 2009&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; March 30, 2009&lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://www.ofai.at/research/nlu/] &lt;br /&gt;
&lt;br /&gt;
The Austrian Research Institute for Artificial Intelligence (OFAI)&lt;br /&gt;
in Vienna, Austria offers two research positions in its Language&lt;br /&gt;
Technology group.&lt;br /&gt;
&lt;br /&gt;
Candidates are expected to have a degree in computational linguistics&lt;br /&gt;
or computer science with a background in language technology.&lt;br /&gt;
She/he will be an open minded team worker, who is able&lt;br /&gt;
to work creatively in an interdisciplinary context. She/he will have&lt;br /&gt;
good programming skills and be able to flexibly use different&lt;br /&gt;
programming languages. She/he likes to to work in a research environment&lt;br /&gt;
constantly learning and developing fresh concepts and ideas.&lt;br /&gt;
Publishing research results is part of the job and actively encouraged.&lt;br /&gt;
The successful candidates will have a strong background in one or more of&lt;br /&gt;
the following areas: ontology engineering, semantic systems, text mining&lt;br /&gt;
and machine learning.&lt;br /&gt;
&lt;br /&gt;
Fluency in English is expected.&lt;br /&gt;
&lt;br /&gt;
Both positions are in the framework of a project aiming at advancing&lt;br /&gt;
speech recognition by the integration of (context-dependent) semantic&lt;br /&gt;
knowledge. The project is ongoing and will continue until April 2010.&lt;br /&gt;
&lt;br /&gt;
Contracts will be for the duration of the project.&lt;br /&gt;
Continued employment after the end of the project is possible.&lt;br /&gt;
&lt;br /&gt;
Depending on academic credentials and experience of the candidate,&lt;br /&gt;
the yearly gross salary will be in the range of EUR 42000 - 54000.&lt;br /&gt;
&lt;br /&gt;
Both positions are to be filled asap.&lt;br /&gt;
&lt;br /&gt;
Please mail applications including a CV to Harald Trost &amp;lt;harald.trost@ofai.at&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Postdoctoral Fellowship at the Institut de Recherche en Informatique de Toulouse (IRIT) Université de Toulouse 3==&lt;br /&gt;
&lt;br /&gt;
Subject : Applying learning techniques to discourse analysis&lt;br /&gt;
&lt;br /&gt;
Période : 12 months, September 2009 -&amp;gt; August 2010&lt;br /&gt;
&lt;br /&gt;
Context :&lt;br /&gt;
This postdoctoral fellowship, is part of the ANR project&lt;br /&gt;
ANNODIS, which includes the labs: IRIT (Université de Toulouse 3), CLLE (Université &lt;br /&gt;
de Toulouse 2), and GREYC Université de Caen).  The goal of this project is to &lt;br /&gt;
build a corpus of French texts annotated with discourse structure at several levels.  The project also has the goal of providing automatic and semi-automatic tools for helping with this task.&lt;br /&gt;
&lt;br /&gt;
The postdoctoral fellow will be a member of the IRIT lab at l&#039;université de Toulouse 3, Toulouse, in the research group Lilac under the direction of&lt;br /&gt;
Nicholas Asher.&lt;br /&gt;
&lt;br /&gt;
Objectives :&lt;br /&gt;
Based on the data culled from the manual annotation of our corpus, the first objective of the postdoctoral fellow will be to design and supervise experiments for the automatic recovery of the discourse structure of a text and to evaluate the feasibility of semi supervised and supervised learning strategies given the data in the corpus.  A discourse structure is a graph where the nodes are text segments and the arcs are discourse relations.  Thus, the extraction task  has three stages: 1) finding the segments, 2) determining the attachment points for segments in the graph et 3) determining the discourse relation or relations between the attached segments.&lt;br /&gt;
&lt;br /&gt;
The postdoctoral fellow will also be in charge of the final collection and organization of the manual annotation data.&lt;br /&gt;
&lt;br /&gt;
Candidate should have:&lt;br /&gt;
- a Ph.D.&lt;br /&gt;
- competence in NLP and/or information extraction, and automated learning methods.&lt;br /&gt;
&lt;br /&gt;
A familiarity with theories of discourse structure would be a Plus.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Salary: 3000 euro per month&lt;br /&gt;
&lt;br /&gt;
Candidates should send a dossier with a detailed CV (pdf) by email to:&lt;br /&gt;
 asher@irit.fr AND muller@irit.fr.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Post-Doctoral Position in Computational Linguistics at Uppsala University ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; Uppsala University, Sweden&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Research Fellow&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Computational Linguistics&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; April 24, 2009&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; March 17, 2009&lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://stp.lingfil.uu.se/~nivre/docs/PostdocUU.pdf | Post-Doc Position] &lt;br /&gt;
&lt;br /&gt;
This is a full-time, limited-term position that can maximally be extended up to four&lt;br /&gt;
years. The position involves a small amount of teaching and supervision but is mainly&lt;br /&gt;
devoted to research. The deadline for applications is April 14, 2009. For more&lt;br /&gt;
information, contact Joakim Nivre &amp;lt;joakim.nivre@lingfil.uu.se&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Research Positions, Human Language Technology Center of Excellence ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; Human Language Technology Center of Excellence (at Johns Hopkins University)&lt;br /&gt;
* &#039;&#039;&#039;Titles:&#039;&#039;&#039; Postdoctoral researchers, research staff, professors on sabbaticals, visiting scientists &lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Speech and Natural Language Processing&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; April 1, 2009&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; March 12, 2009&lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://web.jhu.edu/HLTCOE/opportunities.html | Research Position] &lt;br /&gt;
&lt;br /&gt;
The Human Language Technology Center of Excellence (COE) at the Johns Hopkins University is seeking to hire outstanding Ph.D. researchers in the field of speech and natural language processing. The COE seeks the most talented candidates for both junior and senior level positions including, but not limited to, full-time research staff, professors on sabbaticals, visiting scientists and post-docs. Candidates will be expected to work in a team setting with other researchers and graduate students at the Johns Hopkins University, the University of Maryland College Park and other affiliated institutions.&lt;br /&gt;
&lt;br /&gt;
Candidates should have a strong background in one of the following areas:&lt;br /&gt;
&lt;br /&gt;
- NATURAL LANGUAGE PROCESSING: Information extraction, knowledge distillation, machine translation, semantic annotation, text processing, etc.&lt;br /&gt;
&lt;br /&gt;
- SPEECH PROCESSING: Robust speech recognition across language channel, formal vs. informal genres, speaker identification, language identification, speech retrieval, spoken term detection, etc.&lt;br /&gt;
&lt;br /&gt;
- MACHINE LEARNING: Learning on very large datasets and streams for text and/or speech, feature extraction, domain adaptation, semi-supervised learning&lt;br /&gt;
&lt;br /&gt;
The COE was founded in January 2007 and has a long-term research contract as an independent center within Johns Hopkins University. Located next to Johns Hopkins’ Homewood Campus in Baltimore, Maryland, the COE’s distinguished contract partners include the University of Maryland College Park, the Johns Hopkins University Applied Physics Lab, and BBN Technologies of Cambridge, Massachusetts.  World-class researchers at the COE focus on fundamental challenge problems critical to finding solutions for real-world problems of importance to our government sponsor. The COE offers substantial computing capability for research that requires heavy computation and massive storage. In the summer of 2009, the COE will hold its first annual Summer Camp for Advanced Language Exploration (SCALE), inviting the best and brightest researchers to work on common areas in speech and NLP. Researchers are expected to publish in peer-reviewed venues.&lt;br /&gt;
&lt;br /&gt;
Applicants should have earned a Ph.D. in Computer Science or a closely related field. Applicants should submit a curriculum vitae, research statement, names and addresses of at least four references, and an optional teaching statement. Please send applications and inquiries about the position to hltcoe-hiring@jhu.edu.&lt;br /&gt;
&lt;br /&gt;
While applications will be evaluated as received until the position is filled, applicants are strongly encouraged to indicate intent to apply by contacting the center before April 1, 2009. U.S. Citizenship is required and applicants should note citizenship status on their application. Additionally, security clearance is required and the COE will seek a clearance for those who do not already have one. The Johns Hopkins University is an equal opportunity employer and has a smoke-free environment.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Chair and Lectureship in Computing Science, Aberdeen ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; University of Aberdeen&lt;br /&gt;
* &#039;&#039;&#039;Titles:&#039;&#039;&#039; Chair (full professor), Lecturer (assistant professor)&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; See full adverts. Areas include multi-modal interaction and natural language generation&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; April 13, 2009&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; February 26, 2009&lt;br /&gt;
* &#039;&#039;&#039;Links to website:&#039;&#039;&#039; [http://www.abdn.ac.uk/jobs/display.php?recordid=NAT016A | Chair position] [http://www.abdn.ac.uk/jobs/display.php?recordid=NAT017A | Lectureship position] [http://www.csd.abdn.ac.uk/research | Research at Aberdeen]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Natural Language Generation Group, The Open University: Research Associate, Text-to-Text Generation/Dialogue ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; The Open University&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Research Associate&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Text-to-Text Generation/Dialogue&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; February 15, 2009&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; February 3, 2009&lt;br /&gt;
* &#039;&#039;&#039;Link to website:&#039;&#039;&#039; [http://www3.open.ac.uk/employment/job-details.asp?id=4373&amp;amp;ref=ext| job details and application form]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== National Research Council of Canada: Research Officer, Statistical Semantics ==&lt;br /&gt;
&lt;br /&gt;
* &#039;&#039;&#039;Employer:&#039;&#039;&#039; National Research Council of Canada&lt;br /&gt;
* &#039;&#039;&#039;Title:&#039;&#039;&#039; Research Officer&lt;br /&gt;
* &#039;&#039;&#039;Specialty:&#039;&#039;&#039; Statistical Semantics (2 positions)&lt;br /&gt;
* &#039;&#039;&#039;Deadline:&#039;&#039;&#039; Posted until filled&lt;br /&gt;
* &#039;&#039;&#039;Date Posted:&#039;&#039;&#039; January 20, 2009&lt;br /&gt;
* &#039;&#039;&#039;Link to website:&#039;&#039;&#039; [http://careers-carrieres.nrc-cnrc.gc.ca/careers/jobpost.nsf/EnglishAll/187241FAD78497FC85257540005E75CA Research Officer, Statistical Semantics (2 positions)]&lt;br /&gt;
&lt;br /&gt;
The Institute for Information Technology at the National Research Council of Canada has openings for two Research Officers to work in the area of statistical semantics, a sub-field of statistical natural language processing. These two positions are full-time and continuing.  They are based in Ottawa, Ontario. The successful candidates will perform original research that contributes to the Institute&#039;s focus on language processing, text mining, and machine translation.  They will, in collaboration with other researchers and programmers, create prototypes of their work and publish their research results in highly-cited journals and conferences. The position offers the opportunity to collaborate with colleagues, university researchers, and industrial partners.&lt;br /&gt;
&lt;br /&gt;
The researchers will work in a results-driven environment and will have the opportunity to apply their research results to ongoing high profile projects, such as processing of textual medical records or performing machine translation.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Postdoctoral and research engineer positions available at the Singapore Management University ==&lt;br /&gt;
&lt;br /&gt;
The School of Information Systems at the Singapore Management University is seeking to fill a few postdoctoral and research engineer positions for the projects &amp;quot;Transfer Learning for Adaptive Relation Extraction&amp;quot; and &amp;quot;Mining Interaction Behaviors from Information Exchange Networks.&amp;quot;  These are two-year projects supported by the Singapore Defense Science Organization, starting in April 2009. &lt;br /&gt;
&lt;br /&gt;
The goal of the first project is to develop adaptive learning algorithms for relation extraction from free text. In real applications of relation extraction, there is often insufficient training data available for the target relations in the target domain, but labeled data from related domains or for related relation types can be borrowed. The research questions to be answered are therefore (1) how existing transfer learning algorithms can be applied in the particular context of relation extraction, (2) how human knowledge can be incorporated, and (2) what new transfer learning techniques are needed for adaptive relation extraction.&lt;br /&gt;
&lt;br /&gt;
The goal of the second project is to study characterization and measurement of interaction behaviors in information exchange networks based on user-generated interaction data.  We will focus on information exchange networks which involve actors sending information to one another.  Examples of such networks include email and blog networks. The research will focus on interaction behaviors that suggest actor roles in an information exchange network and may infer relationships between actors in the network.&lt;br /&gt;
&lt;br /&gt;
The postdoctoral candidate must have completed all requirements for his/her PhD degree by the time of appointment. The research engineer candidate must have completed a good undergraduate or master degree in computer science or computer engineering.  The ideal candidates are expected to have the following skills/qualifications:&lt;br /&gt;
&lt;br /&gt;
  - Knowledge and experience in machine learning, data mining and statistics/probabilities&lt;br /&gt;
  - Strong programming skills&lt;br /&gt;
  - Proficiency in English&lt;br /&gt;
&lt;br /&gt;
For the first project, we also prefer candidates with&lt;br /&gt;
&lt;br /&gt;
  - Knowledge and experience in natural language processing&lt;br /&gt;
  - Experience with information extraction, transfer learning and/or semi-supervised learning is a plus&lt;br /&gt;
&lt;br /&gt;
For the second project, we also prefer candidates with&lt;br /&gt;
&lt;br /&gt;
  - Knowledge in social network analysis and web mining&lt;br /&gt;
&lt;br /&gt;
The salary for the postdoctoral position will be around 5,000 SGD per month.  The salary for the research engineer position will be based on the candidate’s working experience and academic degree.&lt;br /&gt;
&lt;br /&gt;
To apply for the positions, send your full CV with list of publications, names and contact information of two referees, a statement of research qualifications and interests, and two sample publications (if any) to the following principle investigators: &lt;br /&gt;
&lt;br /&gt;
  1. Transfer Learning for Adaptive Relation Extraction: Jing Jiang (jingjiang@smu.edu.sg). &lt;br /&gt;
  2. Mining Interaction Behaviors from Information Exchange Networks: Ee-Peng Lim (eplim@smu.edu.sg).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Tenure Track Faculty Position: Assistant/Associate Professor in Human Computer Interaction, Montclair State University, NJ, USA ==&lt;br /&gt;
&lt;br /&gt;
 Vacancy #: 	 	VF-22&lt;br /&gt;
 Department:	 	Computer Science&lt;br /&gt;
 &lt;br /&gt;
The Department of Computer Science invites applications for a tenure track position in Human Computer Interaction (HCI) and Visualization. The Department’s 13 faculty members support the BS in Computer Science with an ABET CAC accredited track, the BS in Information Technology and the MS in Computer Science. The position requires a willingness to teach a variety of computer science and information technology courses at all levels to ethnically diverse students. The position entails the ability to work as a member of interdisciplinary teams as the Department develops and modifies computing undergraduate and graduate programs with a planned doctoral program in computational science. In addition, the successful candidate will develop and maintain an active research program with student involvement.&lt;br /&gt;
 &lt;br /&gt;
Qualifications &amp;amp; Requirements:	 	Candidates must have a Ph.D. in computer Science or a very closely related discipline. Candidates must have expertise in Human Computer Interaction with preference to candidates with experience in software engineering, interfaces, and visualization, and research in HCI. Candidates must have good communication skills. We are looking for candidates with experience in teaching undergraduate computing courses and in working as a member of a team. All faculty are expected to have an ongoing research program, to commit to quality teaching, to be involved in professional activities, and to pursue external funding to support their scholarship.&lt;br /&gt;
 &lt;br /&gt;
 Salary Range:             Salary and range is dependent on qualifications.&lt;br /&gt;
 Anticipated Start Date:   September 1, 2009&lt;br /&gt;
&lt;br /&gt;
Send letter and resume to (include vacancy # if above):	&lt;br /&gt;
Send hardcopy (no email documents) that includes C.V., at least three professional references, statement of research interests, teaching philosophy with experience, and professional goals to:&lt;br /&gt;
&lt;br /&gt;
Search Committee — V- F22&lt;br /&gt;
Department of Computer Science&lt;br /&gt;
Montclair State University&lt;br /&gt;
Montclair, NJ 07043&lt;br /&gt;
&lt;br /&gt;
(include V number) and professional goals to:&lt;br /&gt;
Search Committee — V- F22&lt;br /&gt;
Department of Computer Science&lt;br /&gt;
Montclair State University&lt;br /&gt;
Montclair, NJ 07043&lt;br /&gt;
&lt;br /&gt;
Apply By: Screening begins immediately and continues until the position is filled.&lt;br /&gt;
&lt;br /&gt;
Montclair State is a New Jersey State university. It is located 14 miles west of New York City.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Internship on Textual Entailment Applied to Statistical Machine Translation, Xerox Research Centre Europe, Grenoble - France ==&lt;br /&gt;
&lt;br /&gt;
The main research lines within the Cross Language Technologies (CLT) area at XRCE are Statistical Machine Translation, Cross-Lingual Information Retrieval and Machine Learning Techniques for Cross-Lingual Applications. CLT is currently coordinating the European Project SMART (Statistical Multilingual Analysis for Retrieval and Translation) [http://www.smart-project.eu]. &lt;br /&gt;
&lt;br /&gt;
XRCE has received funding from the PASCAL-2 Network of Excellence [http://pascallin2.ecs.soton.ac.uk] for conducting, in partnership with Bar-Ilan University in Israel, a &amp;quot;Pump Priming&amp;quot; project on the topic of &amp;quot;Context Models for Textual Entailment and their Application to Statistical Machine Translation&amp;quot;. One of the goals of the project is to investigate situations in which, while a translation system may not have enough knowledge to adequately translate a source text into a target text, it may be able to do so based on entailment rules learned from monolingual data. &lt;br /&gt;
&lt;br /&gt;
We are looking for preferably one (in this case the internship would be for 10 months ) or two interns (in this case each internship would last 5 months with the first starting at the beginning of 2009) to work on this topic under the supervision of XRCE researchers, and in collaboration with our partners. The focus of the work will be on the following topics: &lt;br /&gt;
&lt;br /&gt;
* Integration of existing paraphrase and entailment resources into SMT settings, and assessment of their applicability in this domain; &lt;br /&gt;
* Development (in collaboration with our partners) of novel models for assessing the validity of entailment rules in context and implementation of SMT-based modules that are able to exploit such rules; &lt;br /&gt;
* Methodology and measures for controlling the use of directional and bi-directional entailment rules in SMT; &lt;br /&gt;
* Use of entailment knowledge for evaluating the performance of SMT systems. &lt;br /&gt;
&lt;br /&gt;
The ideal candidate will be a strong Master or Ph.D. student with background in statistical machine translation and/or statistical methods in NLP. The candidate will be fluent in C/C++ and/or Python. Some knowledge and practice of Machine Learning models and tools will be a plus, as will be some previous acquaintance with work on Textual Entailment.&lt;br /&gt;
&lt;br /&gt;
Contact: &lt;br /&gt;
&lt;br /&gt;
* Lucia Specia: lucia.specia@xrce.xerox.com &lt;br /&gt;
* Marc Dymetman: marc.dymetman@xrce.xerox.com &lt;br /&gt;
&lt;br /&gt;
For more information: http://www.xrce.xerox.com/internships/LS-MD.TE-SMT_2009.2008.html&lt;/div&gt;</summary>
		<author><name>Oe</name></author>
	</entry>
</feed>