Elamur Research⌕
☰
home / authors / Stuart Geman

Stuart Geman

Stuart Geman has 2 papers in our library, in 1998–1999, most of them on Syntax & grammar formalisms; often with Zhiyi Chi, Mark Johnson, Stefan Riezler.

2 papers in our library · 1998–1999

OpenAlex · h-index 32 · 87 works · 27,773 citations OpenAlex, 2026-10-14

📄 2 works in our library · 🔗 Cited 96 times in our library · ⭐ Paper Stars ranking: #4373

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: Google Scholar · Semantic Scholar · dblp · ACL Anthology

 Affiliations

🎓Brown UniversityProvidence · United States1979–2020 · 47 paperscurrent🎓Columbia UniversityNew York · United States2020 · 1 papercurrent

From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 2 more institutions on single bylines are not listed.

 Concepts, shelves and topics

Of its works in our library: the number of works on each and its rating among them.

📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Artificial Intelligence · 2 worksComputer Science · 2 worksArts and Humanities · 1 workLanguage and Linguistics · 1 work

🧭 Topics 1Research subjects and languages the work is about.Syntax & grammar formalisms · 2 works

💡 Concepts 1Key ideas and methods explained on our concept pages.Context-free grammar · 1 work

 Works by year

1990s

19991 paperEstimators for Stochastic “Unification-Based” Grammars19981 paperEstimation of Probabilistic Context-Free Grammars

 Papers

The most cited first (OpenAlex and our library).

  1. Estimators for Stochastic “Unification-Based” Grammars (1999 · 244 citations)
    The paper tackles parameter estimation for stochastic versions of constraint-based ("unification-based") grammars such as LFG and HPSG.
  2. Estimation of Probabilistic Context-Free Grammars (1998 · 18 citations)
    A probabilistic context-free grammar (PCFG) can be "improper," or not tight: if production probabilities are chosen carelessly, some probability mass goes to derivations that never terminate, so finite parse trees together receive less than one.

 Co-authors here

3 co-authors with a page, the most papers together first.

Venues

Where their works here were published, the most works first, with the editions of those that have a page.

 Cited by

Papers of our library cite their works 96 times (of the 141,840 papers whose bibliographies we read); 19 citing papers with a page here →.

Updated

This page in Markdown → https://md.research.elamur.ai/free/en/authors/stuart-geman/