We propose a theory that gives formal semantics to word-level alignments defined over parallel corpora. We use our theory to introduce a linear algorithm that can be used to deriv...
Michel Galley, Mark Hopkins, Kevin Knight, Daniel ...
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...