ArticleslgStudy

computer science

Lauri Karttunen

Lauri Karttunen is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Lauri Karttunen rather than just read about it. In short: Lauri Juhani Karttunen (September 29, 1941 – March 20, 2022) was an American linguist and adjunct professor in linguistics at Stanford and an ACL Fellow. Early life and career Born in Finland, Karttunen studied the Finnish language at the University of Helsinki from 1960 to 1964.

Key takeaways

  • Lauri Karttunen belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Lauri Karttunen to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Lauri Karttunen from memory before moving on to harder problems.

Reference excerpt

Lauri Juhani Karttunen (September 29, 1941 – March 20, 2022) was an American linguist and adjunct professor in linguistics at Stanford and an ACL Fellow.

Early life and career Born in Finland, Karttunen studied the Finnish language at the University of Helsinki from 1960 to 1964. He received his Ph.D. in Linguistics in 1969 from Indiana University in Bloomington. At the University of Texas at Austin in the 1970s he worked mostly on semantics. He published a series of seminal papers on discourse referents, presuppositions, implicative verbs, conventional implicatures, and questions. In the 1980s Karttunen became, along with Ronald M. Kaplan, Martin Kay, and Kimmo Koskenniemi, one of the pioneers in computational linguistics on the application of finite-state transducers to phonology and morphology. Karttunen and Kenneth R. Beesley published a textbook on Finite State Morphology and a set of applications for creating morphological analyzers. Commercial versions of the finite-state technology developed by Karttunen and his colleagues at PARC and XRCE have been licensed by Xerox to many companies including SAP and Microsoft. Karttunen retired from PARC in 2011. He worked on Language and Natural Reasoning at CSLI.

Honors The Association for Computational Linguistics (ACL) gives each year at its Annual Meeting a "Lifetime Achievement Award." At the age of 66, Karttunen became so far the youngest recipient of the award at the 45th Meeting in Prague in 2007. In 2009 the Indiana Linguistics Department gave Karttunen a Distinguished Alumni Award Archived 2021-05-12 at the Wayback Machine. In 2011 ACL created an ACL Fellows Program. Karttunen was one of the seventeen selected for the founding group of ACL Fellows "whose contributions to the field have been most extraordinary." The European META-NET organization awarded Karttunen's XFST (Xerox Finite-State Toolkit) application a META-Seal of Recognition Archived 2012-10-16 at the Wayback Machine at the 2012 Meeting in Brussels "for software products and services that actively contribute to the European Multilingual Information Society."

Selected articles Discourse Referents. Archived 2012-10-16 at the Wayback Machine In Semantics: Critical Concepts in Linguistics. Javeier Gutiérrez-Rexach (ed.), Vol. III, pages 20–39. Routledge, 2003. Also in Syntax and Semantics 7: Notes from the Linguistic Underground, 363-85, J. D. McCawley (ed.), Academic Press, New York 1976. The first published version of the paper appeared in the Proceedings of Coling'69. Syntax and Semantics of Questions. Archived 2012-10-16 at the Wayback Machine In Formal Semantics. The Essential Readings. Paul Portner and Barbara H. Partee (eds.), pages 382–420. Blackwell, 2003. Also in Semantics: Critical Concepts in Linguistics. Javeier Gutiérrez-Rexach (ed.), Vol. V, pages 207–249. Routledge, 2003 and in Questions, H. Hiz (ed.), pages 165-210, Reidel, Dordrecht 1978. Originally appeared in Linguistics and Philosophy 1 1-44, 1977. Presupposition and Linguistic Context. Archived 2014-04-26 at the Wayback MachineTheoretical Linguistics 1 181–94, 1974. Also in Pragmatics: A Reader, Steven Davis (ed.), pages 406-415, Oxford University Press, 1991. Translation: Presuposición y contexto lingüistico. In Textos clásicos de pragmática, pages 175-192, María Teresea Julio and Ricardo Muños (eds.), Arco Libros, Madrid 1998. The Logic of English Predicate Complement Constructions. Archived 2012-10-16 at the Wayback Machine Publications of the Indiana University Linguistics Club, Bloomington 1971. Translations: Die Logik englischer Prädikatkomplement-konstruktionen. in Generative Semantik, 243–78, W. Abraham and R. Binnick (eds.), Athenaeum, Frankfurt 1973; La logique des constructions anglaises à complément prédicatif. Langages 8 56–80, 1973. Conventional Implicature. Archived 2012-10-16 at the Wayback Machine (with Stanley Peters) In Syntax and Semantics 11, Presupposition, pages 1–56, C.-K. Oh and D. A. Dinneen (eds.), Academic Press, New York 1979. Texas Linguistic Forum, Vol. 22. 1983 Archived 2012-10-16 at the Wayback Machine A special issue on Two-level morphology introducing the kimmo system. Finite-state Constraints Archived 2012-11-14 at the Wayback Machine In the Proceedings of the International Conference on Current Issues in Computational Linguistics, June 10–14, 1991. Universiti Sains Malaysia, Penang, Malaysia. Also in The Last Phonological Rule. J. Goldsmith (ed.), pages 173–194, University of Chicago Press, 1993. Computing with Realizational Morphology Archived 2012-11-14 at the Wayback Machine In Computational Linguistics and Intelligent Text Processing, Alexander Gelbukh (ed.), Lecture Notes in Computer Science, Volume 2588, pages 205–216, Springer Verlag, Heidelberg. 2003. The Insufficiency of Paper-and-Pencil Linguistics: the Case of Finnish Prosody Archived 2012-11-14 at the Wayback Machine In Intelligent Linguistic Architectures: Variations on themes by Ronald M. Kaplan, Miriam Butt, Mary Dalrymple, and Tracy Holloway King (eds.), pages 287–300, CSLI Publications, Stanford, California, 2006.

References

External links Lauri Karttunen's Home Page (Archived March 8, 2023, at the Wayback Machine) Lauri Karttunen publications indexed by Google Scholar

Worked examples

Example 1 — a first encounter with Lauri Karttunen

Start with the simplest possible case. Write down what Lauri Karttunen claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Lauri Karttunen before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Lauri Karttunen ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Lauri Karttunen

In research
Lauri Karttunen appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Lauri Karttunen in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Lauri Karttunen is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1941 births, 2022 deaths, Computational linguistics researchers, so understanding it makes those chapters shorter.
In everyday life
Look for Lauri Karttunen outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Lauri Karttunen” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Lauri Karttunen in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Lauri Karttunen means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Lauri Karttunen out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Lauri Karttunen in simple terms?

Lauri Juhani Karttunen (September 29, 1941 – March 20, 2022) was an American linguist and adjunct professor in linguistics at Stanford and an ACL Fellow. Early life and career Born in Finland, Karttunen studied the Finnish language at the University of Helsinki from 1960 to 1964.

Why does Lauri Karttunen matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Lauri Karttunen?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Lauri Karttunen.

Tags

  • 1941 births
  • 2022 deaths
  • Computational linguistics researchers
  • Fellows of the Association for Computational Linguistics
  • Finnish emigrants to the United States
  • Linguists from Finland
  • Linguists from the United States
  • Scientists at PARC (company)
  • Semanticists

Keep exploring