MFST: A Python OpenFST Wrapper With Support for Custom Semirings and Jupyter Notebooks

1 code implementation • 7 Dec 2020 • Matthew Francis-Landau

This paper introduces mFST, a new Python library for working with Finite-State Machines based on OpenFST.

Evaluation of Logic Programs with Built-Ins and Aggregation: A Calculus for Bag Relations

1 code implementation • 20 Oct 2020 • Matthew Francis-Landau, Tim Vieira, Jason Eisner

We present a scheme for translating logic programs, which may use aggregation and arithmetic, into algebraic expressions that denote bag relations over ground terms of the Herbrand universe.

Programming Languages Symbolic Computation

Exact and/or Fast Nearest Neighbors

1 code implementation • 6 Oct 2019 • Matthew Francis-Landau, Benjamin Van Durme

Prior methods for retrieval of nearest neighbors in high dimensions are fast and approximate--providing probabilistic guarantees of returning the correct answer--or slow and exact performing an exhaustive search.

Data Structures and Algorithms

Capturing Semantic Similarity for Entity Linking with Convolutional Neural Networks

1 code implementation • NAACL 2016 • Matthew Francis-Landau, Greg Durrett, Dan Klein

A key challenge in entity linking is making effective use of contextual information to disambiguate mentions that might refer to different entities in different contexts.

Entity Linking Semantic correspondence +2