Jonathan Tepper

Dr. Jonathan Tepper

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 February 2020 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
AAAbeer Alzubaidi
Abeer Alzubaidi
Jonathan TepperJonathan Tepper
Jonathan Tepper
ALAhmad Lotfi
Ahmad Lotfi

1 December 2006 in Economics Letters
Verified
Journal Article
Closed access
JBJane M. Binner
Jane M. Binner
CEC. Thomas Elger
C. Thomas Elger
BNBirger Nilsson
Birger Nilsson
Jonathan TepperJonathan Tepper
Jonathan Tepper

1 October 2002 in Trends in Cognitive Sciences
Verified
Journal Article
Closed access
DPDominic Palmer-Brown
Dominic Palmer-Brown
Jonathan TepperJonathan Tepper
Jonathan Tepper
HPHeather M. Powell
Heather M. Powell

1 March 2016 in Knowledge-Based Systems
Verified
Journal Article
Closed access
Jonathan TepperJonathan Tepper
Jonathan Tepper
MSMahmud S. Shertil
Mahmud S. Shertil
HPHeather M. Powell
Heather M. Powell


1 June 2002 in Connection Science
Verified
Journal Article
Closed access
Jonathan TepperJonathan Tepper
Jonathan Tepper
HPHeather M Powell
Heather M Powell
DPDominic Palmer-Brown
Dominic Palmer-Brown
We describe a deterministic shift-reduce parsing model that combines the advantages of connectionism with those of traditional symbolic models for parsing realistic sub-domains of natural language. It is a modular system that learns to annotate natural language texts with syntactic structure. The parser acquires its linguistic knowledge directly from pre-parsed sentence examples extracted from an annotated corpus. The connectionist modules enable the automatic learning of linguistic constraints and provide a distributed representation of linguistic information that exhibits tolerance to grammatical variation. The inputs and outputs of the connectionist modules represent symbolic information which can be easily manipulated and interpreted and provide the basis for organizing the parse. Performance is evaluated using labelled precision and recall. (For a test set of 4128 words, precision and recall of 75% and 69%, respectively, were achieved.) The work presented represents a significant step towards demonstrating that broad coverage parsing of natural language can be achieved with simple hybrid connectionist architectures which approximate shift-reduce parsing behaviours. Crucially, the model is adaptable to the grammatical framework of the training corpus used and so is not predisposed to a particular grammatical formalism.