analyse déterministe

Traductions

• anglais

  Auteur : Office québécois de la langue française, 1997

  Définition

  A deterministic parser is, in the strictest sense, one that operates on the input text left-to-right and is able to correctly classify every word and construct every syntactic category as it appears.

  Notes :

  The central notion is that a deterministic parser should commit itself to an analysis based on what it already knows. However, given enough lookahead, this definition becomes vacuous, so one might more accurately say that a deterministic parser completely avoids l)acktracking and places finite restrictions on lookahead. A positive advantage claimed for deterministic parsing is that it is one way of overcoming the problem of local ambiguity.
  
  Whilst it is unlikely that such an "optimal parser" for natural language will ever be built, its opposite, a parser that explores every possible parse, is inefficient and is intuitively unconvincing as a psycholinguistic model. The term "deterministic parsing" has come to refer to something less than the operations of a strictly deterministic parser, though the minimum of relaxation is implied.

  Termes :

  1. deterministic parsing
  2. deterministic analysis