Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-26T09:27:22.686Z Has data issue: false hasContentIssue false
  • English
  • Français

Parsing with discontinuous phrases

Published online by Cambridge University Press:  01 September 1999

ALLAN RAMSAY
ALLAN RAMSAY
Affiliation:
Centre for Computational Linguistics, UMIST, PO Box 88, Manchester M60 1QD, UK; e-mail: allan@ccl.umist.ac.uk
Get access Rights & Permissions [Opens in a new window]

Abstract

Most parsing algorithms require phrases that are to be combined to be either contiguous or marked as being ‘extraposed’. The assumption that phrases which are to be combined will be adjacent to one another supports rapid indexing mechanisms: the fact that in most languages items can turn up in unexpected locations cancels out much of the ensuing efficiency. The current paper shows how ‘out of position’ items can be incorporated directly. This leads to efficient parsing even when items turn up having been right-shifted, a state of affairs which makes Johnson and Kay's (1994) notion of ‘sponsorship’ of empty nodes inapplicable.

Type
Research Article
Information
Natural Language Engineering , Volume 5 , Issue 3 , September 1999 , pp. 271 - 300
Copyright
© 1999 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.)