Minimizing Deterministic Weighted Tree Automata

  • Andreas Maletti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5196)


The problem of efficiently minimizing deterministic weighted tree automata (wta) is investigated. Such automata have found promising applications as language models in Natural Language Processing. A polynomial-time algorithm is presented that given a deterministic wta over a commutative semifield, of which all operations including the computation of the inverses are polynomial, constructs an equivalent minimal (with respect to the number of states) deterministic and total wta. If the semifield operations can be performed in constant time, then the algorithm runs in time O(rmn 4) where r is the maximal rank of the input symbols, m is the number of transitions, and n is the number of states of the input wta.


Natural Language Processing Minimization Algorithm Congruence Relation Input Symbol Tree Series 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst — a general and efficient weighted finite-state transducer library. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 11–23. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Angluin, D.: Learning regular sets from queries and counterexamples. Inform. and Comput. 75(2), 87–106 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Borchardt, B.: The Myhill-Nerode theorem for recognizable tree series. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 146–158. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybernet 16(4), 509–544 (2004)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universität Dresden (2005)Google Scholar
  6. 6.
    Borchardt, B., Vogler, H.: Determinization of finite state weighted tree automata. J. Autom. Lang. Combin. 8(3), 417–463 (2003)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Bozapalidis, S.: Effective construction of the syntactic algebra of a recognizable series on trees. Acta Inform. 28(4), 351–363 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Systems 32(1), 1–33 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoret. Comput. Sci. 27(1–2), 211–215 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Comon-Lundh, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata—techniques and applications (2007),
  11. 11.
    Drewes, F., Vogler, H.: Learning deterministically recognizable tree series. J. Autom. Lang. Combin. 12(3), 332–354 (2007)Google Scholar
  12. 12.
    Eisner, J.: Simpler and more general minimization for weighted finite-state automata. In: Human Language Technology Conf. of the North American Chapter of the Association for Computational Linguistics, pp. 64–71 (2003)Google Scholar
  13. 13.
    Frishert, M., Cleophas, L.G., Watson, B.W.: Fire station: An environment for manipulating finite automata and regular expression views. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 125–133. Springer, Heidelberg (2005)Google Scholar
  14. 14.
    Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)zbMATHGoogle Scholar
  15. 15.
    Gécseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, ch.1, vol. 3, pp. 1–68. Springer, Heidelberg (1997)Google Scholar
  16. 16.
    Graehl, J.: Carmel finite-state toolkit. ISI/USC (1997),
  17. 17.
    Habrard, A., Oncina, J.: Learning multiplicity tree automata. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 268–280. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  18. 18.
    Hopcroft, J.E.: An \(n\,\ {log}\, n\) algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189–196. Academic Press, London (1971)Google Scholar
  19. 19.
    Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 1–24. Springer, Heidelberg (2005)Google Scholar
  20. 20.
    Kuich, W.: Formal power series over trees. In: Proc. 3rd Int. Conf. Developments in Language Theory, pp. 61–101. Aristotle University of Thessaloniki (1998)Google Scholar
  21. 21.
    Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Monographs in Theoretical Computer Science. An EATCS Series, vol. 5. Springer, Heidelberg (1986)zbMATHGoogle Scholar
  22. 22.
    Maletti, A.: Learning deterministically recognizable tree series — revisited. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 218–235. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  23. 23.
    May, J., Knight, K.: A better n-best list: Practical determinization of weighted finite tree automata. In: Proc. North American Chapter of the Association for Computational Linguistics, pp. 351–358 (2006)Google Scholar
  24. 24.
    May, J., Knight, K.: Tiburon: A weighted tree automata toolkit. In: H. Ibarra, O., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 102–113. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  25. 25.
    Mohri, M.: Minimization algorithms for sequential transducers. Theoret. Comput. Sci. 234(1–2), 177–201 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput. 19(3), 424–437 (1990)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Andreas Maletti
    • 1
  1. 1.International Computer Science InstituteBerkeleyUSA

Personalised recommendations