#### Filter Results:

- Full text PDF available (155)

#### Publication Year

1955

2018

- This year (21)
- Last 5 years (82)
- Last 10 years (132)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Stephen Clark, James R. Curran
- Computational Linguistics
- 2007

This paper describes a number of log-linear parsing models for an automatically extracted lexicalized grammar. The models are “full” parsing models in the sense that probabilities are defined for… (More)

- Stephen Clark, James R. Curran
- ACL
- 2004

This paper describes and evaluates log-linear parsing models for Combinatory Categorial Grammar (CCG). A parallel implementation of the L-BFGS optimisation algorithm is described, which runs on a… (More)

- Bob Coecke, Mehrnoosh Sadrzadeh, Stephen Clark
- ArXiv
- 2010

We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, for which we rely on… (More)

- James R. Curran, Stephen Clark, Johan Bos
- ACL
- 2007

The statistical modelling of language, together with advances in wide-coverage grammar development, have led to high levels of robustness and efficiency in NLP systems and made linguistically… (More)

- Johan Bos, Stephen Clark, Mark Steedman, James R. Curran, Julia Hockenmaier
- COLING
- 2004

This paper shows how to construct semantic representations from the derivations produced by a wide-coverage CCG parser. Unlike the dependency structures returned by the parser itself, these can be… (More)

- Stephen Clark, James R. Curran
- COLING
- 2004

This paper describes the role of supertagging in a wide-coverage CCG parser which uses a log-linear model to select an analysis. The supertagger reduces the derivation space over which model… (More)

- Stephen Clark, David J. Weir
- NAACL
- 2001

This article concerns the estimation of a particular kind of probability, namely, the probability of a noun sense appearing as a particular argument of a predicate. In order to overcome the… (More)

- Yue Zhang, Stephen Clark
- EMNLP
- 2008

Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the… (More)

- James R. Curran, Stephen Clark
- CoNLL
- 2003

Named Entity Recognition (NER) systems need to integrate a wide variety of information for optimal performance. This paper demonstrates that a maximum entropy tagger can effectively encode such… (More)

- Stephen Clark, Stephen G. Pulman
- AAAI Spring Symposium: Quantum Interaction
- 2007

The are two main approaches to the representation of meaning in Computational Linguistics: a symbolic approach and a distributional approach. This paper considers the fundamental question of how… (More)