World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
42
Citations
10800
World Ranking
8215
National Ranking
3524

Research.com Recognitions

  • 1994 - ACM Fellow For their pioneering work in programming environments that integrated source-language debuggers, fully compatible integrated interpreter/compiler, automatic change management, structure-based editing, logging facilities, interactive graphics, and analysi
  • 1992 - ACM Software System Award Daniel G. Bobrow, Richard R. Burton, L. Peter Deutsch, Ronald M. Kaplan, Larry Masinter, Warren Teitelman

Overview

Ronald M. Kaplan is affiliated with Stanford University in the United States. Their research spans multiple fields, with a strong emphasis on computer science, particularly in artificial intelligence and computational linguistics. Kaplan's work intersects with both arts and humanities, reflecting a multidisciplinary approach.

The main areas of study covered by Kaplan include natural language processing techniques and syntax, semantics, and linguistic variation. Additional topics addressed in their research include topic modeling, speech and dialogue systems, semigroups and automata theory, and chemical synthesis and analysis. This variety indicates a broad engagement with both theoretical and applied aspects of computational studies and linguistics.

Kaplan has published extensively in the venue Computational Linguistics, where several of their recent papers have appeared. Notable publications include:

  • Tractable Lexical-Functional Grammar, 2020, Computational Linguistics
  • Obituary: Martin Kay, 2021, Computational Linguistics
  • LFG Generation from Acyclic F-Structures is NP-Hard, 2021, Computational Linguistics

Their frequent co-authors are Jürgen Wedekind, Hans Uszkoreit, and Joan Bresnan, with multiple collaborations on recent publications. This co-authorship includes work primarily with Wedekind, who has collaborated on two of the listed recent papers.

Kaplan's recognition within the academic and computing communities is evidenced by awards such as the ACM Fellow distinction received in 1994, awarded for pioneering work in programming environments involving source-language debuggers, integrated interpreter/compiler systems, and interactive graphics. Earlier, Kaplan was part of a team awarded the ACM Software System Award in 1992, acknowledging contributions to software system development.

Best Publications

  • Lexical Functional Grammar A Formal System for Grammatical Representation

    Ronald M Kaplan

  • Regular models of phonological rule systems

    Ronald M. Kaplan;Martin Kay

  • GUS, a frame driven dialog system

    D Bobrow

  • Cross-Serial Dependencies in Dutch

    Joan Bresnan;Ronald M. Kaplan;Stanley Peters;Annie Zaenen

  • Parsing the Wall Street Journal using a Lexical-Functional Grammar and Discriminative Estimation Techniques

    Stefan Riezler;Tracy H. King;Ronald M. Kaplan;Richard Crouch

  • Two-level morphology with composition

    Lauri Karttunen;Ronald M. Kaplan;Annie Zaenen

  • Finite-state transduction of related word forms for text indexing and retrieval

    Douglass R. Cutting;Per-Kristian G. Halvorsen;Ronald M. Kaplan;Lauri Karttunen

  • The interface between phrasal and functional constraints

    John T. Maxwell;Ronald M. Kaplan

  • Feature Indeterminacy and Feature Resolution.

    Mary Dalrymple;Ronald M. Kaplan

  • Formal issues in lexical-functional grammar

    Kim Honeyford;Mary Dalrymple;Ronald M. Kaplan;John T. Maxwell

  • Augmented transition networks as psychological models of sentence comprehension

    Ronald M. Kaplan

  • The PARC 700 Dependency Bank

    Tracy Holloway King;Richard S. Crouch;Stefan Riezler;Mary Dalrymple

  • Compact encoding of multi-lingual translation dictionaries

    Ronald M. Kaplan;Atty T. Mullins

  • Translation by structural correspondences

    Ronald M. Kaplan;Klaus Netter;Jürgen Wedekind;Annie Zaenen

  • Method and apparatus for supplementing significant portions of a document selected without document image decoding with retrieved information

    M. Margaret Withgott;William Newman;Steven C. Bagley;Daniel P. Huttenlocher

  • The Formal Architecture of Lexical-Functional Grammar.

    Ronald M. Kaplan

  • Speed and Accuracy in Shallow and Deep Stochastic Parsing

    Ronald M. Kaplan;Stefan Riezler;Tracy Holloway King;John T. Maxwell

  • SYSTEM FOR USING AND GENERATING USER INTEREST REFLECTION TYPE SEARCH RESULT DESIGNATOR

    Daniel G Boburo;Kaplan Ronald M

  • Method and apparatus for determining the frequency of words in a document without document image decoding

    Todd A. Cass;Daniel P. Huttenlocher;Per-Kristian Halvorsen;M. Margaret Withgott

  • Method and apparatus for tokenizing text

    Ronald M. Kaplan

  • Projections and Semantic Description in Lexical-Functional Grammar.

    Per-Kristian Halvorsen;Ronald M. Kaplan

Frequent Co-Authors

Lauri Karttunen
Lauri Karttunen Stanford University
Daniel G. Bobrow
Daniel G. Bobrow Palo Alto Research Center
John Seely Brown
John Seely Brown Palo Alto Research Center
Stefan Riezler
Stefan Riezler Heidelberg University
Jan O. Pedersen
Jan O. Pedersen Microsoft (United States)
Yusuke Miyao
Yusuke Miyao University of Tokyo
Josef van Genabith
Josef van Genabith Saarland University
Joakim Nivre
Joakim Nivre Uppsala University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring alternative education options in computer science can help you tailor your learning journey to your personal goals and circumstances. For those seeking a quick start, online associates degrees are an accessible choice, providing foundational skills and opening doors to entry-level roles or further study.

Budget is a major factor for many students. By considering the cheapest online college options, you can earn a recognized degree without overwhelming financial stress. This approach allows you to gain valuable credentials at a fraction of the typical cost.

Academic records don’t always reflect a student’s true potential. If your high school GPA isn’t the strongest, don’t worry—there are universities for low gpa that welcome applicants with diverse backgrounds, offering pathways into computer science and technology fields.

Interested in branching out? The field of computer science overlaps with many disciplines. If you’re environmentally conscious, it might be helpful to see what can you get with an environmental science degree. Combining knowledge from multiple areas can expand your career opportunities in both tech and sustainability.

Best Scientists Citing Ronald M. Kaplan

Trending Scientists

Recently Published Articles