JORGE CALERA RUBIO-rekin lankidetzan egindako argitalpenak (13)

2005

  1. Parsing with probabilistic strictly locally testable tree languages

    IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, Núm. 7, pp. 1040-1050

  2. Smoothing and compression with stochastic k-testable tree languages

    Pattern Recognition, Vol. 38, Núm. 9, pp. 1420-1430

2003

  1. Learning probabilistic context-free grammars from treebanks

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2905, pp. 537-544

  2. Smoothing techniques for tree-k-grammar-based natural language modeling

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2652, pp. 1057-1065

2002

  1. Stochastic k-testable tree languages and applications

    Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

  2. Tree k-grammar models for natural language modelling and parsing

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2001

  1. Stochastic inference of regular tree languages

    Machine Learning, Vol. 44, Núm. 1-2, pp. 185-197

2000

  1. A comparison of PCFG models

    Proceedings of the 4th Conference on Computational Natural Language Learning, CoNLL 2000 and of the 2nd Learning Language in Logic Workshop, LLL 2000 - Held in cooperation with ICGI 2000

  2. Lossless compression of surfaces described as points

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. Probabilistic k-testable tree languages

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Teoría de lenguajes, gramáticas y autómatas para informáticos

    Servicio de Publicaciones

1998

  1. Computing the relative entropy between regular tree languages

    Information Processing Letters, Vol. 68, Núm. 6, pp. 283-289

  2. Stochastic inference of regular tree languages

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)