153 citations · 236 across the 7 of their papers we have counts for
7 papers
Posing Fair Generalization Tasks for Natural Language Inference
Atticus Geiger, Ignacio Cases, Lauri Karttunen +1
Deep learning models for semantics are generally evaluated using naturalistic corpora. Adversarial methods, in which models are evaluated on new examples with known semantic proper…
Stress-Testing Neural Models of Natural Language Inference with Multiply-Quantified Sentences
Atticus Geiger, Ignacio Cases, Lauri Karttunen +1
Standard evaluations of deep learning models for semantics using naturalistic corpora are limited in what they can tell us about the fidelity of the learned representations, becaus…
Finite-State Phonology: Proceedings of the 5th Workshop of the ACL Special Interest Group in Computational Phonology (SIGPHON)
Jason Eisner, Lauri Karttunen, Alain Theriault
Home page of the workshop proceedings, with pointers to the individually archived papers. Includes front matter from the printed version of the proceedings.
Finite-State Non-Concatenative Morphotactics
Kenneth R. Beesley, Lauri Karttunen
Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators…
The Proper Treatment of Optimality in Computational Phonology
Lauri Karttunen
This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison (1994), the new approac…
Parallel Replacement in Finite State Calculus
Andre Kempe, Lauri Karttunen
This paper extends the calculus of regular expressions with new types of replacement expressions that enhance the expressiveness of the simple replace operator defined in Karttunen…
Directed Replacement
Lauri Karttunen
This paper introduces to the finite-state calculus a family of directed replace operators. In contrast to the simple replace expression, UPPER -> LOWER, defined in Karttunen (ACL-9…