--- title: "Helmut Schmid — author profile and papers" description: "Helmut Schmid, Technische Universität Darmstadt: 3 papers on Elamur Research (2004–2008), h-index 24 — affiliations, topics, co-authors and who cites…" canonical: "https://research.elamur.ai/free/en/authors/helmut-schmid/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/helmut-schmid/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Helmut Schmid # Helmut Schmid Helmut Schmid works in computational linguistics, on the tools that assign linguistic structure to text: part-of-speech tagging, morphological analysis and syntactic parsing. The papers here keep returning to one problem, which is scale. They deal with tagsets containing hundreds of fine-grained labels, with grammars extracted from treebanks that allow vast numbers of analyses, and with word formation that produces open-ended vocabularies. The methods combine probabilistic estimation, finite-state transducers and data structures designed for speed. German is the main test language, and Czech appears as well. The most cited of these papers is [Estimation of Conditional Probabilities With Decision Trees](https://md.research.elamur.ai/free/en/papers/schmid-2008-estimation-conditional-probabilities-decision-trees/). It handles HMM tagging with very large tagsets by predicting each feature of a composite tag one after another, and it lets decision trees select the relevant context attributes in place of a hand-designed backoff order. [SMOR](https://md.research.elamur.ai/free/en/papers/schmid-2004-smor-german-computational-morphology-covering/) describes a finite-state analyser for German that treats inflection, derivation and compounding in a single system. In it, affixes are stored as lexicon entries whose features limit the bases they may attach to. The [BitPar paper](https://md.research.elamur.ai/free/en/papers/schmid-2004-efficient-parsing-highly-ambiguous-context/) presents a CKY-style parser that keeps its chart as bit arrays and joins constituents with bitwise operations. This makes heavily ambiguous treebank grammars tractable, even when every analysis is wanted rather than only the best one. The newest paper here, from 2008, is the decision-tree tagging study. It carries the earlier interest in rich German morphology into statistical tagging, treating morphological features as the internal structure of each tag. The two 2004 papers on [morphology](https://md.research.elamur.ai/free/en/topics/morphology/) and [syntax and grammar formalisms](https://md.research.elamur.ai/free/en/topics/syntax-grammar/) came before it. Together the three papers span the main topics of the work, alongside [part-of-speech tagging](https://md.research.elamur.ai/free/en/topics/part-of-speech-tagging/). Schmid is based at [Ludwig-Maximilians-Universität München](https://md.research.elamur.ai/free/en/universities/ludwig-maximilians-universitat-munchen/). Recent bylines also name the [Munich Center for Machine Learning](https://md.research.elamur.ai/free/en/universities/munich-center-for-machine-learning/) and [Technische Universität Darmstadt](https://md.research.elamur.ai/free/en/universities/technische-universitat-darmstadt/). Earlier papers came from the [University of Stuttgart](https://md.research.elamur.ai/free/en/universities/university-of-stuttgart/). Co-authors on the papers here include [Florian Laws](https://md.research.elamur.ai/free/en/authors/florian-laws/). Helmut Schmid has 3 papers in our library, in 2004–2008, most of them on [Part-of-speech tagging](https://md.research.elamur.ai/free/en/topics/part-of-speech-tagging/), [Morphology](https://md.research.elamur.ai/free/en/topics/morphology/), [Syntax & grammar formalisms](https://md.research.elamur.ai/free/en/topics/syntax-grammar/); often with [Florian Laws](https://md.research.elamur.ai/free/en/authors/florian-laws/). 3 papers in our library · 2004–2008 current affiliation [Technische Universität Darmstadt](https://md.research.elamur.ai/free/en/universities/technische-universitat-darmstadt/) · Darmstadt Germany; [Munich Center for Machine Learning](https://md.research.elamur.ai/free/en/universities/munich-center-for-machine-learning/) · Munich; [Ludwig-Maximilians-Universität München](https://md.research.elamur.ai/free/en/universities/ludwig-maximilians-universitat-munchen/) · Munich Germany [OpenAlex](https://openalex.org/A5027452875) · [ORCID](https://orcid.org/0000-0001-8003-7708) · [**h-index 24**](https://openalex.org/authors/A5027452875) · [93 works](https://openalex.org/works?filter=author.id:A5027452875) · [2,962 citations](https://openalex.org/works?filter=author.id:A5027452875&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [3 works in our library](https://md.research.elamur.ai/free/en/authors/helmut-schmid/#papers) · [409 citations in our library](https://md.research.elamur.ai/free/en/authors/helmut-schmid/cited-by/) · 6 more works in our library · [⭐ Paper Star rank #2455](https://md.research.elamur.ai/free/en/paper-stars/page/25/#star-2455) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Helmut+Schmid) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Helmut+Schmid) · [dblp](https://dblp.org/search?q=Helmut+Schmid) · [ACL Anthology](https://aclanthology.org/search/?q=Helmut+Schmid) ## Affiliations [🎓**Ludwig-Maximilians-Universität München** Munich · Germany 2013–2026 · 54 papers*current*](https://md.research.elamur.ai/free/en/universities/ludwig-maximilians-universitat-munchen/) · [🎓**Munich Center for Machine Learning** Munich 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/universities/munich-center-for-machine-learning/) · [🎓**Technische Universität Darmstadt** Darmstadt · Germany 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/universities/technische-universitat-darmstadt/) · [🎓**University of Stuttgart** Stuttgart · Germany 2000–2013 · 32 papers](https://md.research.elamur.ai/free/en/universities/university-of-stuttgart/) · [🎓**University of Maryland, College Park** College Park · United States 2024 · 2 papers](https://md.research.elamur.ai/free/en/universities/university-of-maryland-college-park/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 3 more institutions on single bylines are not listed. ## Topics [Part-of-speech tagging 1](https://md.research.elamur.ai/free/en/topics/part-of-speech-tagging/) · [Morphology 1](https://md.research.elamur.ai/free/en/topics/morphology/) · [Syntax & grammar formalisms 1](https://md.research.elamur.ai/free/en/topics/syntax-grammar/) ## Works by year ### 2000s [**2008** 1 paper](https://md.research.elamur.ai/free/en/papers/schmid-2008-estimation-conditional-probabilities-decision-trees/) · [**2004** 2 papers](https://md.research.elamur.ai/free/en/authors/helmut-schmid/year/2004/) ## Papers The most cited first (OpenAlex and our library). 1. **[Estimation of Conditional Probabilities With Decision Trees and an Application to Fine-Grained POS Tagging](https://md.research.elamur.ai/free/en/papers/schmid-2008-estimation-conditional-probabilities-decision-trees/)** *(2008 · 254 citations)* The paper tackles HMM part-of-speech tagging with very large, morphologically detailed tagsets, such as the Tiger treebank tagset for German (over 700 tags) and the Czech Academic Corpus tagset (about 1200 tags). 2. **[SMOR: A German Computational Morphology Covering Derivation, Composition and Inflection](https://md.research.elamur.ai/free/en/papers/schmid-2004-smor-german-computational-morphology-covering/)** *(2004 · 244 citations)* SMOR addresses a gap in German computational morphology. Earlier finite-state systems either depended mainly on large word lists (WordManager, GerTWOL) or handled only part of the problem: DMOR has no derivation component, and DeKo has no inflection. SMOR covers productive derivation, composition and inflection in a… 3. **[Efficient Parsing of Highly Ambiguous Context-Free Grammars with Bit Vectors](https://md.research.elamur.ai/free/en/papers/schmid-2004-efficient-parsing-highly-ambiguous-context/)** *(2004 · 209 citations)* Treebank-derived context-free grammars give good coverage but are massively ambiguous. Ordinary chart parsers often exhaust memory or time on them, especially when every analysis is needed and not only the single best one. Schmid presents BitPar, a CKY-style parser that keeps the number of edges and instead makes… ## Also in our library 6 more works of theirs are in our library without a page here yet; they will appear as we publish them. ## Co-authors here 1 co-author with a page, the most papers together first. - [Florian Laws](https://md.research.elamur.ai/free/en/authors/florian-laws/) ## Cited by Papers of our library cite their works 409 times (of the 140,884 papers whose bibliographies we read); [30 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/helmut-schmid/cited-by/).