Richard G. Morgan

Also published as: Richard Morgan

Fixing paper assignments

  1. Please select all papers that do not belong to this person.
  2. Indicate below which author they should be assigned to.
Provide a valid ORCID iD here. This will be used to match future papers to this author.
Provide the name of the school or the university where the author has received or will receive their highest degree (e.g., Ph.D. institution for researchers, or current affiliation for students). This will be used to form the new author page ID, if needed.

TODO: "submit" and "cancel" buttons here

1995

pdf bib
University of Durham: Description of the LOLITA System as Used in MUC-6.
Richard Morgan | Roberto Garigliano | Paul Callaghan | Sanjay Poria | Mark Smith | Agnieszka Urbanowicz | Russell Collingham | Marco Costantino | Chris Cooper | The LOLITA Group
Sixth Message Understanding Conference (MUC-6): Proceedings of a Conference Held in Columbia, Maryland, November 6-8, 1995

1994

pdf bib
Translation by meaning and style in LOLITA
Richard Morgan | Mark Smith | Sengan Short
Proceedings of the Second International Conference on Machine Translation: Ten years on

pdf bib
Generation in the LOLITA System: An Engineering Approach
Mark H. Smith | Roberto Garigliano | Richard G. Morgan
Proceedings of the Seventh International Workshop on Natural Language Generation

1993

pdf bib
A New Transformation into Deterministically Parsable Form for Natural Language Grammars
Nigel R. Ellis | Roberto Garigliano | Richard G. Morgan
Proceedings of the Third International Workshop on Parsing Technologies

Marcus demonstrated that it was possible to construct a deterministic grammar/interpreter for a subset of natural language [Marcus, 1980]. Although his work with PARSIFAL pioneered the field of deterministic natural language parsing, his method has several drawbacks: • The rules and actions in the grammar / interpreter are so embedded that it is difficult to distinguish between them. • The grammar / interpreter is very difficult to construct (the small grammar shown in [Marcus, 1980] took about four months to construct). • The grammar is very difficult to maintain, as a small change may have several side effects. This paper outlines a set of structure transformations for converting a non-deterministic grammar into deterministic form. The original grammar is written in a context free form; this is then transformed to resolve ambiguities.
Search
Co-authors
Venues
Fix data