Past Meetup

Papers We Love Kyiv, Spring 2018

This Meetup is past

52 people went

Location image of event venue


First Papers We Love Kyiv meetup this year!
• The first talk: HyperLogLog by Eugen Kosteev (~ 40 min)
• The second talk: Parsing with derivatives by Artem Mishchenko (~40 min)
• The third talk: Link Grammar by Dmytro Yakymets (~ 20 min)
• The time: 5th of April, 18:00
• The place: Takeoff Technologies Kyiv, Saksahanskoho str. 40/85

We aim for the conference to take approx. 2 hours

• HyperLogLog by Eugen Kosteev
‣ Abstract: HyperLogLog is dedicated to estimating the number of distinct elements (the cardinality) of very large data ensembles. Using an auxiliary memory of m units (typically, "short bytes''), HyperLogLog performs a single pass over the data and produces an estimate of the cardinality such that the relative accuracy (the standard error) is typically about 1.04/sqrt(m). This improves on the best previously known cardinality estimator, LogLog, whose accuracy can be matched by consuming only 64% of the original memory.
‣ Bio: Eugen is a Big Data Engineer at Tubular Labs with more than 5 years of experience. Prior to his current role he worked as a Senior Programmer on such projects as Hotelcard and He enjoys algorithms, competitive programming and will be happy to guide you through the paper.

• Link Grammar by Dmytro Yakymets
‣ Abstract: We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system.
‣ Bio: Dmytro is a Consultant with experience in building private blockchains and research projects in different fields. Passionate linguist, with interests in NLP, worldbuilding and conlangs.

• Parsing with derivatives by Artem Mishchenko
‣ Abstract: We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski's derivative from regular expressions to context-free grammars. The second approach is based on a generalization of the derivative to parser combinators.
‣ Bio: Artem is a Senior Software Engineer with more than 9 years in the industry, currently working at Takeoff Technologies. His main interests are PLs with different paradigms (Lisps in particular), and chess