Parsing with probabilistic strictly locally testable tree languages
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/8775
Registro completo de metadatos
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Reconocimiento de Formas e Inteligencia Artificial | en |
dc.contributor.author | Verdú Mas, José Luis | - |
dc.contributor.author | Carrasco, Rafael C. | - |
dc.contributor.author | Calera Rubio, Jorge | - |
dc.contributor.other | Universidad de Alicante. Departamento de Lenguajes y Sistemas Informáticos | en |
dc.date.accessioned | 2008-12-02T08:56:50Z | - |
dc.date.available | 2008-12-02T08:56:50Z | - |
dc.date.issued | 2005-07 | - |
dc.identifier.citation | VERDÚ MAS, José Luis; CARRASCO JIMÉNEZ, Rafael Carlos; CALERA RUBIO, Jorge. "Parsing with probabilistic strictly locally testable tree languages". IEEE Transactions on Pattern Analysis and Machine Intelligence. Vol. 27, No. 7 (July 2005). ISSN 0162-8828, pp. 1040-1050 | en |
dc.identifier.issn | 0162-8828 | - |
dc.identifier.uri | http://hdl.handle.net/10045/8775 | - |
dc.description.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. | en |
dc.description.sponsorship | Work supported by the Spanish Comisión Interministerial de Ciencia y Tecnología through grants TIC2003-08496-C04 and TIC2003-08681-C02-01. | en |
dc.language | eng | en |
dc.publisher | IEEE | en |
dc.subject | Parsing with probabilistic grammars | en |
dc.subject | Stochastic learning | en |
dc.subject | Tree grammars | en |
dc.subject.other | Lenguajes y Sistemas Informáticos | en |
dc.subject.other | Ciencia de la Computación e Inteligencia Artificial | en |
dc.title | Parsing with probabilistic strictly locally testable tree languages | en |
dc.type | info:eu-repo/semantics/article | en |
dc.peerreviewed | si | en |
dc.identifier.doi | 10.1109/TPAMI.2005.144 | - |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | - |
Aparece en las colecciones: | INV - GRFIA - Artículos de Revistas INV - TRANSDUCENS - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
MergePDFs.pdf | 490,77 kB | Adobe PDF | Abrir Vista previa | |
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.