Stephen Clark

6 paper cards in Mova's library · 2004–2019

Stephen Clark wrote 6 of the papers Mova reads, in 2004–2019, most of them on Dependency parsing, Machine translation; often with James R. Curran, James Curran, Kris Cao.

OpenAlex · ORCID · h-index 55 · 10787 citations · 406 works — openalex, 2026-10-18

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 · ORCID

Topics: Dependency parsing 1 · Machine translation 1

Ideas Mova took (2)

From the ideas ledger: an idea tried, kept or queued, or measured with no gain, and what it gave.

kept — Mova construction corpus: about 700 sentences of our own across seven constructions (object and subject relatives, reduced relatives, wh-questions, tough adjectives, free relatives), held out from training; report recall per construction for en and gparse on… (Unbounded Dependency Recovery for Parser Evaluation · en/data/constructions.tsv: 110 own sentences, 11 constructions, 220 arcs; EWT+ESLSpok model 61.8 recall, en.bin 0.4 70.0, after the parser changes 65.5…)
kept — en parse-eval as a construction gate: a release fails if any construction falls below its last-release value even when LAS rises; check that the gate goes red on a deliberately broken tagger (the negative control). (Unbounded Dependency Recovery for Parser Evaluation · en construct-eval gate with per-model floors; negative control (tags shifted one word) turns all 11 constructions red (61.8 -> 3.6); commit 25d072835)

Papers

Factorising AMR generation through syntax (2019)
The paper splits AMR generation into two steps. A syntax model first produces a delexicalised constituency tree (only the part-of-speech shape of the sentence) from the AMR; a lexicalisation model then fills in the words given the tree and the AMR. Both are sequence-to-sequence models that share the AMR encoder, and…
Unbounded Dependency Recovery for Parser Evaluation (2009) 2 ideas kept
The authors build a parser-evaluation corpus of around 700 sentences annotated with unbounded dependencies in seven grammatical constructions.
A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing (2008) measured
The paper compares graph-based and transition-based dependency parsing within one framework based on beam search and a discriminatively trained perceptron.
Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models (2007)
The article gives a full log-linear parsing model for a CCG grammar extracted automatically from CCGbank. Discriminative training needs the incorrect parses of every training sentence, which is feasible only because a Maximum Entropy supertagger keeps the charts small. Estimation needs up to 25 GB of memory and runs…
Formalism-Independent Parser Evaluation with CCG and DepBank (2007)
Parsers that use different formalisms produce different output, so their scores cannot be compared directly.
The Importance of Supertagging for Wide-Coverage CCG Parsing (2004)
The paper shows how a supertagger, which gives each word only a few CCG categories, speeds up a wide-coverage log-linear CCG parser.

Co-authors (6)

This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/authors/stephen-clark/