Максимум ықтималдықпен парсинг
task
ID: maximumlikelihoodparsing
Related Papers
Relating Probabilistic Grammars and Automata
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic push- down automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two …...