Abstract
We generalise existing forward and backward bisimulation minimisation algorithms for tree automata to weighted tree automata. The obtained algorithms work for all semirings and retain the time complexity of their unweighted variants for all additively cancellative semirings. On all other semirings the time complexity is slightly higher (linear instead of logarithmic in the number of states). We discuss implementations of these algorithms on a typical task in natural language processing. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Högberg, J., Maletti, A., & May, J. (2007). Bisimulation minimisation for weighted tree automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4588 LNCS, pp. 229–241). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
