Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-22T12:42:25.786Z Has data issue: false hasContentIssue false

Parsing engineering and empirical robustness

Published online by Cambridge University Press:  21 August 2002

ROBERTO BASILI
Affiliation:
Department of Computer Science, Systems and Production, University of Rome ‘Tor Vergata’, 00133 Rome, Italy e-mail: basili@info.uniroma2.it, zanzotto@info.uniroma2.it
FABIO MASSIMO ZANZOTTO
Affiliation:
Department of Computer Science, Systems and Production, University of Rome ‘Tor Vergata’, 00133 Rome, Italy e-mail: basili@info.uniroma2.it, zanzotto@info.uniroma2.it

Abstract

Robustness has been traditionally stressed as a general desirable property of any computational model and system. The human NL interpretation device exhibits this property as the ability to deal with odd sentences. However, the difficulties in a theoretical explanation of robustness within the linguistic modelling suggested the adoption of an empirical notion. In this paper, we propose an empirical definition of robustness based on the notion of performance. Furthermore, a framework for controlling the parser robustness in the design phase is presented. The control is achieved via the adoption of two principles: the modularisation, typical of the software engineering practice, and the availability of domain adaptable components. The methodology has been adopted for the production of CHAOS, a pool of syntactic modules, which has been used in real applications. This pool of modules enables a large validation of the notion of empirical robustness, on the one side, and of the design methodology, on the other side, over different corpora and two different languages (English and Italian).

Type
Research Article
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)