Patrick Sturt


2011

pdf
A Model of Discourse Predictions in Human Sentence Processing
Amit Dubey | Frank Keller | Patrick Sturt
Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing

2006

pdf
Integrating Syntactic Priming into an Incremental Probabilistic Parser, with an Application to Psycholinguistic Modeling
Amit Dubey | Frank Keller | Patrick Sturt
Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics

2005

pdf
Parallelism in Coordination as an Instance of Syntactic Priming: Evidence from Corpus-based Modeling
Amit Dubey | Patrick Sturt | Frank Keller
Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing

2004

pdf bib
Competence and Performance Grammar in Incremental Processing
Vincenzo Lombardo | Alessandro Mazzei | Patrick Sturt
Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together

pdf
Incrementality in Syntactic Processing: Computational Models and Experimental Evidence
Patrick Sturt
Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together

2002

pdf
Towards a Dynamic Version of TAG
Vincenzo Lombardo | Patrick Sturt
Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6)

1996

pdf
Book Reviews: Japanese Sentence Processing
Patrick Sturt
Computational Linguistics, Volume 22, Number 1, March 1996

1995

pdf
A Labelled Analytic Theorem Proving Environment for Categorial Grammar
Saturnino F. Luz-Filho | Patrick Sturt
Proceedings of the Fourth International Workshop on Parsing Technologies

We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can be captured by assigning different properties to the labelling algebra. The theorem proving strategy is particularly well suited to the treatment of categorial grammar, because it allows us to distribute the computational cost between the algorithm which deals with the grammatical types and the algebraic checker which constrains the derivation.

pdf
Incorporating “Unconscious Reanalyses” into an Incremental, Monotonic Parser
Patrick Sturt
Seventh Conference of the European Chapter of the Association for Computational Linguistics