Skip to main content

Simple Voting Algorithms for Italian Parsing

  • Chapter
  • First Online:
  • 398 Accesses

Part of the book series: Studies in Computational Intelligence ((SCI,volume 589))

Abstract

This paper presents an ensemble system for dependency parsing of Italian: three parsers are separately trained and combined by means of a majority vote. The three parsers are the MATE parser, version 2.0, the DeSR parser, and the MALT parser. We present three experiments showing that a simple voting combination further improves the performances of the parsers.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    http://code.google.com/p/mate-tools/

  2. 2.

    http://sites.google.com/site/desrparser/

  3. 3.

    http://maltparser.org/

  4. 4.

    In this paper we use the term word in a general sense, as synonym of token.

  5. 5.

    File: it_isst_train.splet.

  6. 6.

    File: it_isst_test.splet.

  7. 7.

    File: it_isst_train.splet and it_isst_test.splet.

  8. 8.

    File: it_EULaw_test_blind.splet.

  9. 9.

    File: it_isst_train.splet and it_isst_test . splet.

  10. 10.

    File: it_NatRegLaw_test_blind.splet.

  11. 11.

    File: evalita201_ train.conll.

  12. 12.

    File: evalita2011_ test.conll.

  13. 13.

    The same consideration hold for COM2: in the second experiment there are just \(8\) corrupted trees.

  14. 14.

    http://www.parsit.it.

  15. 15.

    The UniPi parser is the DeSR parser tuned for this specific competition.

  16. 16.

    The FBKirst parser is an ensemble combination of the MALT parser.

References

  1. Anders, B., Bernd, B., Hafdell, L., Nugues, P.: A high-performance syntactic and semantic dependency parser. In: Coling 2010: Demonstrations, pp. 33–36. Coling 2010 Organizing Committee, Beijing, China (August 2010), http://www.aclweb.org/anthology/C10-3009

  2. Attardi, G.: Experiments with a multilanguage non-projective dependency parser. In: Proceedings of the Tenth Conference on Computational Natural Language Learning (CoNLL-X), pp. 166–170. Association for Computational Linguistics, New York (June 2006), http://www.aclweb.org/anthology/W/W06/W06-2922

  3. Attardi, G., dell’Orletta, F.: Reverse revision and linear tree combination for dependency parsing. In: HLT-NAACL, pp. 261–264 (2009)

    Google Scholar 

  4. Attardi, G., Simi, M., Zanelli, A.: Tuning DeSR for the Evalita 2011 Dependency Parsing. In: Working Notes of EVALITA 2011. CELCT a r.l. (2012) ISSN 2240–5186

    Google Scholar 

  5. Bohnet, B.: Efficient parsing of syntactic and semantic dependency structures. In: Proceedings of the Thirteenth Conference on Computational Natural Language Learning (CoNLL’09), Shared Task, pp. 67–72. Association for Computational Linguistics, Stroudsburg (2009), http://dl.acm.org/citation.cfm?id=1596409.1596421

  6. Bohnet, B.: Top accuracy and fast dependency parsing is not a contradiction. In: Proceedings of the 23rd International Conference on Computational Linguistics (Coling 2010), pp. 89–97. Coling 2010 Organizing Committee, Beijing, China (August 2010), http://www.aclweb.org/anthology/C10-1011

  7. Bosco, C., Lombardo, V.: Dependency and relational structure in treebank annotation. In: Proceedings of the COLING’04 workshop on Recent Advances in Dependency Grammar. Geneve, Switzerland (2004), http://www.di.unito.it/~bosco/publicat/dependency-coling04.zip

  8. Bosco, C., Mazzei, A.: The Evalita 2011 parsing task: the dependency track. In: Working Notes of EVALITA 2011. CELCT a r.l. (2012) ISSN 2240–5186

    Google Scholar 

  9. Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123–140 (1996)

    MATH  MathSciNet  Google Scholar 

  10. Carreras, X.: Experiments with a higher-order projective dependency parser. In: Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL 200, pp. 957–961 (2007), http://www.aclweb.org/anthology/D/D07/D07-1101

  11. Dell’Orletta, F., Marchi, S., Montemagni, S., Plank, B., Venturi, G.: The SPLeT-2012 Shared Task on Dependency Parsing of Legal Texts. In: SPLeT 2012—Fourth Workshop on Semantic Processing of Legal Texts (SPLeT 2012)—First Shared Task on Dependency Parsing of Legal Texts (2012)

    Google Scholar 

  12. EVALITA 2011 Organization Committee: Working Notes of EVALITA 2011. CELCT a r.l (2012)

    Google Scholar 

  13. Hajič, J., Ciaramita, M., Johansson, R., Kawahara, D., Martí, M.A., Màrquez, L., Meyers, A., Nivre, J., Padó, S., Štěpánek, J., Straňák, P., Surdeanu, M., Xue, N., Zhang, Y.: The conll-2009 shared task: syntactic and semantic dependencies in multiple languages. In: Proceedings of the Thirteenth Conference on Computational Natural Language Learning CoNLL’09, Shared Task, pp. 1–18. Association for Computational Linguistics, Stroudsburg (2009), http://dl.acm.org/citation.cfm?id=1596409.1596411

  14. Hall, J., Nilsson, J., Nivre, J., Eryigit, G., Megyesi, B., Nilsson, M., Saers, M.: Single malt or blended? A study in multilingual parser optimization. In: Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL 2007, pp. 933–939 (2007), http://www.aclweb.org/anthology/D/D07/D07-1097

  15. Johansson, R., Nugues, P.: Dependency-based syntactic-semantic analysis with propbank and nombank. In: Proceedings of the Twelfth Conference on Computational Natural Language Learning CoNLL’08, pp. 183–187. Association for Computational Linguistics, Stroudsburg (2008), http://dl.acm.org/citation.cfm?id=1596324.1596355

  16. Kübler, S., McDonald, R.T., Nivre, J.: Dependency Parsing. Synthesis Lectures on Human Language Technologies. Morgan & Claypool Publishers, San Rafael (2009)

    Google Scholar 

  17. Lavelli, A.: An ensemble model for the EVALITA 2011 dependency parsing task. In: Working Notes of EVALITA 2011. CELCT a r.l. (2012). ISSN 2240–5186

    Google Scholar 

  18. Mazzei, A., Bosco, C.: Simple parser combination. In: SPLeT 2012—4th Workshop on Semantic Processing of Legal Texts (SPLeT 2012)—First Shared Task on Dependency Parsing of Legal Texts, pp. 57–61 (2012)

    Google Scholar 

  19. McDonald, R., Pereira, F.: Online learning of approximate dependency parsing algorithms. In: Proceedings of 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL-2006), vol. 6, pp. 81–88 (2006)

    Google Scholar 

  20. Nivre, J.: Algorithms for deterministic incremental dependency parsing. Comput. Linguist. 34(4), 513–553 (2008)

    Article  MathSciNet  Google Scholar 

  21. Nivre, J., Hall, J., Kübler, S., McDonald, R., Nilsson, J., Riedel, S., Yuret, D.: The CoNLL 2007 shared task on dependency parsing. In: Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL 2007, pp. 915–932 (2007), http://www.aclweb.org/anthology/D/D07/D07-1096

  22. Nivre, J., Hall, J., Nilsson, J.: Maltparser: a data-driven parser-generator for dependency parsing. In: Proceedings of LREC-2006, vol. 6, pp. 2216–2219 (2006)

    Google Scholar 

  23. Sagae, K., Lavie, A.: Parser combination by reparsing. In: Moore, R.C., Bilmes, J.A., Chu-Carroll, J., Sanderson, M. (eds.) HLT-NAACL. The Association for Computational Linguistics (2006)

    Google Scholar 

  24. Surdeanu, M., Manning, D.C.: Ensemble models for dependency parsing: cheap and good? In: NAACL. The Association for Computational Linguistics (2010)

    Google Scholar 

  25. Yamada, H., Matsumoto, Y.: Statistical dependency analysis with support vector machines. In: Proceedings of IWPT, vol. 3 (2003)

    Google Scholar 

  26. Zeman, D., Žabokrtskỳ, Z.: Improving parsing accuracy by combining diverse dependency parsers. In: International Workshop on Parsing Technologies, pp. 171–178. Association for Computational Linguistics, Vancouver (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alessandro Mazzei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Mazzei, A. (2015). Simple Voting Algorithms for Italian Parsing. In: Basili, R., Bosco, C., Delmonte, R., Moschitti, A., Simi, M. (eds) Harmonization and Development of Resources and Tools for Italian Natural Language Processing within the PARLI Project. Studies in Computational Intelligence, vol 589. Springer, Cham. https://doi.org/10.1007/978-3-319-14206-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14206-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14205-0

  • Online ISBN: 978-3-319-14206-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics