Skip to main content

Introducing Dynamic Structures of Rough Sets. The Case of Text Processing: Anaphoric Co-reference in Texts in Natural Language

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11103))

Included in the following conference series:

  • 973 Accesses

Abstract

Natural language supplies us with a plethora of difficulties in its formal rendering. Common its usage produce cases of uncertain reading one of which is the phenomenon of anaphoric reference. In this notice, we propose to study the anaphoric reference in the framework of distributional models of language according to Dobrushin and Revzin, but with the automatic reading of anaphora as a perspective aim. Anaphora resolution offers us an opportunity to introduce dynamic structures of rough sets. In the studied in this note case, rough sets emerge as primary and secondary anaphoric readings of the text underlying dynamic changes in the process of incremental text deciphering. In a more general perspective, rough set collections are construed as states of dynamic processes with the aim that goals of processes correspond to rough sets in collections representing states becoming exact.

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

Access this chapter

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

References

  1. Bar-Hillel, Y., Shamir, E.: Finite state languages: formal representation and adequacy problems. In: Bar-Hillel, Y. (ed.) Language and Information. Selected Essays on Their Theory and Application. Addison-Wesley, Reading, Mass, pp. 87–98 (1964)

    Google Scholar 

  2. Chandler, R.: The lady in the lake. In: Chandler. Later Novels and Other Writings. The Library of America, p. 193

    Google Scholar 

  3. Dobrushin, R.L.: The elementary grammatical category. Byul. Obiedin. Probl. Mashiinnogo Perevoda No. 5, 19–2 1 (1957). (in Russian)

    Google Scholar 

  4. Dobrushin, R.L.: Mathematical methods in linguistics. Applications. Mat. Prosveshchenie 6, 52–59 (1961). (in Russian)

    Google Scholar 

  5. Manning, C. D. et al.: The stanford CoreNLP natural language processing toolkit. In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics: System Demonstrations, pp. 55–60 (2014)

    Google Scholar 

  6. Marcus, S.: Algebraic Linguistics; Analytical Models. Academic Press, New York, London (1967)

    MATH  Google Scholar 

  7. Miller, G.A. et al.: Introduction to WordNet: An Online Lexical Database (1993, preprint)

    Google Scholar 

  8. Miller, G.A.: Nouns in WordNet: A Lexical Inheritance System (1993, preprint)

    Google Scholar 

  9. Revzin, I.I.: Models of Language. Methuen, London (1962)

    Google Scholar 

  10. Semeniuk-Polkowska, M., Polkowski, L.T.: An analytic model of anaphora resolution in algebraic linguistics. Intern. J. Comput. Mathe. 23, 251–263 (1988)

    Article  Google Scholar 

  11. Semeniuk-Polkowska, M., Polkowski, L.T.: Anaphoric trees and an extension of the model of anaphora resolution. Reports Fac. Technical Mathematics and Informatics, no. 89–37, Delft University, Delft, The Netherlands (1989)

    Google Scholar 

  12. Semeniuk-Polkowska, M., Polkowski, L.T.: A semantics for anaphora resolution in algebraic linguistics. Intern. J. Comput. Mathe. 32, 137–147 (1990)

    Article  Google Scholar 

  13. Sestier, A.: Contribution \(\acute{a}\) une theorie ensembliste des classifications linguistiques. Premier congres de 1’Association francaise de calcul. Grenoble, pp. 293–305 (1960)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wojciech Budzisz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Budzisz, W., Polkowski, L.T. (2018). Introducing Dynamic Structures of Rough Sets. The Case of Text Processing: Anaphoric Co-reference in Texts in Natural Language. In: Nguyen, H., Ha, QT., Li, T., Przybyła-Kasperek, M. (eds) Rough Sets. IJCRS 2018. Lecture Notes in Computer Science(), vol 11103. Springer, Cham. https://doi.org/10.1007/978-3-319-99368-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99368-3_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99367-6

  • Online ISBN: 978-3-319-99368-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics