@InProceedings{emnlp17forums,
  author    = {Greg Durrett  and  Jonathan K. Kummerfeld  and  Taylor Berg-Kirkpatrick  and  Rebecca S. Portnoff  and  Sadia Afroz  and  Damon McCoy  and  Kirill Levchenko  and  and Vern Paxson},
  title     = {Identifying Products in Online Cybercrime Marketplaces: A Dataset for Fine-grained Domain Adaptation},
  booktitle = {Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing},
  shortvenue = {EMNLP},
  year      = {2017},
  month     = {September},
  address   = {Copenhagen, Denmark},
  publisher = {Association for Computational Linguistics},
  url       = {https://www.aclweb.org/anthology/D17-1275},
  pages     = {2588--2597},
  abstract  = {One weakness of machine-learned NLP models is that they typically perform poorly on out-of-domain data. In this work, we study the task of identifying products being bought and sold in online cybercrime forums, which exhibits particularly challenging cross-domain effects.  We formulate a task that represents a hybrid of slot-filling information extraction and named entity recognition and annotate data from four different forums.  Each of these forums constitutes its own "fine-grained domain" in that the forums cover different market sectors with different properties, even though all forums are in the broad domain of cybercrime. We characterize these domain differences in the context of a learning-based system: supervised models see decreased accuracy when applied to new forums, and standard techniques for semi-supervised learning and domain adaptation have limited effectiveness on this data, which suggests the need to improve these techniques. We release a dataset of 1,938 annotated posts from across the four forums.},
  software  = {https://evidencebasedsecurity.org/forums/},
}

      

One weakness of machine-learned NLP models is that they typically perform poorly on out-of-domain data. In this work, we study the task of identifying products being bought and sold in online cybercrime forums, which exhibits particularly challenging cross-domain effects. We formulate a task that represents a hybrid of slot-filling information extraction and named entity recognition and annotate data from four different forums. Each of these forums constitutes its own “fine-grained domain” in that the forums cover different market sectors with different properties, even though all forums are in the broad domain of cybercrime. We characterize these domain differences in the context of a learning-based system: supervised models see decreased accuracy when applied to new forums, and standard techniques for semi-supervised learning and domain adaptation have limited effectiveness on this data, which suggests the need to improve these techniques. We release a dataset of 1,938 annotated posts from across the four forums.

@InProceedings{acl17paraphrase,
  author    = {Youxuan Jiang  and  Jonathan K. Kummerfeld  and  Walter S. Lasecki},
  title     = {Understanding Task Design Trade-offs in Crowdsourced Paraphrase Collection},
  booktitle = {Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)},
  shortvenue = {ACL (short)},
  month     = {July},
  year      = {2017},
  address   = {Vancouver, Canada},
  pages     = {103--109},
  abstract  = {Linguistically diverse datasets are critical for training and evaluating robust machine learning systems, but data collection is a costly process that often requires experts. Crowdsourcing the process of paraphrase generation is an effective means of expanding natural language datasets, but there has been limited analysis of the trade-offs that arise when designing tasks. In this paper, we present the first systematic study of the key factors in crowdsourcing paraphrase collection. We consider variations in instructions, incentives, data domains, and workflows. We manually analyzed paraphrases for correctness, grammaticality, and linguistic diversity. Our observations provide new insight into the trade-offs between accuracy and diversity in crowd responses that arise as a result of task design, providing guidance for future paraphrase generation procedures.},
  url       = {http://aclweb.org/anthology/P17-2017},
  data      = {http://aclweb.org/anthology/attachments/P/P17/P17-2017.Datasets.zip},
  video     = {https://vimeo.com/234958413},
}

      

Linguistically diverse datasets are critical for training and evaluating robust machine learning systems, but data collection is a costly process that often requires experts. Crowdsourcing the process of paraphrase generation is an effective means of expanding natural language datasets, but there has been limited analysis of the trade-offs that arise when designing tasks. In this paper, we present the first systematic study of the key factors in crowdsourcing paraphrase collection. We consider variations in instructions, incentives, data domains, and workflows. We manually analyzed paraphrases for correctness, grammaticality, and linguistic diversity. Our observations provide new insight into the trade-offs between accuracy and diversity in crowd responses that arise as a result of task design, providing guidance for future paraphrase generation procedures.

@InProceedings{www17forums,
  title     = {Tools for Automated Analysis of Cybercriminal Markets},
  author    = {Rebecca S. Portnoff  and  Sadia Afroz  and  Greg Durrett  and  Jonathan K. Kummerfeld  and  Taylor Berg-Kirkpatrick  and  Damon McCoy  and  Kirill Levchenko  and  Vern Paxson},
  booktitle = {Proceedings of 26th International World Wide Web conference},
  shortvenue = {WWW},
  month     = {April},
  year      = {2017},
  address   = {Perth, Australia},
  url       = {http://www.jkk.name/pub/www17forums.pdf},
  software  = {http://evidencebasedsecurity.org/forums/},
  abstract  = {Underground forums are widely used by criminals to buy and sell a host of stolen items, datasets, resources, and criminal services.  These forums contain important resources for understanding cybercrime.  However, the number of forums, their size, and the domain expertise required to understand the markets makes manual exploration of these forums unscalable. In this work, we propose an automated, top-down approach for analyzing underground forums.  Our approach uses natural language processing and machine learning to automatically generate high-level information about underground forums, first identifying posts related to transactions, and then extracting products and prices. We also demonstrate, via a pair of case studies, how an analyst can use these automated approaches to investigate other categories of products and transactions. We use eight distinct forums to assess our tools: Antichat, Blackhat World, Carders, Darkode, Hack Forums, Hell, L33tCrew and Nulled. Our automated approach is fast and accurate, achieving over 80% accuracy in detecting post category, product, and prices.},
}

      

Underground forums are widely used by criminals to buy and sell a host of stolen items, datasets, resources, and criminal services. These forums contain important resources for understanding cybercrime. However, the number of forums, their size, and the domain expertise required to understand the markets makes manual exploration of these forums unscalable. In this work, we propose an automated, top-down approach for analyzing underground forums. Our approach uses natural language processing and machine learning to automatically generate high-level information about underground forums, first identifying posts related to transactions, and then extracting products and prices. We also demonstrate, via a pair of case studies, how an analyst can use these automated approaches to investigate other categories of products and transactions. We use eight distinct forums to assess our tools: Antichat, Blackhat World, Carders, Darkode, Hack Forums, Hell, L33tCrew and Nulled. Our automated approach is fast and accurate, achieving over 80% accuracy in detecting post category, product, and prices.

Ethical issues of research using datasets of illicit origin, Sergio Pastrana Alice Hutchings Richard Clayton Daniel R. Thomas, Alastair R. Beresford, IMC, 2017

@InProceedings{tacl17parsing,
  author    = {Jonathan K. Kummerfeld  and  Dan Klein},
  title     = {Parsing with Traces: An O($n^4$) Algorithm and a Structural Representation},
  booktitle = {Transactions of the Association for Computational Linguistics},
  shortvenue = {TACL},
  year      = {2017},
  abstract  = {General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons.  We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In particular, we consider directed, acyclic, one-endpoint-crossing graph structures, which cover most long-distance dislocation, shared argumentation, and similar tree-violating linguistic phenomena. We describe how to convert phrase structure parses, including traces, to our new representation in a reversible manner. Our dynamic program uniquely decomposes structures, is sound and complete, and covers 97.3% of the Penn English Treebank. We also implement a proofof-concept parser that recovers a range of null elements and trace types.},
  url       = {http://aclweb.org/anthology/Q17-1031},
  software  = {https://github.com/jkkummerfeld/1ec-graph-parser},
  interview = {https://soundcloud.com/nlp-highlights/46-parsing-with-traces-with-jonathan-kummerfeld},
}

      

General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In particular, we consider directed, acyclic, one-endpoint-crossing graph structures, which cover most long-distance dislocation, shared argumentation, and similar tree-violating linguistic phenomena. We describe how to convert phrase structure parses, including traces, to our new representation in a reversible manner. Our dynamic program uniquely decomposes structures, is sound and complete, and covers 97.3% of the Penn English Treebank. We also implement a proofof-concept parser that recovers a range of null elements and trace types.

Exploiting Structure in Parsing to 1-Endpoint-Crossing Graphs, Robin Kurtz, Marco Kuhlmann, IWPT, 2017

@PhDThesis{thesis16parsing,
  title     = {Algorithms for Identifying Syntactic Errors and Parsing with Graph Structured Output},
  author    = {Jonathan K. Kummerfeld},
  year      = {2016},
  month     = {Aug},
  address   = {Berkeley, CA, USA},
  school    = {EECS Department, University of California, Berkeley},
  number    = {UCB/EECS-2016-138},
  url       = {https://www2.eecs.berkeley.edu/Pubs/TechRpts/2016/EECS-2016-138.html},
  abstract  = {Representation of syntactic structure is a core area of research in Computational Linguistics, disambiguating distinctions in meaning that are crucial for correct interpretation of language. Development of algorithms and statistical models over the past three decades has led to systems that are accurate enough to be deployed in industry, playing a key role in products such as Google Search and Apple Siri. However, syntactic parsers today are usually constrained to tree representations of language, and performance is interpreted through a single metric that conveys no linguistic information regarding remaining errors.

  In this dissertation, we present new algorithms for error analysis and parsing. The heart of our approach to error analysis is the use of structural transformations to identify more meaningful classes of errors, and to enable comparisons across formalisms. For parsing, we combine a novel dynamic program with careful choices in syntactic representation to create an efficient parser that produces graph structured output. Together, these developments allowed us to evaluate the outstanding challenges in parsing and to address a key weakness in current work.

  First, we present a search algorithm that, given two structures, finds a sequence of modifications leading from one structure to the other. We applied this algorithm to syntactic error analysis, where one structure is the output of a parser, the other is the correct parse, and each modification corresponds to fixing one error. We constructed a tool based on the algorithm and analyzed variations in behavior between parsers, types of text, and languages. Our observations shine light on several assumptions about syntactic errors, showing some to be true and others to be false. For example, prepositional phrase attachment errors are indeed a major issue, while coordination scope errors do not hurt performance as much as expected.

  Next, we describe an algorithm that builds a parse in one syntactic representation to match a parse in another representation. Specifically, we build phrase structure parses from Combinatory Categorial Grammar derivations. Our approach follows the philosophy of CCG, defining specific phrase structures for each lexical category and generic rules for combinatory steps. The new parse is built by following the CCG derivation bottom-up, gradually building the corresponding phrase structure parse. This produced significantly more accurate parses than past work, and enabled us to compare performance of several parsers across formalisms.

  Finally, we address a weakness we observed in phrase structure parsers: the exclusion of syntactic trace structures for computational convenience. We present an efficient dynamic programming algorithm that constructs the graph structure that has the highest score under an edge-factored scoring function. We define a parse representation compatible with the algorithm, and show how certain linguistic distinctions dramatically impact coverage. We also show various ways to modify the algorithm to improve performance by exploiting properties of observed linguistic structure. This approach to syntactic parsing is the first to cover virtually all structure encoded in the Penn Treebank.},
}

      

Representation of syntactic structure is a core area of research in Computational Linguistics, disambiguating distinctions in meaning that are crucial for correct interpretation of language. Development of algorithms and statistical models over the past three decades has led to systems that are accurate enough to be deployed in industry, playing a key role in products such as Google Search and Apple Siri. However, syntactic parsers today are usually constrained to tree representations of language, and performance is interpreted through a single metric that conveys no linguistic information regarding remaining errors.

In this dissertation, we present new algorithms for error analysis and parsing. The heart of our approach to error analysis is the use of structural transformations to identify more meaningful classes of errors, and to enable comparisons across formalisms. For parsing, we combine a novel dynamic program with careful choices in syntactic representation to create an efficient parser that produces graph structured output. Together, these developments allowed us to evaluate the outstanding challenges in parsing and to address a key weakness in current work.

First, we present a search algorithm that, given two structures, finds a sequence of modifications leading from one structure to the other. We applied this algorithm to syntactic error analysis, where one structure is the output of a parser, the other is the correct parse, and each modification corresponds to fixing one error. We constructed a tool based on the algorithm and analyzed variations in behavior between parsers, types of text, and languages. Our observations shine light on several assumptions about syntactic errors, showing some to be true and others to be false. For example, prepositional phrase attachment errors are indeed a major issue, while coordination scope errors do not hurt performance as much as expected.

Next, we describe an algorithm that builds a parse in one syntactic representation to match a parse in another representation. Specifically, we build phrase structure parses from Combinatory Categorial Grammar derivations. Our approach follows the philosophy of CCG, defining specific phrase structures for each lexical category and generic rules for combinatory steps. The new parse is built by following the CCG derivation bottom-up, gradually building the corresponding phrase structure parse. This produced significantly more accurate parses than past work, and enabled us to compare performance of several parsers across formalisms.

Finally, we address a weakness we observed in phrase structure parsers: the exclusion of syntactic trace structures for computational convenience. We present an efficient dynamic programming algorithm that constructs the graph structure that has the highest score under an edge-factored scoring function. We define a parse representation compatible with the algorithm, and show how certain linguistic distinctions dramatically impact coverage. We also show various ways to modify the algorithm to improve performance by exploiting properties of observed linguistic structure. This approach to syntactic parsing is the first to cover virtually all structure encoded in the Penn Treebank.

@InProceedings{emnlp15learn,
  title     = {An Empirical Analysis of Optimization for Max-Margin NLP},
  author    = {Jonathan K. Kummerfeld  and  Taylor Berg-Kirkpatrick  and  Dan Klein},
  booktitle = {Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing},
  shortvenue = {EMNLP},
  month     = {September},
  year      = {2015},
  address   = {Lisbon, Portugal},
  pages     = {273--279},
  url       = {http://www.jkk.name/pub/emnlp15learn.pdf},
  poster    = {http://www.jkk.name/pub/emnlp15learn_poster.png},
  software  = {https://github.com/tberg12/murphy},
  abstract  = {Despite the convexity of structured max-margin objectives (Taskar et al., 2004; Tsochantaridis et al., 2004), the many ways to optimize them are not equally effective in practice. We compare a range of online optimization methods over a variety of structured NLP tasks (coreference, summarization, parsing, etc) and find several broad trends. First, margin methods do tend to outperform both likelihood and the perceptron. Second, for max-margin objectives, primal  optimization methods are often more robust and progress faster than dual methods. This advantage  is most pronounced for tasks with dense or continuous-valued features. Overall, we argue for a particularly simple online primal subgradient descent method that, despite being rarely mentioned in the literature, is surprisingly effective in relation to its alternatives.},
}

      

Despite the convexity of structured max-margin objectives (Taskar et al., 2004; Tsochantaridis et al., 2004), the many ways to optimize them are not equally effective in practice. We compare a range of online optimization methods over a variety of structured NLP tasks (coreference, summarization, parsing, etc) and find several broad trends. First, margin methods do tend to outperform both likelihood and the perceptron. Second, for max-margin objectives, primal optimization methods are often more robust and progress faster than dual methods. This advantage is most pronounced for tasks with dense or continuous-valued features. Overall, we argue for a particularly simple online primal subgradient descent method that, despite being rarely mentioned in the literature, is surprisingly effective in relation to its alternatives.

Using accelerometers to remotely and automatically characterize behavior in small animals Talisin T. Hammond, Dwight Springthorpe, Rachel E. Walsh, Taylor Berg-Kirkpatrick, Journal of Experimental Biology, 2016

Joint Models for Extracting Adverse Drug Events from Biomedical Text Yue Zhang Meishan Zhang Donghong Ji Fei Li, IJCAI, 2016

A Practical Perspective on Latent Structured Prediction for Coreference Resolution, Iryna Haponchyk, Alessandro Moschitti, EACL, 2017

Fine-Grained Entity Typing with High-Multiplicity Assignments, Maxim Rabinovich, Dan Klein, ACL, 2017

Learning-Based Single-Document Summarization with Compression and Anaphoricity Constraints, Greg Durrett, Taylor Berg-Kirkpatrick, Dan Klein, ACL, 2016

Multi-Task Structured Prediction for Entity Analysis: Search-Based Learning Algorithms, Janardhan Rao Doppa Prasad Tadepalli Hamed Shahbazi Xiaoli Fern Chao Ma, ACML, 2017

@InProceedings{emnlp13analysis,
  title     = {Error-Driven Analysis of Challenges in Coreference Resolution},
  author    = {Jonathan K. Kummerfeld and Dan Klein},
  booktitle = {Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing},
  shortvenue = {EMNLP},
  month     = {October},
  year      = {2013},
  address   = {Seattle, Washington, USA},
  pages     = {265--277},
  software  = {https://github.com/jkkummerfeld/berkeley-coreference-analyser/},
  url       = {http://www.aclweb.org/anthology/D13-1027},
  slides    = {http://www.jkk.name/pub/emnlp13analysis_keynote.key},
  slidespdf = {http://www.jkk.name/pub/emnlp13analysis_slides.pdf},
  abstract  = {Coreference resolution metrics quantify errors but do not analyze them. Here, we consider an automated method of categorizing errors in the output of a coreference system into intuitive underlying error types. Using this tool, we first compare the error distributions across a large set of systems, then analyze common errors across the top ten systems, empirically characterizing the major unsolved challenges of the coreference resolution task.},
}

      

Coreference resolution metrics quantify errors but do not analyze them. Here, we consider an automated method of categorizing errors in the output of a coreference system into intuitive underlying error types. Using this tool, we first compare the error distributions across a large set of systems, then analyze common errors across the top ten systems, empirically characterizing the major unsolved challenges of the coreference resolution task.

Examining the Impact of Coreference Resolution on Quote Attribution Tim O'Keefe, Kellie Webster, James R. Curran, Irena Koprinska, ALTA, 2013

Visualization, Search, and Error Analysis for Coreference Annotations Markus Gartner, Anders Bjorkelund, Gregor Thiele, Wolfgang Seeker, Jonas Kuhn, ACL, 2014

Low memory incremental coreference resolution Kellie Webster, James Curran, CoLing, 2014

Linking people in videos with "their" names using coreference resolution Vignesh Ramanathan, Armand Joulin, Percy Liang, Li Fei-Fei, ECCV, 2014

Solving Hard Coreference Problems Haoruo Peng, Daniel Khashabi, Dan Roth, NAACL, 2015

Analyzing and Visualizing Coreference Resolution Errors Sebastian Martschat, Thierry G"{o}ckel, Michael Strube, NAACL, 2015

Modeling the Lifespan of Discourse Entities with Application to Coreference Resolution Marie-Catherine de Marneffe, Marta Recasens, Christopher Potts, JAIR, 2015

Distributional Semantics for Resolving Bridging Mentions Tim Feuerbach, Martin Riedl, Chris Biemann, RANLP, 2015

Using Lexical and Encyclopedic Knowledge Yannick Versley, Massimo Poesio, Simone Ponzetto, , 2015

Error analysis for anaphora resolution in Russian: new challenging issues for anaphora resolution task in a morphologically rich language Svetlana Toldova, Ilya Azerkovich, Anna Roytberg, Alina Ladygina, Maria Vasilyeva, Workshop on Coreference Resolution Beyond OntoNotes (CORBON 2016), 2016

Visual Development & Analysis of Coreference Resolution Systems with CORVIDAE Nico Moller, Gunther Heidemann, Visualization and Interaction for Ontologies and Linked Data, 2016

CORVIDAE: Coreference Resolution Visual Development & Analysis Environment Nico Moller, Gunther Heidemann, International Conference on Semantic Systems, 2016

Richer Event Description: Integrating event coreference with temporal, causal and bridging annotation Tim O'Gorman, Kristin Wright-Bettner, Martha Palmer, Proceedings of the 2nd Workshop on Computing News Storylines (CNS 2016), 2016

Multilingual coreference resolution Sandra Kubler, Desislava Zhekova, Language and Linguistics Compass, 2016

A scaffolding approach to coreference resolution integrating statistical and rule-based models Heeyoung Lee, Mihai Surdeanu, Dan Jurafsky, NLE, 2017

A method for in-depth comparative evaluation: How (dis)similar are outputs of pos taggers, dependency parsers and coreference resolvers really?, Don Tuggener, EACL, 2017

@InProceedings{acl13analysis,
  title     = {An Empirical Examination of Challenges in Chinese Parsing},
  author    = {Jonathan K. Kummerfeld and Daniel Tse and James R. Curran and Dan Klein},
  booktitle = {Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)},
  shortvenue = {ACL (short)},
  address   = {Sofia, Bulgaria},
  pages     = {98--103},
  month     = {August},
  year      = {2013},
  publisher = {Association for Computational Linguistics},
  software  = {https://github.com/jkkummerfeld/berkeley-parser-analyser/},
  url       = {http://www.aclweb.org/anthology/P13-2018},
  slides    = {http://www.jkk.name/pub/acl13analysis_keynote.key},
  slidespdf = {http://www.jkk.name/pub/acl13analysis_slides.pdf},
  abstract  = {Aspects of Chinese syntax result in a distinctive mix of parsing challenges. However, the contribution of individual sources of error to overall difficulty is not well understood. We conduct a comprehensive automatic analysis of error types made by Chinese parsers, covering a broad range of error types for large sets of sentences, enabling the first empirical ranking of Chinese error types by their performance impact. We also investigate which error types are resolved by using gold part-of-speech tags, showing that improving Chinese tagging only addresses certain error types, leaving substantial outstanding challenges.},
}

      

Aspects of Chinese syntax result in a distinctive mix of parsing challenges. However, the contribution of individual sources of error to overall difficulty is not well understood. We conduct a comprehensive automatic analysis of error types made by Chinese parsers, covering a broad range of error types for large sets of sentences, enabling the first empirical ranking of Chinese error types by their performance impact. We also investigate which error types are resolved by using gold part-of-speech tags, showing that improving Chinese tagging only addresses certain error types, leaving substantial outstanding challenges.

Chinese syntactic parsing based on linguistic entity-relationship model, Dechun Yin, Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

A Hebrew verb–complement dictionary, Hanna Fadida, Alon Itai, Shuly Wintner, LREC, 2013

Two Knives Cut Better Than One: Chinese Word Segmentation with Dual Decomposition, Mengqiu Wang, Rob Voigt, Christopher D. Manning, ACL, 2014

Joint POS Tagging and Transition-based Constituent Parsing in Chinese with Non-local Features, Zhiguo Wang, Nianwen Xue, ACL, 2014

Improved Parsing with Taxonomy of Conjunctions, Dongchen Li, Xiantao Zhang, Xihong Wu, IEEE China Summit and International Conference on Signal and Information Processing, 2014

Parsing Chinese with a Generalized Categorial Grammar, Manjuan Duan, William Schuler, Proceedings of the Grammar Engineering Across Frameworks (GEAF) 2015 Workshop, 2015

Research on Chinese Parsing Based on the Improved Compositional Vector Grammar, Jingyi Li, Lingling Mu, Hongying Zan, Kunli Zhang, 16th Workshop, CLSW 2015, Revised Selected Papers, 2015

Does String-Based Neural MT Learn Source Syntax?, Xing Shi, Unkit Padhi, Kevin Knight, EMNLP, 2016

A Semantic-Oriented Grammar for Chinese Treebanking, Meishan Zhang, Yue Zhang, Wanxiang Che, Ting Liu, CICLing, 2016

Resolving Coordinate Structures for Chinese Constituent Parsing, Yichu Zhou, Shujian Huang, Xinyu Dai, Jiajun Chen, Natural Language Processing and Chinese Computing, 2015

Non-Deterministic Segmentation for Chinese Lattice Parsing, Hai Hu, Daniel Dakota, Sandra Kubler, Proceedings of the International Conference Recent Advances in Natural Language Processing, RANLP 2017, 2017

@Article{astro13clouds,
  title     = {High-velocity Clouds in the Galactic All Sky Survey. I. Catalog},
  author    = {Vanessa A. Moss and Naomi M. McClure-Griffiths and Tara Murphy and D. J. Pisano and Jonathan K. Kummerfeld and James R. Curran},
  volume    = {209},
  number    = {1},
  pages     = {12},
  publisher = {IOP Publishing},
  journal   = {The Astrophysical Journal Supplement Series},
  year      = {2013},
  abstract  = {We present a catalogue of high-velocity clouds (HVCs) from the Galactic All Sky Survey (GASS) of southern-sky neutral hydrogen, which has 57 mK sensitivity and 1 km/s velocity resolution and was obtained with the Parkes Telescope. Our catalogue has been derived from the stray-radiation corrected second release of GASS. We describe the data and our method of identifying HVCs and analyse the overall properties of the GASS population. We catalogue a total of 1693 HVCs at declinations < 0 deg, including 1111 positive velocity HVCs and 582 negative velocity HVCs. Our catalogue also includes 295 anomalous velocity clouds (AVCs). The cloud line-widths of our HVC population have a median FWHM of ~19 km/s, which is lower than found in previous surveys. The completeness of our catalogue is above 95% based on comparison with the HIPASS catalogue of HVCs, upon which we improve with an order of magnitude in spectral resolution. We find 758 new HVCs and AVCs with no HIPASS counterpart. The GASS catalogue will shed an unprecedented light on the distribution and kinematic structure of southern-sky HVCs, as well as delve further into the cloud populations that make up the anomalous velocity gas of the Milky Way.},
  url       = {http://iopscience.iop.org/0067-0049/209/1/12},
}

      

We present a catalogue of high-velocity clouds (HVCs) from the Galactic All Sky Survey (GASS) of southern-sky neutral hydrogen, which has 57 mK sensitivity and 1 km/s velocity resolution and was obtained with the Parkes Telescope. Our catalogue has been derived from the stray-radiation corrected second release of GASS. We describe the data and our method of identifying HVCs and analyse the overall properties of the GASS population. We catalogue a total of 1693 HVCs at declinations < 0 deg, including 1111 positive velocity HVCs and 582 negative velocity HVCs. Our catalogue also includes 295 anomalous velocity clouds (AVCs). The cloud line-widths of our HVC population have a median FWHM of ~19 km/s, which is lower than found in previous surveys. The completeness of our catalogue is above 95% based on comparison with the HIPASS catalogue of HVCs, upon which we improve with an order of magnitude in spectral resolution. We find 758 new HVCs and AVCs with no HIPASS counterpart. The GASS catalogue will shed an unprecedented light on the distribution and kinematic structure of southern-sky HVCs, as well as delve further into the cloud populations that make up the anomalous velocity gas of the Milky Way.

HI4PI: a full-sky H i survey based on EBHIS and GASS, L. Flöer R. Keller J. Kerp D. Lenz N. Ben Bekhti, J. Bailin M. R. Calabretta L. Dedes H. A. Ford B. K. Gibson U. Haud S. Janowiecki P. M. W. Kalberla F. J. Lockman N. M. McClure-Griffiths T. Murphy H. Nakanishi D. J. Pisano B. Winkel, L. Staveley-Smith, Astronomy and Astrophysics, 2016

@InProceedings{emnlp12analysis,
  title     = {Parser Showdown at the Wall Street Corral: An Empirical Investigation of Error Types in Parser Output},
  author    = {Jonathan K. Kummerfeld and David Hall and James R. Curran and Dan Klein},
  booktitle = {Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning},
  shortvenue = {EMNLP},
  year      = {2012},
  pages     = {1048--1059},
  month     = {July},
  address   = {Jeju Island, South Korea},
  publisher = {Association for Computational Linguistics},
  software  = {https://github.com/jkkummerfeld/berkeley-parser-analyser/},
  url       = {http://www.aclweb.org/anthology/D12-1096},
  slides    = {http://www.jkk.name/pub/emnlp12analysis_keynote.key},
  slidespdf = {http://www.jkk.name/pub/emnlp12analysis_slides.pdf},
  abstract  = {Constituency parser performance is primarily interpreted through a single metric, F-score on WSJ section 23, that conveys no linguistic information regarding the remaining errors.  We classify errors within a set of linguistically meaningful types using tree transformations that repair groups of errors together. We use this analysis to answer a range of questions about parser behaviour, including what linguistic constructions are difficult for state-of-the-art parsers, what types of errors are being resolved by rerankers, and what types are introduced when parsing out-of-domain text.},
}

      

Constituency parser performance is primarily interpreted through a single metric, F-score on WSJ section 23, that conveys no linguistic information regarding the remaining errors. We classify errors within a set of linguistically meaningful types using tree transformations that repair groups of errors together. We use this analysis to answer a range of questions about parser behaviour, including what linguistic constructions are difficult for state-of-the-art parsers, what types of errors are being resolved by rerankers, and what types are introduced when parsing out-of-domain text.

Joint Apposition Extraction with Syntactic and Semantic Constraints, Will Radford, James R. Curran, ACL, 2013

Parsing with Compositional Vector Grammars, Richard Socher, John Bauer, Christopher D. Manning, Andrew Y. Ng, ACL, 2013

A Hebrew verb–complement dictionary, Hanna Fadida, Alon Itai, Shuly Wintner, LREC, 2013

On the Elements of an Accurate Tree-to-String Machine Translation System, Graham Neubig, Kevin Duh, ACL, 2014

Parser Evaluation Using Derivation Trees: A Complement to evalb, Seth Kulick, Ann Bies, Justin Mott, Anthony Kroch, Mark Liberman, Beatrice Santorini, ACL, 2014

Joint RNN-Based Greedy Parsing and Word Composition, Joel Legrand, Ronan Collobert, ICLR, 2015

Exploring Compositional Architectures and Word Vector Representations for Prepositional Phrase Attachment, Yonatan Belinkov, Tao Lei, Regina Barzilay, Amir Globerson, TACL, 2014

Identifying Cascading Errors using Constraints in Dependency Parsing, Dominick Ng, James R. Curran, ACL, 2015

It Depends: Dependency Parser Comparison Using A Web-based Evaluation Tool, Jinho D. Choi, Joel Tetreault, Amanda Stent, ACL, 2015

Transition-based Neural Constituent Parsing, Taro Watanabe, Eiichiro Sumita, ACL, 2015

What is hard in Universal Dependency Parsing?, Angelika Kirilina, Yannick Versleya, SPMRL, 2015

A Protocol for Annotating Parser Differences, James V. Bruno, Aoife Cahill, Binod Gyawali, ETS Research Reports, 2016

Predicting the Performance of Parsing with Referential Translation Machines, Ergun Bicici, The Prague Bulletin of Mathematical Linguistics, 2016

An Evaluation of Parser Robustness for Ungrammatical Sentences, Home B. Hashemi, Rebecca Hwa, EMNLP, 2016

Fine-grained parallelism in probabilistic parsing with Habanero Java, Matthew Francis-Landau, Bing Xue, Jason Eisner, Vivek Sarkar, Workshop on Irregular Applications: Architectures and Algorithms, 2016

Old School vs. New School: Comparing Transition-Based Parsers with and without Neural Network Enhancement, Miryam de Lhoneux, Sara Stymne, Joakim Nivre, International Workshop on Treebanks and Linguistic Theories, 2017

PP Attachment: Where do We Stand?, Dani"{e}l de Kok, Jianqiang Ma, Corina Dima, Erhard Hinrichs, EACL, 2017

Deep Semantic Role Labeling: What Works and What's Next, Kenton Lee Mike Lewis Luheng He, Luke Zettlemoyer, ACL, 2017

Breaking {NLP}: {Using} {Morphosyntax}, {Semantics}, {Pragmatics} and {World} {Knowledge} to {Fool} {Sentiment} {Analysis} {Systems}, Taylor Mahler, Willy Cheung, Micha Elsner, David King, Marie-Catherine de Marneffe, Cory Shain, Symon Stevens-Guille, Michael White, {EMNLP} 2017 {Workshop} on {Building} {Linguistically} {Generalizable} {NLP} {Systems}, 2017

A Simple Method for Clarifying Sentences with Coordination Ambiguities, Michael White, Manjuan Duan, David L. King, INLG, 2017

Does String-Based Neural MT Learn Source Syntax?, Xing Shi, Unkit Padhi, Kevin Knight, EMNLP, 2016

Prepositional Phrase Attachment over Word Embedding Products, Pranava Swaroop Madhyastha, Xavier Carreras, Ariadna Quattoni, IWPT, 2017

@InProceedings{acl12conversion,
  title     = {Robust Conversion of CCG Derivations to Phrase Structure Trees},
  author    = {Jonathan K. Kummerfeld and Dan Klein and James R. Curran},
  booktitle = {Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)},
  shortvenue = {ACL (short)},
  year      = {2012},
  pages     = {105--109},
  month     = {July},
  address   = {Jeju Island, South Korea},
  publisher = {Association for Computational Linguistics},
  software  = {https://github.com/jkkummerfeld/berkeley-ccg2pst},
  url       = {http://www.aclweb.org/anthology/P12-2021},
  slides    = {http://www.jkk.name/pub/acl12conversion_keynote.key},
  slidespdf = {http://www.jkk.name/pub/acl12conversion_slides.pdf},
  abstract  = {We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simple transductions on category pairs, our approach uses richer transductions attached to single categories. Our conversion preserves more sentences under round-trip conversion (51.1% vs. 39.6%) and is more robust. In particular, unlike past methods, ours does not require ad-hoc rules over non-local features, and so can be easily integrated into a parser.},
}

      

We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simple transductions on category pairs, our approach uses richer transductions attached to single categories. Our conversion preserves more sentences under round-trip conversion (51.1% vs. 39.6%) and is more robust. In particular, unlike past methods, ours does not require ad-hoc rules over non-local features, and so can be easily integrated into a parser.

A Machine Learning Approach to Convert CCGbank to Penn Treebank, Xiaotian Zhang, Hai Zhao, Cong Hui, CoLing, 2012

@InProceedings{conll11coreference,
  title     = {Mention Detection: Heuristics for the OntoNotes annotations},
  author    = {Jonathan K. Kummerfeld and Mohit Bansal and David Burkett and Dan Klein},
  shortvenue = {CoNLL Shared Task},
  booktitle = {Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task},
  year      = {2011},
  pages     = {102--106},
  month     = {June},
  address   = {Portland, Oregon, USA},
  publisher = {Association for Computational Linguistics},
  url       = {http://www.aclweb.org/anthology/W11-1916},
  poster    = {http://www.jkk.name/pub/conll11coreference_poster.pdf},
  abstract  = {Our submission was a reduced version of the system described in Haghighi and Klein (2010), with extensions to improve mention detection to suit the OntoNotes annotation scheme. Including exact matching mention detection in this shared task added a new and challenging dimension to the problem, particularly for our system, which previously used a very permissive detection method. We improved this aspect of the system by adding filters based on the annotation scheme for OntoNotes and analysis of system behavior on the development set. These changes led to improvements in coreference F-score of 10.06, 5.71, 6.78, 6.63 and 3.09 on the MUC, B3 , Ceaf-e, Ceaf-m and Blanc, metrics, respectively, and a final task score of 47.10.},
}

      

Our submission was a reduced version of the system described in Haghighi and Klein (2010), with extensions to improve mention detection to suit the OntoNotes annotation scheme. Including exact matching mention detection in this shared task added a new and challenging dimension to the problem, particularly for our system, which previously used a very permissive detection method. We improved this aspect of the system by adding filters based on the annotation scheme for OntoNotes and analysis of system behavior on the development set. These changes led to improvements in coreference F-score of 10.06, 5.71, 6.78, 6.63 and 3.09 on the MUC, B3 , Ceaf-e, Ceaf-m and Blanc, metrics, respectively, and a final task score of 47.10.

Improving mention detection for Basque based on a deep error analysis, Ander Soraluze, Olatz Arregi, Xabier Arregi, Arantza Diaz de Ilarraza, Natural Language Engineering, 2016

Mention detection: First steps in the development of a Basque coreference resolution system, Ander Soraluze, Olatz Arregi, Xabier Arregi, Klara Ceberio, Arantza Diaz de Ilarraza, Proceedings of KONVENS, 2012

Detecting Apposition for Text Simplification in Basque, Itziar Gonzalez-Dios, Maria Jesus Aranzabe, Arantza Diaz de Ilarraza, Ander Soraluze, , 2013

Co-reference Resolution in Farsi Corpora, Maryam Nazaridoust, Behrouz Minaie Bidgoli, Siavash Nazaridoust, , 2014

Removing the Training Wheels: A Coreference Dataset that Entertains Humans and Challenges Computers, Anupam Guha, Mohit Iyyer, Danny Bouman, Jordan Boyd-Graber, NAACL, 2015

ARRAU: Linguistically-Motivated Annotation of Anaphoric Descriptions, Olga Uryupina, Ron Artstein, Antonella Bristot, Federica Cavicchio, Kepa J. Rodriguez, Massimo Poesio, LREC, 2016

A scaffolding approach to coreference resolution integrating statistical and rule-based models, Heeyoung Lee, Mihai Surdeanu, Dan Jurafsky, NLE, 2017

Apports des analyses syntaxiques pour la d'etection automatique de mentions dans un corpus de francais oral, Isabelle Tellier Eric De La Clergerie Marco Dinarelli Frederic Landragin Loic Grobol, Actes de la 24e Conference sur le Traitement Automatique des Langues Naturelles (TALN), 2017

Mention Detection Using Pointer Networks for Coreference Resolution, Changki Lee Soojong Lim Cheoneum Park, ETRI Journal, 2017

@Article{prl10chemistry,
  title     = {Spatiotemporal Hierarchy of Relaxation Events, Dynamical Heterogeneities, and Structural Reorganization in a Supercooled Liquid},
  author    = {Raphael Candelier and Asaph Widmer-Cooper and Jonathan K. Kummerfeld and Olivier Dauchot and Giulio Biroli and Peter Harrowell and David R. Reichman},
  journal   = {Physical Review Letters},
  volume    = {105},
  number    = {13},
  pages     = {135702},
  numpages  = {4},
  year      = {2010},
  month     = {September},
  doi       = {10.1103/PhysRevLett.105.135702},
  publisher = {American Physical Society},
  url       = {http://prl.aps.org/abstract/PRL/v105/i13/e135702},
  abstract  = {We identify the pattern of microscopic dynamical relaxation for a two-dimensional glass-forming liquid. On short time scales, bursts of irreversible particle motion, called cage jumps, aggregate into clusters. On larger time scales, clusters aggregate both spatially and temporally into avalanches. This propagation of mobility takes place along the soft regions of the systems, which have been identified by computing isoconfigurational Debye-Waller maps. Our results characterize the way in which dynamical heterogeneity evolves in moderately supercooled liquids and reveal that it is astonishingly similar to the one found for dense glassy granular media.},
}

      

We identify the pattern of microscopic dynamical relaxation for a two-dimensional glass-forming liquid. On short time scales, bursts of irreversible particle motion, called cage jumps, aggregate into clusters. On larger time scales, clusters aggregate both spatially and temporally into avalanches. This propagation of mobility takes place along the soft regions of the systems, which have been identified by computing isoconfigurational Debye-Waller maps. Our results characterize the way in which dynamical heterogeneity evolves in moderately supercooled liquids and reveal that it is astonishingly similar to the one found for dense glassy granular media.

Structural phases in non-additive soft-disk mixtures: Glasses, substitutional order, and random tilings A. Widmer-Cooper, P. Harrowell, Journal of Chemical Physics, 2011

Transient slowing down relaxation dynamics of the supercooled dusty plasma liquid after quenching Yen-Shuo Su, Chong-Wai Io, Lin I, Physical Review E, 2012

Finite Size Scaling of the Dynamical Free-Energy in a Kinetically Constrained Model Thierry Bodineau, Vivien Lecomte, Cristina Toninelli, Journal of Statistical Physics, 2012

Manifestations of dynamical facilitation in glassy materials Yael S. Elmatad, Aaron S. Keys, Physcial Review E, 2012

Trajectory entanglement in dense granular materials James G Puckett, Frederic Lechenault, Karen E Daniels, Jean-Luc Thiffeault, Journal of Statistical Mechanics: Theory and Experiment, 2012

Excitations Are Localized and Relaxation Is Hierarchical in Glass-Forming Liquids Aaron S. Keys, Lester O. Hedges, Juan P. Garrahan, Sharon C. Glotzer, David Chandler, Physical Review, 2011

Perspective: Supercooled liquids and glasses M. D. Ediger, Peter Harrowell, Journal of Chemical Physics, 2012

Gel formation and aging in weakly attractive nanocolloid suspensions at intermediate concentrations Hongyu Guo, S. Ramakrishnan, James L. Harden, Robert L. Leheny, Journal of Chemical Physics, 2011

Mean-field cage theory for the random close packed state of a metastable hard-sphere glass Xian-Zhi Wang, Physica A, 2012

Theoretical perspective on the glass transition and amorphous materials Ludovic Berthier, Giulio Biroli, Reviews of Modern Physics, 2011

Dynamical facilitation decreases when approaching the granular glass transition R. Candelier, O. Dauchot, G. Biroli, Europhysics Letters, 2010

Jammed Particle Configurations and Dynamics in High-Density Lennard-Jones Binary Mixtures in Two Dimensions Hayato Shiba, Akira Onuki, Progress of Theoretical Physics Supplement, 2010

Dynamic heterogeneities, boson peak, and activation volume in glass-forming liquids L. Hong, V. N. Novikov, A. P. Sokolov, Physical Review E, 2011

From Coupled Elementary Units to the Complexity of the Glass Transition Christian Rehwald, Oliver Rubner, Andreas Heuer, Physical Review Letters, 2010

Dynamics of thermal vibrational motions and stringlike jump motions in three-dimensional glass-forming liquids Takeshi Kawasaki, Akira Onuki, AIP: The Journal of Chemical Physics, 2013

Local elastic response measured near the colloidal glass transition D. Anderson, D. Schaar, H. G. E. Hentschel, J. Hay, Piotr Habdas, Eric R. Weeks, AIP: The Journal of Chemical Physics, 2013

Dynamical Heterogeneities in Glasses, Colloids, and Granular Media Ludovic Berthier, Giulio Biroli, Jean-Philippe Bouchaud, Luca Cipelletti, Wim van Saarloos, , 2011

Microscopic Picture of Cooperative Processes in Restructuring Gel Networks Jader Colombo, Asaph Widmer-Cooper, Emanuela Del Gado, Physical Review Letters, 2013

Distribution of local relaxation events in an aging three-dimensional glass: Spatiotemporal correlation and dynamical heterogeneity Anton Smessaert, Jorg Rottler, Physical Review E, 2013

Avalanches mediate crystallization in a hard-sphere glass Eduardo Sanz, Chantal Valeriani, Emanuela Zaccarelli, Wilson C. K. Poon, Michael E. Cates, Peter N. Pusey, Proceedings of the National Academy of Sciences, 2013

Distributions of single-molecule properties as tools for the study of dynamical heterogeneities in nanoconfined water G B Suffritti, P Demontis, J Gulin-Gonzalez, M Masia, Journal of Physics: Condensed Matter, 2014

Stress-induced microcracking and cooperative motion of cold dusty plasma liquids Chi Yang, Lin I, Physical Review E, 2014

Dynamics in a tetrahedral network glassformer: Vibrations, network rearrangements, and diffusion Takeshi Kawasaki, Kang Kim, Akira Onuki, The Journal of Chemical Physics, 2014

Order parameter for structural heterogeneity in disordered solids Hua Tong, Ning Xu, Physical Review E, 2014

Relaxation pathway confinement in glassy dynamics J. A. Rodriguez Fris, M. A. Frechero, G. A. Appignanesi, The Journal of Chemical Physics, 2014

Dynamical Heterogeneity in the Supercooled Liquid State of the Phase Change Material GeTe Gabriele Cesare Sosso, Jader Colombo, Joerg Behler, Emanuela Del Gado, Marco Bernasconi, The Journal of Physical Chemistry B, 2014

Flexible confinement leads to multiple relaxation regimes in glassy colloidal liquids Ian Williams, Erdal C. Oguz, Paul Bartlett, Hartmut Lowen, C. Patrick Royall, The Journal of Chemical Physics, 2015

Mutual information reveals multiple structural relaxation mechanisms in a model glass former Andrew J. Dunleavy, Karoline Wiesner, Ryoichi Yamamoto, C. Patrick Royall, Nature Communications, 2015

The role of local structure in dynamical arrest C. Patrick Royall, Stephen R. Williams, Physics Reports, 2015

Cooling the two-dimensional short spherocylinder liquid to the tetratic phase: Heterogeneous dynamics with one-way coupling between rotational and translational hopping Yen-Shuo Su, Lin I, Physical Review E, 2015

Computer simulation studies of the influence of side alkyl chain on glass transition behavior of carbazole trimer Chunyang Yu, Li Ma, Wei Huang, Yongfeng Zhou, Jingui Qin, Deyue Yan, Science China Chemistry, 2017

Structure-property relationships from universal signatures of plasticity in disordered solids, E. D. Cubuk, R. J. S. Ivancic, S. S. Schoenholz, D. J. Strickland, A. Basu, Z. S. Davidson, J. Fontaine, J. L. Hor, Y.-R. Huang, Y. Jiang, N. C. Keim, K. D. Koshigan, J. A. Lefever, T. Liu, X.-G. Ma, D. J. Magagnosc, E. Morrow, C. P. Ortiz, J. M. Rieser, A. Shavit, T. Still, Y. Xu, Y. Zhang, K. N. Nordstrom, P. E. Arratia, R. W. Carpick, D. J. Durian, Z. Fakhraai, D. J. Jerolmack, Daeyeon Lee, Ju Li, R. Riggleman, K. T. Turner, A. G. Yodh, D. S. Gianola, Andrea J. Liu, Science, 2017

@InProceedings{coling10morph,
  title     = {Morphological Analysis Can Improve a CCG Parser for English},
  author    = {Matthew Honnibal and Jonathan K. Kummerfeld and James R. Curran},
  booktitle = {Proceedings of the 23rd International Conference on Computational Linguistics},
  shortvenue = {CoLing},
  year      = {2010},
  pages     = {445--453},
  address   = {Beijing, China},
  month     = {August},
  url       = {http://aclweb.org/anthology/C/C10/C10-2051.pdf},
  abstract  = {Because English is a low morphology language, current statistical parsers tend to ignore morphology and accept some level of redundancy. This paper investigates how costly such redundancy is for a lexicalised grammar such as CCG.

We use morphological analysis to split verb inflectional suffixes into separate tokens, so that they can receive their own lexical categories. We find that this improves accuracy when the splits are based on correct POS tags, but that errors in gold standard or automatically assigned POS tags are costly for the system. This shows that the parser can benefit from morphological analysis, so long as the analysis is correct.},
}

      

Because English is a low morphology language, current statistical parsers tend to ignore morphology and accept some level of redundancy. This paper investigates how costly such redundancy is for a lexicalised grammar such as CCG.

We use morphological analysis to split verb inflectional suffixes into separate tokens, so that they can receive their own lexical categories. We find that this improves accuracy when the splits are based on correct POS tags, but that errors in gold standard or automatically assigned POS tags are costly for the system. This shows that the parser can benefit from morphological analysis, so long as the analysis is correct.

Morpho-syntactic Lexical Generalization for CCG Semantic Parsing, Adrienne Wang, Tom Kwiatkowski, Luke Zettlemoyer, EMNLP, 2014

@InProceedings{acl10adapt,
  title     = {Faster Parsing by Supertagger Adaptation},
  author    = {Jonathan K. Kummerfeld and Jessika Roesner and Tim Dawborn and James Haggerty and James R. Curran and Stephen Clark},
  booktitle = {Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics},
  shortvenue = {ACL},
  month     = {July},
  year      = {2010},
  address   = {Uppsala, Sweden},
  publisher = {Association for Computational Linguistics},
  pages     = {345--355},
  software  = {http://downloads.schwa.org/acl10adapt_fast_news_model.tar.bz2},
  slidespdf = {http://www.jkk.name/pub/acl10adapt_slides.pdf},
  url       = {http://www.aclweb.org/anthology/P/P10/P10-1036.pdf},
  abstract  = {We propose a novel self-training method for a parser which uses a lexicalised grammar and supertagger, focusing on increasing the speed of the parser rather than its accuracy. The idea is to train the supertagger on large amounts of parser output, so that the supertagger can learn to supply the supertags that the parser will eventually choose as part of the highest scoring derivation. Since the supertagger supplies fewer supertags overall, the parsing speed is increased. We demonstrate the effectiveness of the method using a CCG supertagger and parser, obtaining significant speed increases on newspaper text with no loss in accuracy. We also show that the method can be used to adapt the CCG parser to new domains, obtaining accuracy and speed improvements for Wikipedia and biomedical text.},
}

      

We propose a novel self-training method for a parser which uses a lexicalised grammar and supertagger, focusing on increasing the speed of the parser rather than its accuracy. The idea is to train the supertagger on large amounts of parser output, so that the supertagger can learn to supply the supertags that the parser will eventually choose as part of the highest scoring derivation. Since the supertagger supplies fewer supertags overall, the parsing speed is increased. We demonstrate the effectiveness of the method using a CCG supertagger and parser, obtaining significant speed increases on newspaper text with no loss in accuracy. We also show that the method can be used to adapt the CCG parser to new domains, obtaining accuracy and speed improvements for Wikipedia and biomedical text.

Chart pruning for fast lexicalised-grammar parsing, Yue Zhanga, Byung-Gyu Ahn, Stephen Clark, Curt Van Wyk, James R. Curran, Laura Rimell, CoLing, 2010

A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing, Michael Auli, Adam Lopez, ACL, 2011

Efficient CCG Parsing: A* versus Adaptive Supertagging, Michael Auli, Adam Lopez, ACL, 2011

Exciting and interesting: issues in the generation of binomials Ann Copestake, Aurelie Herbelot, Proceedings of the UCNLG+Eval: Language Generation and Evaluation Workshop, 2011

Automatic recognition of conceptualization zones in scientific articles and two life science applications, Maria Liakata, Shyamasree Saha, Simon Dobnik, Colin Batchelor, Dietrich Rebholz-Schuhmann, Bioinformatics, 2012

Frontier Pruning for Shift-Reduce CCG Parsing, Stephen Merity, James Curran, ALTA, 2011

Ubertagging: Joint Segmentation and Supertagging for English, Rebecca Dridan, EMNLP, 2013

A* CCG Parsing with a Supertag-factored Model, Mike Lewis, Mark Steedman, EMNLP, 2014

CCG Supertagging with a Recurrent Neural Network, Wenduan Xu, Michael Auli, Stephen Clark, ACL, 2015

@InProceedings{alta09tagging,
  title     = {Faster parsing and supertagging model estimation},
  author    = {Jonathan K. Kummerfeld and Jessika Roesner and James R. Curran},
  booktitle = {Proceedings of the Australasian Language Technology Association Workshop 2009},
  shortvenue = {ALTA},
  year      = {2009},
  pages     = {62--70},
  address   = {Sydney, Australia},
  month     = {December},
  url       = {http://www.aclweb.org/anthology/U/U09/U09-1009.pdf},
  slidespdf = {http://www.jkk.name/pub/alta09tagging_slides.pdf},
  abstract  = {Parsers are often the bottleneck for data acquisition, processing text too slowly to be widely applied. One way to improve the efficiency of parsers is to construct more confident statistical models. More training data would enable the use of more sophisticated features and also provide more evidence for current features, but gold standard annotated data is limited and expensive to produce.

We demonstrate faster methods for training a supertagger using hundreds of millions of automatically annotated words, constructing statistical models that further constrain the number of derivations the parser must consider. By introducing new features and using an automatically annotated corpus we are able to double parsing speed on Wikipedia and the Wall Street Journal, and gain accuracy slightly when parsing Section 00 of the Wall Street Journal.},
}

      

Parsers are often the bottleneck for data acquisition, processing text too slowly to be widely applied. One way to improve the efficiency of parsers is to construct more confident statistical models. More training data would enable the use of more sophisticated features and also provide more evidence for current features, but gold standard annotated data is limited and expensive to produce.

We demonstrate faster methods for training a supertagger using hundreds of millions of automatically annotated words, constructing statistical models that further constrain the number of derivations the parser must consider. By introducing new features and using an automatically annotated corpus we are able to double parsing speed on Wikipedia and the Wall Street Journal, and gain accuracy slightly when parsing Section 00 of the Wall Street Journal.

@PhDThesis{thesis09adapt,
  title     = {Adaptive Supertagging for Faster Parsing},
  author    = {Jonathan K. Kummerfeld},
  school    = {The University of Sydney},
  year      = {2009},
  address   = {Sydney, Australia},
  url       = {http://www.jkk.name/pub/thesis09adapt_thesis.pdf},
  poster    = {http://www.jkk.name/pub/thesis09adapt_poster.pdf},
  slidespdf = {http://www.jkk.name/pub/thesis09adapt_slides.pdf},
  abstract  = {Statistical parsers are crucial for tackling the grand challenges of Natural Language Processing. The most effective approaches to these tasks are data driven, but parsers are too slow to be effectively used on large data sets. State-of-the-art parsers generally cannot process more than one sentence a second, and the fastest cannot process more than fifty sentences a second. The situation is even worse when they are applied outside of the domain of their training data. The fastest systems have two components, a parser, which has time complexity O(n3) and a supertagger, which has linear time complexity. By shifting work from the parser to the supertagger we dramatically improve speed.

  This work demonstrates several major novel ideas that improve parsing efficiency. The core idea is that the tags chosen by the parser are gold standard data for its supertagger. This leads to the second surprising conceptual development, that decreasing tagging accuracy can improve parsing performance. To demonstrate these ideas required extensive development of the C&C supertagger, including imple- mentation of more efficient estimation algorithms and parallelisation of the training process. This was particularly challenging as the C&C supertagger is a state-of-the-art high performance system designed with a focus on speed rather than flexibility.

  I was able to significantly improve performance on the standard evaluation corpus by using the parser to generate extremely large new resources for supertagger training. I have also shown that these methods provide significant benefits on another domain, Wikipedia text, without the cost of generating human annotated data sets. These parsing performance gains occur while supertagging accuracy decreases.

  Despite extensive use of supertaggers to improve parsing efficiency there has been no comprehensive study of the interaction between a supertagger and a parser. I present the first systematic exploration of the relationship, show the potential benefits of understanding it, and demonstrate a novel algorithm for optimising the parameters that define it.

  I have constructed models that process newspaper text 86% faster than previously, and Wikipedia text 30% faster, without any loss in accuracy and without the aid of extra gold standard resources in either domain. This work will lead directly to improvements in a range of Natural Language Processing tasks by enabling the use of far more parsed data.},
}

      

Statistical parsers are crucial for tackling the grand challenges of Natural Language Processing. The most effective approaches to these tasks are data driven, but parsers are too slow to be effectively used on large data sets. State-of-the-art parsers generally cannot process more than one sentence a second, and the fastest cannot process more than fifty sentences a second. The situation is even worse when they are applied outside of the domain of their training data. The fastest systems have two components, a parser, which has time complexity O(n3) and a supertagger, which has linear time complexity. By shifting work from the parser to the supertagger we dramatically improve speed.

This work demonstrates several major novel ideas that improve parsing efficiency. The core idea is that the tags chosen by the parser are gold standard data for its supertagger. This leads to the second surprising conceptual development, that decreasing tagging accuracy can improve parsing performance. To demonstrate these ideas required extensive development of the C&C supertagger, including imple- mentation of more efficient estimation algorithms and parallelisation of the training process. This was particularly challenging as the C&C supertagger is a state-of-the-art high performance system designed with a focus on speed rather than flexibility.

I was able to significantly improve performance on the standard evaluation corpus by using the parser to generate extremely large new resources for supertagger training. I have also shown that these methods provide significant benefits on another domain, Wikipedia text, without the cost of generating human annotated data sets. These parsing performance gains occur while supertagging accuracy decreases.

Despite extensive use of supertaggers to improve parsing efficiency there has been no comprehensive study of the interaction between a supertagger and a parser. I present the first systematic exploration of the relationship, show the potential benefits of understanding it, and demonstrate a novel algorithm for optimising the parameters that define it.

I have constructed models that process newspaper text 86% faster than previously, and Wikipedia text 30% faster, without any loss in accuracy and without the aid of extra gold standard resources in either domain. This work will lead directly to improvements in a range of Natural Language Processing tasks by enabling the use of far more parsed data.

@TechReport{report09jhu,
  title     = {Large-Scale Syntactic Processing: Parsing the Web},
  author    = {Stephen Clark and Ann Copestake and James R. Curran and Yue Zhang and Aurelie Herbelot and James Haggerty and Byung-Gyu Ahn and Curt Van Wyk and Jessika Roesner and Jonathan Kummerfeld and Tim Dawborn},
  year      = {2009},
  institution = {Johns Hopkins University},
  url       = {http://www.jkk.name/pub/report09jhu.pdf},
  abstract  = {Scalable syntactic processing will underpin the sophisticated language technology needed for next generation information access. Companies are already using nlp tools to create web-scale question answering and "semantic search" engines. Massive amounts of parsed web data will also allow the automatic creation of semantic knowledge resources on an unprecedented scale. The web is a challenging arena for syntactic parsing, because of its scale and variety of styles, genres, and domains.

The goals of our workshop were to scale and adapt an existing wide-coverage parser to Wikipedia text; improve the efficiency of the parser through various methods of chart pruning; use self-training to improve the efficiency and accuracy of the parser; use the parsed wiki data for an innovative form of bootstrapping to make the parser both more efficient and more accurate; and finally use the parsed web data for improved disambiguation of coordination structures, using a variety of syntactic and semantic knowledge sources.

The focus of the research was the C&C parser (Clark and Curran, 2007c), a state-of-the-art statistical parser based on Combinatory Categorial Grammar (ccg). The parser has been evaluated on a number of standard test sets achieving state-of-the-art accuracies. It has also recently been adapted successfully to the biomedical domain (Rimell and Clark, 2009). The parser is surprisingly efficient, given its detailed output, processing tens of sentences per second. For web-scale text processing, we aimed to make the parser an order of magnitude faster still. The C&C parser is one of only very few parsers currently available which has the potential to produce detailed, accurate analyses at the scale we were considering.},
}

      

Scalable syntactic processing will underpin the sophisticated language technology needed for next generation information access. Companies are already using nlp tools to create web-scale question answering and “semantic search” engines. Massive amounts of parsed web data will also allow the automatic creation of semantic knowledge resources on an unprecedented scale. The web is a challenging arena for syntactic parsing, because of its scale and variety of styles, genres, and domains.

The goals of our workshop were to scale and adapt an existing wide-coverage parser to Wikipedia text; improve the efficiency of the parser through various methods of chart pruning; use self-training to improve the efficiency and accuracy of the parser; use the parsed wiki data for an innovative form of bootstrapping to make the parser both more efficient and more accurate; and finally use the parsed web data for improved disambiguation of coordination structures, using a variety of syntactic and semantic knowledge sources.

The focus of the research was the C&C parser (Clark and Curran, 2007c), a state-of-the-art statistical parser based on Combinatory Categorial Grammar (ccg). The parser has been evaluated on a number of standard test sets achieving state-of-the-art accuracies. It has also recently been adapted successfully to the biomedical domain (Rimell and Clark, 2009). The parser is surprisingly efficient, given its detailed output, processing tens of sentences per second. For web-scale text processing, we aimed to make the parser an order of magnitude faster still. The C&C parser is one of only very few parsers currently available which has the potential to produce detailed, accurate analyses at the scale we were considering.

Introducing More Features to Improve Chinese Shift-Reduce Parsing Hongxian Wang, Qiang Zhou, Liou Chen, Asia Pacific Signal and Information Processing Association, Annual Summit and Conference, 2011

Probabilistic models of similarity in syntactic context Diarmuid Seaghdha, Anna Korhonen, EMNLP, 2011

Evaluation Reportof the third Chinese Parsing Evaluation: CIPSSIGHAN-ParsEval-2012 Qiang Zhou, Proceedings of the Second CIPS-SIGHAN Joint Conference on Chinese Language Processing, 2012

Evaluation Reportof the third Chinese Parsing Evaluation: CIPSSIGHAN-ParsEval-2014 Qiang Zhou, Proceedings of the Third CIPS-SIGHAN Joint Conference on Chinese Language Processing, 2014

Interpreting compound nouns with kernel methods Diarmuid Seaghdha, Ann Copestake, Natural Language Engineering, 2013

CYK-based Decision and Forest Parsing Algorithm for Combinatory Categorial Grammar Qingjiang Wang, Zhengping Wang, Lin Zhang, Journal of Information and Computational Science, 2014

A Streaming Dataflow Implementation of Parallel Cocke–Younger–Kasami Parser D. Bojic, M. Bojovic, , 2016

Leveraging a Semantically Annotated Corpus to Disambiguate Prepositional Phrase Attachment Guy Emerson, Ann Copestake, Proceedings of the 11th International Conference on Computational Semantics, 2015

How important is syntactic parsing accuracy? An empirical evaluation on rule-based sentiment analysis, Carlos Gomez-Rodriguez, Iago Alonso-Alonso, David Vilares, Artificial Intelligence Review, 2017

@InProceedings{alta08vpc,
  title     = {Classification of Verb Particle Constructions with the Google Web1T Corpus},
  author    = {Jonathan K. Kummerfeld and James R. Curran},
  booktitle = {Proceedings of the Australasian Language Technology Association Workshop 2008},
  shortvenue = {ALTA},
  month     = {December},
  year      = {2008},
  address   = {Hobart, Australia},
  pages     = {55--63},
  volume    = {6},
  url       = {http://www.aclweb.org/anthology/U/U08/U08-1008.pdf},
  poster    = {http://www.jkk.name/pub/alta08vpc_poster.eps},
  abstract  = {Manually maintaining comprehensive databases of multi-word expressions, for example Verb-Particle Constructions (VPCs), is infeasible. We describe a new classifier for potential VPCs, which uses information in the Google Web1T corpus to perform a simple linguistic constituency test. Specifically, we consider the fronting test, comparing the frequencies of the two possible orderings of the given verb and particle. Using only a small set of queries for each verb-particle pair, the system was able to achieve an F-score of 78.4% in our evaluation while processing thousands of queries a second.},
}

      

Manually maintaining comprehensive databases of multi-word expressions, for example Verb-Particle Constructions (VPCs), is infeasible. We describe a new classifier for potential VPCs, which uses information in the Google Web1T corpus to perform a simple linguistic constituency test. Specifically, we consider the fronting test, comparing the frequencies of the two possible orderings of the given verb and particle. Using only a small set of queries for each verb-particle pair, the system was able to achieve an F-score of 78.4% in our evaluation while processing thousands of queries a second.

New Tools for Web-Scale N-grams, Dekang Lin, Kenneth Church, Heng Ji, Satoshi Sekine, David Yarowsky, Shane Bergsma, Kailash Patil, Emily Pitler, Rachel Lathbury, Vikram Rao, Kapil Dalwani, Sushant Narsale, LREC, 2010

Corpus-based Extraction of Japanese Compound Verbs, James Breen, Timothy Baldwin, ALTA, 2009

Predicting the Semantic Compositionality of Prefix Verbs, Shane Bergsma, Aditya Bhargava, Hua He, Grzegorz Kondrak, EMNLP, 2010

Practical Linguistic Steganography Using Contextual Synonym Substitution and Vertex Colour Coding, Ching-Yun Chang, Stephen Clark, EMNLP, 2010

POS Tagging of English Particles for Machine Translation, Jianjun Ma, Degen Huang, Haixia Liu, Wenfeng Sheng, MT Summit of the International Association for Machine Translation, 2011

Automatic Classification of German an Particle Verbs, Sylvia Springorum, Sabine Schulte im Walde, Antje Roßdeutscher, LREC, 2012

Practical Linguistic Steganography using Contextual Synonym Substitution and a Novel Vertex Coding Method, Ching-Yun Chang, Stephen Clark, CL, 2014

@Article{chem08packing,
  title     = {The densest packing of AB binary hard-sphere homogeneous compounds across all size ratios},
  author    = {Jonathan K Kummerfeld and Toby S Hudson and Peter Harrowell},
  journal   = {The Journal of Physical Chemistry B},
  month     = {August},
  year      = {2008},
  volume    = {112},
  issue     = {35},
  pages     = {10773--10776},
  url       = {http://pubs.acs.org/doi/abs/10.1021/jp804953r},
  abstract  = {This paper considers the homogeneous packing of binary hard spheres in an equimolar stoichiometry, and postulates the densest packing at each sphere size ratio. Monte Carlo simulated annealing optimizations are seeded with all known atomic inorganic crystal structures, and the search is performed within the degrees of freedom associated with each homogeneous AB structure type. Structures isopointal to the FeB structure type are found to have the highest packing fraction at all sphere size ratios. The optimized structures match or improve on the best previously demonstrated packings of this type, and show that compound structures can pack more densely than segregated close-packed structures at all radius ratios less than 0.62.},
}

      

This paper considers the homogeneous packing of binary hard spheres in an equimolar stoichiometry, and postulates the densest packing at each sphere size ratio. Monte Carlo simulated annealing optimizations are seeded with all known atomic inorganic crystal structures, and the search is performed within the degrees of freedom associated with each homogeneous AB structure type. Structures isopointal to the FeB structure type are found to have the highest packing fraction at all sphere size ratios. The optimized structures match or improve on the best previously demonstrated packings of this type, and show that compound structures can pack more densely than segregated close-packed structures at all radius ratios less than 0.62.

Phase Diagram and Structural Diversity of the Densest Binary Sphere Packings Adam B. Hopkins, Yang Jiao, Frank H. Stillinger, Salvatore Torquato, Physical Review Letters, 2011

Densest binary sphere packings Adam B. Hopkins, Frank H. Stillinger, Salvatore Torquato, Physical Review E, 2012

Geometrical Frustration and Static Correlations in a Simple Glass Former Benoit Charbonneau, Patrick Charbonneau, Gilles Tarjus, Physical Review Letters, 2012

Structural phases in non-additive soft-disk mixtures: Glasses, substitutional order, and random tilings Asaph Widmer-Cooper, Peter Harrowell, Journal of Chemical Physics, 2011

Phase diagram of hard snowman-shaped particles Matthew Dennison, Kristina Milinkovi ́c, Marjolein Dijkstra, Journal of Chemical Physics, 2012

Dense Sphere Packing in the NaZn13 Structure Type Toby S. Hudson, The Journal of Physical Chemistry C, 2010

Electrophoretic deposition of binary energetic composites Kyle Thomas Sullivan, Marcus Andre Worsley, Joshua David Kuntz, Alex Eydmann Gash, Combustion and Flame, 2012

Multicomponent periodic nanoparticle superlattices Paul Podsiadlo, Galyna Krylova, Arnaud Demortière, Elena Shevchenko, Journal of Nanoparticle Research, 2011

Structural searches using isopointal sets as generators: densest packings for binary hard sphere mixtures Toby S. Hudson, Peter Harrowell, Journal of Physics: Condensed Matter, 2011

Prediction of binary hard-sphere crystal structures Laura Filion, Marjolein Dijkstra, Physical Review E, 2009

Efficient Method for Predicting Crystal Structures at Finite Temperature: Variable Box Shape Simulations Laura Filion, Matthieu Marechal, Bas van Oorschot, Daniel Pelt, Frank Smallenburg, Marjolein Dijkstra, Physical Review Letters, 2009

Dense Packings of Hard Spheres of Different Sizes Based on Filling Interstices in Uniform Three-Dimensional Tilings Toby S. Hudson, Peter Harrowell, The Journal of Physical Chemistry B, 2008

Crystal nucleation in binary hard-sphere mixtures: the effect of order parameter on the cluster composition Ran Ni†, Frank Smallenburg†, Laura Filion, Marjolein Dijkstra, Molecular Physics, 2011

New High Density Packings of Similarly-Sized Binary Spheres Patrick I. O'Toole, Toby S. Hudson, The Journal of Physical Chemistry C, 2011

Structural search for dense packing of concave and convex shapes in two dimensions Nabiha T Elias, Toby S Hudson, Journal of Physics: Conference Series, 2012

On the Phase Behavior of Binary Mixtures of Nanoparticles Avi Ben-Simon, Hagai Eshet, Eran Rabani, ACS Nano, 2013

Favoured Local Structures in Liquids and Solids: a 3D Lattice Model Pierre Ronceray, Peter Harrowell, The Self Journal of Science, 2015

Packing concave molecules in crystals and amorphous solids: on the connection between shape and local structure Cerridwen Jennings, Malcolm Ramsay, Toby Hudson, Peter Harrowell, Molecular Physics, 2015

Binary nanoparticle superlattices of soft-particle systems Alex Travesset, Proceedings of the National Academy of Sciences, 2015

A Geometric-Structure Theory for Maximally Random Jammed Packings Jianxiang Tian, Yaopengxiao Xu, Yang Jiao, Salvatore Torquato, Scientific Reports, 2015