PWL #42: Blossom V and NL2Bash

• What we'll do
PWL mini:
David Murray presents NL2Bash: A Corpus and Semantic Parser for Natural Language Interface to the Linux Operating System
(https://arxiv.org/pdf/1802.08979.pdf)
"We present new data and semantic parsing methods for the problem of mapping English sentences to Bash commands (NL2Bash). Our long-term goal is to enable any user to perform operations such as file manipulation, search, and application-specific scripting by simply stating their goals in English. We take a first step in this domain, by providing a new dataset of challenging but commonly used Bash commands and expert-written English descriptions, along with baseline methods to establish performance levels on this task."

Main Event
Max Payton present Blossom V: A new implementation of a minimum cost perfect matching algorithm
(https://pub.ist.ac.at/~vnk/papers/blossom5.pdf)
"We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer as Blossom V. A key feature of our implementation is a combination of two ideas that were shown to be effective for this problem: the “variable dual updates” approach of Cook and Rohe and the use of priority queues."

Dinner will be provided! You'll be asked for info on any dietary restrictions you have during the RSVP which we'll reference when figuring out what to serve, so please let us know!

• Important to know

Big ups to Twilio for hosting this month!

As a chapter of Papers We Love we abide by and enforce the PWL Code of Conduct (https://github.com/papers-we-love/seattle/blob/master/code-of-conduct.md) at our events. Please give it a read, plan on acting like an adult, and involve one of the organizers if you need help.

Stop slacking and join us in the #seattle channel at https://papersweloveslack.herokuapp.com!