Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling

Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model estimates the probabilities according to a generalized k-grammar scheme for trees. It allows for faster parsing, decreases considerably the perplexity of the test samples and tends to give more structured and refined parses. However, it suffers from the problem of incomplete coverage. In this paper, we compare several smoothing techniques such as backing-off or interpolation that are used to avoid assigning zero probability to any sentence.

• Type: Conference
• Year: 2003
• Where: IBPRIA
• Authors: Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafael C. Carrasco
• Keywords: Faster Parsing, IBPRIA 2003, Image Analysis, Probabilistic Context-free Grammar, Tree Bank Corpus