Lauri Karttunen


2019

pdf bib
Posing Fair Generalization Tasks for Natural Language Inference
Atticus Geiger | Ignacio Cases | Lauri Karttunen | Christopher Potts
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)

Deep learning models for semantics are generally evaluated using naturalistic corpora. Adversarial testing methods, in which models are evaluated on new examples with known semantic properties, have begun to reveal that good performance at these naturalistic tasks can hide serious shortcomings. However, we should insist that these evaluations be fair – that the models are given data sufficient to support the requisite kinds of generalization. In this paper, we define and motivate a formal notion of fairness in this sense. We then apply these ideas to natural language inference by constructing very challenging but provably fair artificial datasets and showing that standard neural models fail to generalize in the required ways; only task-specific models that jointly compose the premise and hypothesis are able to achieve high performance, and even these models do not solve the task perfectly.

pdf bib
Recursive Routing Networks: Learning to Compose Modules for Language Understanding
Ignacio Cases | Clemens Rosenbaum | Matthew Riemer | Atticus Geiger | Tim Klinger | Alex Tamkin | Olivia Li | Sandhini Agarwal | Joshua D. Greene | Dan Jurafsky | Christopher Potts | Lauri Karttunen
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers)

We introduce Recursive Routing Networks (RRNs), which are modular, adaptable models that learn effectively in diverse environments. RRNs consist of a set of functions, typically organized into a grid, and a meta-learner decision-making component called the router. The model jointly optimizes the parameters of the functions and the meta-learner’s policy for routing inputs through those functions. RRNs can be incorporated into existing architectures in a number of ways; we explore adding them to word representation layers, recurrent network hidden layers, and classifier layers. Our evaluation task is natural language inference (NLI). Using the MultiNLI corpus, we show that an RRN’s routing decisions reflect the high-level genre structure of that corpus. To show that RRNs can learn to specialize to more fine-grained semantic distinctions, we introduce a new corpus of NLI examples involving implicative predicates, and show that the model components become fine-tuned to the inferential signatures that are characteristic of these predicates.

2015

pdf bib
Limits of Natural Logic
Lauri Karttunen
Proceedings of the Second Workshop on Extra-Propositional Aspects of Meaning in Computational Semantics (ExProM 2015)

2013

pdf bib
Veridicity annotation in the lexicon? A look at factive adjectives
Annie Zaenen | Lauri Karttunen
Proceedings of the 9th Joint ISO - ACL SIGSEM Workshop on Interoperable Semantic Annotation

2012

pdf bib
Simple and Phrasal Implicatives
Lauri Karttunen
*SEM 2012: The First Joint Conference on Lexical and Computational Semantics – Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation (SemEval 2012)

2007

pdf bib
Precision-focused Textual Inference
Daniel Bobrow | Dick Crouch | Tracy Holloway King | Cleo Condoravdi | Lauri Karttunen | Rowan Nairn | Valeria de Paiva | Annie Zaenen
Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing

pdf bib
ACL Lifetime Achievement Award: Word Play
Lauri Karttunen
Computational Linguistics, Volume 33, Number 4, December 2007

2006

pdf bib
Computing relative polarity for textual inference
Rowan Nairn | Cleo Condoravdi | Lauri Karttunen
Proceedings of the Fifth International Workshop on Inference in Computational Semantics (ICoS-5)

2005

pdf bib
Local Textual Inference: Can it be Defined or Circumscribed?
Annie Zaenen | Lauri Karttunen | Richard Crouch
Proceedings of the ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment

2000

pdf bib
Introduction to the Special issue on finite state methods in NLP
Lauri Karttunen | Kemal Oflazer
Computational Linguistics, Volume 26, Number 1, March 2000

pdf bib
Finite-State Non-Concatenative Morphotactics
Kenneth R. Beesley | Lauri Karttunen
Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics

pdf bib
Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology
Jason Eisner | Lauri Karttunen | Alain Thèriault
Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology

pdf bib
Finite-State Non-Concatenative Morphotactics
Kenneth R. Beesley | Lauri Karttunen
Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology

1998

pdf bib
The Proper Treatment of Optimality in Computational Phonology
Lauri Karttunen
Finite State Methods in Natural Language Processing

1997

pdf bib
Reading more into Foreign Languages
John Nerbonne | Lauri Karttunen | Elena Paskaleva | Gabor Proszeky | Tiit Roosmaa
Fifth Conference on Applied Natural Language Processing

1996

pdf bib
Directed Replacement
Lauri Karttunen
34th Annual Meeting of the Association for Computational Linguistics

pdf bib
Parallel Replacement in Finite State Calculus
Andre Kempe | Lauri Karttunen
COLING 1996 Volume 2: The 16th International Conference on Computational Linguistics

1995

pdf bib
The Replace Operator
Lauri Karttunen
33rd Annual Meeting of the Association for Computational Linguistics

1994

pdf bib
Constructing Lexical Transducers
Lauri Karttunen
COLING 1994 Volume 1: The 15th International Conference on Computational Linguistics

pdf bib
Incremental Construction of a Lexical Transducer for Korean
Hyuk-Chul Kwon | Lauri Karttunen
COLING 1994 Volume 2: The 15th International Conference on Computational Linguistics

1992

pdf bib
Two-Level Morphology with Composition
Lauri Karttunen | Ronald M. Kaplan | Annie Zaenen
COLING 1992 Volume 1: The 15th International Conference on Computational Linguistics

1990

pdf bib
An Efficient Implementation of PATR for Categorial Unification Grammar
Todd Yampol | Lauri Karttunen
COLING 1990 Volume 2: Papers presented to the 13th International Conference on Computational Linguistics

1986

pdf bib
D-PATR: A Development Environment for Unification-Based Grammars
Lauri Karttunen
Coling 1986 Volume 1: The 11th International Conference on Computational Linguistics

1985

pdf bib
Structure Sharing with Binary Trees
Lauri Karttunen
23rd Annual Meeting of the Association for Computational Linguistics

1984

pdf bib
Features and Values
Lauri Karttunen
10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics

1983

pdf bib
Directory of Graduate Programs in Computational Linguistics
Martha Evens | Lauri Karttunen
American Journal of Computational Linguistics, Volume 9, Number 2, April-June 1983

1969

pdf bib
Discourse Referents
Lauri Karttunen
International Conference on Computational Linguistics COLING 1969: Preprint No. 69: Collection of Abstracts of Papers

pdf bib
Discourse Referents
Lauri Karttunen
International Conference on Computational Linguistics COLING 1969: Preprint No. 70