• Home
• News
• Organized events
• Location

• Staff
• Students
• Technicians
• Visitors
• Former members

• Databases
• PhD Theses
• Projects
• Publications
• Software

• Access

Publications:

All

1. Rico-Juan, J.R.; Calera-Rubio, J.; Carrasco, R.C.
   "Probabilistic k-testable tree-languages"
   Lecture Notes in Computer Science - Lecture Notes in Artificial Intelligence, vol. 1891, pp. 221-228 (2000)
   : bibtex
   Abstract:

   In this paper, we present a natural generalization of $k$-gram models for tree stochastic languages based on the $k$-testable class. In this class of models, frequencies are estimated for a probabilistic regular tree grammar wich is bottom-up deterministic. One of the advantages of this approach is that the model can be updated in an incremental fashion. This method is an alternative to costly learning algorithms (as inside-outside-based methods) or algorithms that require larger samples (as many state merging/splitting methods)

@article {
 author = "Rico-Juan, J.R.; Calera-Rubio, J.; Carrasco, R.C.",
 title  = "Probabilistic k-testable tree-languages",
 journal = "Lecture Notes in Computer Science - Lecture Notes in Artificial Intelligence",
 pages = "221-228",
 volume = "1891",
 year = "2000"
}