World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
29775
World Ranking
7344
National Ranking
3197

Overview

Charles J. Fillmore was affiliated with the University of California, Berkeley in the United States. Throughout their career, they contributed to academic research in linguistic theory and related disciplines.

Information regarding Charles J. Fillmore's recent papers, frequent co-authors, publication venues, fields and subfields of study, main topics covered, and awards is not available in the provided data. Similarly, there are no records of book publications linked to their name in the source.

The absence of published articles and co-author data limits the ability to detail specific collaborative networks or publication patterns. There is no public record in the source data of research focus areas or primary topics that the scientist engaged with during their career.

Charles J. Fillmore has been noted as deceased. The profile therefore references their contributions and affiliations in the past tense.

Best Publications

  • THE CASE FOR CASE.

    Charles J. Fillmore

  • Regularity and Idiomaticity in Grammatical Constructions: The Case of Let Alone

    Charles J. Fillmore;Paul Kay;Mary Catherine O'Connor

  • The Berkeley FrameNet Project

    Collin F. Baker;Charles J. Fillmore;John B. Lowe

  • Grammatical constructions and linguistic generalizations: The What's X doing Y? construction

    Paul Kay;Charles J. Fillmore

  • Frames and the semantics of understanding

    C. J. Fillmore

  • FRAME SEMANTICS AND THE NATURE OF LANGUAGE

    Charles J. Fillmore

  • Background to Framenet

    Charles J. Fillmore;Christopher R. Johnson;Miriam R.L. Petruck

  • The Case for Case Reopened

    Charles J. Fillmore

  • The Mechanisms of "Construction Grammar"

    Charles J. Fillmore

  • A Frames Approach to Semantic Analysis

    Charles J. Fillmore;Collin Baker

  • Studies in Linguistic Semantics

    Charles John Fillmore;D. Terence Langendoen

  • Pragmatically Controlled Zero Anaphora

    Charles J. Fillmore

  • Types of Lexical Information

    Charles J. Fillmore

  • Towards a Descriptive Framework for Spatial Deixis

    Charles J. Fillmore

  • The Structure of the Framenet Database

    Collin F. Baker;Charles J. Fillmore;Beau Cronin

  • Towards Best Practice for Multiword Expressions in Computational Lexicons

    Nicoletta Calzolari;Charles J. Fillmore;Ralph Grishman;Nancy Ide

  • Some Problems for Case Grammar

    Charles J. Fillmore

  • The Position of Embedding Transformations in a Grammar

    Charles J. Fillmore

  • The Grammar of HITTING and BREAKING

    Charles J. Fillmore

  • Toward a Frame-Based Lexicon: The semantics of Risk and its Neighbors

    Charles J. Fillmore;Beryl T. Atkins

  • Chapter 10 Frame semantics

    Unknown

  • Describing polysemy: the case of 'crawl'

    Charles J. Fillmore;Beryl Ts Atkins

Frequent Co-Authors

Paul Kay
Paul Kay University of California, Berkeley
William S.-Y. Wang
William S.-Y. Wang Hong Kong Polytechnic University
Nancy Ide
Nancy Ide Vassar College
René Dirven
René Dirven University of Duisburg-Essen
Ralph Grishman
Ralph Grishman New York University
Walt Wolfram
Walt Wolfram North Carolina State University
Chuck Wooters
Chuck Wooters International Computer Science Institute
Dan Jurafsky
Dan Jurafsky Stanford University
Christiane Fellbaum
Christiane Fellbaum Princeton University
Marti A. Hearst
Marti A. Hearst University of California, Berkeley

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 further studies online can significantly expand your career options in computer science. Many students now consider associate's degree online programs for a quick, affordable entry into tech roles. These programs are ideal for those seeking foundational knowledge or a faster path into the workforce.

For advanced positions and higher salaries, pursuing a master's degree is a smart choice. If time is a constraint, quick masters degrees online offer a way to upskill rapidly without putting your life on hold.

It’s also important to choose a relevant program aligned with market needs. Review options among the most valuable masters degrees to ensure your investment leads to sought-after roles in the tech sector.

Finally, don’t overlook affordability. Many affordable online courses and degrees can help minimize debt while building strong credentials for your computer science career path.

Best Scientists Citing Charles J. Fillmore

Recently Published Articles