« Analyseur prédictif » : différence entre les versions


m (Remplacement de texte — « Catégorie:Traitement du langage naturel » par «  »)
Aucun résumé des modifications
Ligne 1 : Ligne 1 :
== Définition ==
Parsing algorithm that operates top-down, starting with the start symbol, and predicting or guessing which grammar rule to used to rewrite the current sentential form.


== en construction ==
Alternative grammar rules are stacked so that they can be explored (using backtracking) if the current sequences of guesses turns out to be wrong.
[[Catégorie:Vocabulary]]


[[Catégorie:UNSW]]
On general context-free grammars, a vanilla predictive parser takes exponential parsing time (i.e. it can be very very slow). See also bottom-up parsers.
 
 
== Définition ==
xxxxxxx


== Français ==
== Français ==
xxxxxxx
'''analyseur prédictif'''
   
   
== Anglais ==
== Anglais ==
'''predictive parser'''
'''predictive parser'''


A predictive parser is a parsing algorithm that operates top-down, starting with the start symbol, and predicting or guessing which grammar rule to used to rewrite the current sentential form Alternative grammar rules are stacked so that they can be explored (using backtracking) if the current sequences of guesses turns out to be wrong.
'''predictive analyzer'''


On general context-free grammars, a vanilla predictive parser takes exponential parsing time (i.e. it can be very very slow). See also bottom-up parsers.
'''expectation-driven parser'''




<small>
<small>


[http://www.cse.unsw.edu.au/~billw/nlpdict.html  Source : UNWS Natural Language Processing Dictionary ]
[http://www.cse.unsw.edu.au/~billw/nlpdict.html  Source : UNWS Natural Language Processing Dictionary ]
[Catégorie:vocabulary]

Version du 8 juin 2021 à 09:12

Définition

Parsing algorithm that operates top-down, starting with the start symbol, and predicting or guessing which grammar rule to used to rewrite the current sentential form.

Alternative grammar rules are stacked so that they can be explored (using backtracking) if the current sequences of guesses turns out to be wrong.

On general context-free grammars, a vanilla predictive parser takes exponential parsing time (i.e. it can be very very slow). See also bottom-up parsers.

Français

analyseur prédictif

Anglais

predictive parser

predictive analyzer

expectation-driven parser



Source : UNWS Natural Language Processing Dictionary

[Catégorie:vocabulary]