Abstract
In this work, we present first results on noun phrase coreference resolution on Czech data. As the data resource for our experiments, we employed yet unfinished and unpublished extension of Prague Dependency Treebank 2.0, which captures noun phrase coreference and bridging relations. Incompleteness of the data influenced one of our motivations – to aid annotators with automatic pre-annotation of the data. Although we introduced several novel tree features and tried different machine learning approaches, results on a growing amount of data shows that the selected feature set and learning methods are not able to sufficiently exploit the data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bojar, O., Žabokrtský, Z.: CzEng 0.9, Building a Large Czech-English Automatic Parallel Treebank. The Prague Bulletin of Mathematical Linguistics (92), 63–83 (2009)
Collins, M.: Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms. In: EMNLP, vol. 10, pp. 1–8 (2002)
Denis, P., Baldridge, J.: A Ranking Approach to Pronoun Resolution. In: IJCAI, pp. 1588–1593 (2007)
Denis, P., Baldridge, J.: Specialized Models and Ranking for Coreference Resolution. In: EMNLP, pp. 660–669 (2008)
Liu, D.C., Nocedal, J.: On the Limited Memory BFGS Method for Large Scale Optimization. Mathematical Programming 45, 503–528 (1989)
Haghighi, A., Klein, D.: Simple Coreference Resolution with Rich Syntactic and Semantic Features. In: EMNLP, pp. 1152–1161 (2009)
Haghighi, A., Klein, D.: Coreference Resolution in a Modular, Entity-Centered Model. In: HLT-NAACL, pp. 385–393 (2010)
Hajič, J., et al.: Prague Dependency Treebank 2.0. CD-ROM, Linguistic Data Consortium, LDC Catalog No.: LDC2006T01, Philadelphia (2006)
Malouf, R.: A Comparison of Algorithms for Maximum Entropy Parameter Estimation. In: 6th Conference on Natural Language Learning, COLING 2002, vol. 20, pp. 1–7. Association for Computational Linguistics, Stroudsburg (2002)
MUC-7: Coreference Task Definition. In: Seventh Message Understanding Conference. Morgan Kaufmann, San Francisco, CA (1998)
Ng, V.: Supervised Noun Phrase Coreference Research: The First Fifteen Years. In: ACL, Uppsala, Sweden, pp. 1396–1411 (July 2010)
Nguy, G.L., Novák, V., Žabokrtský, Z.: Comparison of Classification and Ranking Approaches to Pronominal Anaphora Resolution in Czech. In: SIGDIAL 2009 Conference, pp. 276–285. ACL, London (2009)
NIST: ACE Evaluation Plan. Tech. rep. (2007), http://www.itl.nist.gov/iad/mig/tests/ace/2007/
Nědolužko, A., Mírovský, J., Ocelák, R., Pergler, J.: Extended Coreferential Relations and Bridging Anaphora in the Prague Dependency Treebank. In: DAARC 2009 (2009)
Rahman, A., Ng, V.: Supervised models for coreference resolution. In: EMNLP, pp. 968–977 (2009)
Sgall, P., Hajičová, E., Panevová, J.: The Meaning of the Sentence in Its Semantic and Pragmatic Aspects. D. Reidel Publishing Company, Dordrecht (1986)
Soon, W.M., Ng, H.T., Lim, C.Y.: A Machine Learning Approach to Coreference Resolution of Noun Phrases. Computational Linguistics 27(4), 521–544 (2001)
Žabokrtský, Z., Ptáček, J., Pajas, P.: TectoMT: Highly Modular MT System with Tectogrammatics Used as Transfer Layer. In: ACL 2008 WMT, pp. 167–170 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Novák, M., Žabokrtský, Z. (2011). Resolving Noun Phrase Coreference in Czech. In: Hendrickx, I., Lalitha Devi, S., Branco, A., Mitkov, R. (eds) Anaphora Processing and Applications. DAARC 2011. Lecture Notes in Computer Science(), vol 7099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25917-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-25917-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25916-6
Online ISBN: 978-3-642-25917-3
eBook Packages: Computer ScienceComputer Science (R0)