The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2005 vol.27)
pp: 1040-1050
ABSTRACT
Probabilistic k-testable models (usually known as k-gram models in the case of strings) can be easily identified from samples and allow for smoothing techniques to deal with unseen events during pattern classification. In this paper, we introduce the family of stochastic k-testable tree languages and describe how these models can approximate any stochastic rational tree language. The model is applied to the task of learning a probabilistic k-testable model from a sample of parsed sentences. In particular, a parser for a natural language grammar that incorporates smoothing is shown.
INDEX TERMS
Index Terms- Parsing with probabilistic grammars, stochastic learning, tree grammars.
CITATION
Jose Luis Verd?-Mas, Rafael C. Carrasco, Jorge Calera-Rubio, "Parsing with Probabilistic Strictly Locally Testable Tree Languages", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 7, pp. 1040-1050, July 2005, doi:10.1109/TPAMI.2005.144
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool