Skip to main content

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10977))

Included in the following conference series:

Abstract

We conduct a comparative study of two state-of-the-art algorithms for extracting the N best trees from a weighted tree automaton (wta). The algorithms are Best Trees, which uses a priority queue to structure the search space, and Filtered Runs, which is based on an algorithm by Huang and Chiang that extracts N best runs, implemented as part of the Tiburon wta toolkit. The experiments are run on four data sets, each consisting of a sequence of wtas of increasing sizes. Our conclusion is that Best Trees can be recommended when the input wtas exhibit a high or unpredictable degree of nondeterminism, whereas Filtered Runs is the better option when the input wtas are large but essentially deterministic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In [1] the term smallest completion was used.

  2. 2.

    http://people.cs.umu.se/aj/besttrees_experiments/.

  3. 3.

    For the sake of clarity, the expression is slightly simplified. In particular, the maximum rank r of symbols is taken to be constant, as it is typically small in practise.

References

  1. Björklund, J., Drewes, F., Zechner, N.: Efficient enumeration of weighted tree languages over the tropical semiring. J. Comput. Syst. Sci. (2017)

    Google Scholar 

  2. Fülöp, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5_9

    Google Scholar 

  3. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó (1984). https://arxiv.org/abs/1509.06233

  4. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, Chap. 1, pp. 1–68. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6_1

    Chapter  Google Scholar 

  5. Huang, L., Chiang, D.: Better \(k\)-best parsing. In: Proceedings of the Conference on Parsing Technology 2005, pp. 53–64. Association for Computational Linguistics (2005)

    Google Scholar 

  6. Knuth, D.E.: A generalization of Dijkstra’s algorithm. Inf. Process. Lett. 6, 1–5 (1977)

    Article  MathSciNet  Google Scholar 

  7. May, J., Knight, K.: Tiburon: a weighted tree automata toolkit. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 102–113. Springer, Heidelberg (2006). https://doi.org/10.1007/11812128_11

    Chapter  MATH  Google Scholar 

  8. Mohri, M., Riley, M.: An efficient algorithm for the \(n\)-best-strings problem. In: Proceedings of the Conference on Spoken Language Processing (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anna Jonsson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Björklund, J., Drewes, F., Jonsson, A. (2018). A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. In: Câmpeanu, C. (eds) Implementation and Application of Automata. CIAA 2018. Lecture Notes in Computer Science(), vol 10977. Springer, Cham. https://doi.org/10.1007/978-3-319-94812-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94812-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94811-9

  • Online ISBN: 978-3-319-94812-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics