Skip to main content

An Appraisal of UNIVAUTO – The First Discovery Program to Generate a Scientific Article

  • Conference paper

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

Abstract

In a companion paper ([14]), I describe UNIVAUTO (UNIVersals AUthoring TOol), a linguistic discovery program that uncovers language universals and can write a report in English on its discoveries. In this contribution, the system is evaluated along a number of parameters that have been suggested in the literature as necessary ingredients of a successful discovery program. These parameters include the novelty, interestingness, plausibility and intelligibility of results, as well as the system’s portability and insightfulness.

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   39.99
Price excludes VAT (USA)
  • Available as 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Colton, S., Bundy, A., Walsh, T.: On the notion of interestingness in automated mathematical discovery. International Journal of Human-Computer Studies 53(3), 351–376 (2000)

    Article  MATH  Google Scholar 

  2. Croft, W.: Typology and Universals. Cambridge University Press, Cambridge (1990)

    Google Scholar 

  3. Fajtlowicz, S.: On conjectures of Graffiti. Discrete mathematics 72, 113–118 (1988)

    Article  MathSciNet  Google Scholar 

  4. Greenberg, J.H.: Some universals of grammar with particular reference to the order of meaningful elements. In: Greenberg, J.H. (ed.) Universals of Language, pp. 73–113. MIT Press, Cambridge (1966)

    Google Scholar 

  5. Xuang, X., Fielder, A.: Presenting machine-found proofs. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 221–225. Springer, Heidelberg (1996)

    Google Scholar 

  6. Hawkins, J.: Word Order Universals. Academic Press, New York (1983)

    Google Scholar 

  7. Jakobson, R.: Kindersprache, Aphasie, und allgemeine Lautgesetze. Almqvist & Wilksell, Uppsala (1941)

    Google Scholar 

  8. Maddieson, I.: Patterns of Sounds. Cambridge University Press, Cambridge (1984)

    Book  Google Scholar 

  9. Maddieson, I.: Testing the universality of phonological generalizations with a phonetically specified segment database: results and limitations. Phonetica 48, 193–206 (1991)

    Article  Google Scholar 

  10. Pericliev, V., Valdés-Pérez, R.: Automatic componential analysis of kinship semantics with a proposed structural solution to the problem of multiple models. Anthropological Linguistics 40(2), 272–317 (1998)

    Google Scholar 

  11. Pericliev, V.: Further implicational universals in Greenberg’s data (a computergenerated article). Contrastive Linguistics 24, 40–51 (1999)

    Google Scholar 

  12. Pericliev, V.: The prospects for machine discovery in linguistics. Foundations of Science 4(4), 463–482 (1999)

    Article  MATH  Google Scholar 

  13. Pericliev, V.: More statistical implicational universals in Greenberg’s data (another computer-generated article). Contrastive Linguistics 25(2), 115–125 (2000)

    Google Scholar 

  14. Pericliev, V.: A linguistic discovery system that verbalises its discoveries. In: COLING 9th International Conference on Computational Linguistics, Taipei, Taiwan, August 24– September 1, pp. 1258–1262 (2002)

    Google Scholar 

  15. Pericliev, V.: Economy in formulating typological generalizations. Linguistic Typology 6(1), 49–68 (2002)

    Article  Google Scholar 

  16. Pericliev, V.: Machine discovery of phonological universals (2003) (Under submission)

    Google Scholar 

  17. Swanson, N.: An interactive system for finding complementary literature: A stimulus to scientific discovery. Artificial Intelligence 91(2), 183–203 (1997)

    Article  MATH  Google Scholar 

  18. Valdés-Pérez, R., Pericliev, V.: Computer Enumeration of Significant Implicational Universals of Kinship Terminology. Cross-Cultural Research: The Journal of Comparative Social Science 33(2), 162–174 (1999)

    Google Scholar 

  19. Valdés-Pérez, R.: Conjecturing hidden entities via simplicity and conservation laws: Machine discovery in chemistry. Artificial Intelligence 65(2), 247–280 (1994)

    Article  Google Scholar 

  20. Valdés-Pérez, R.: Principles of human-computer collaboration for knowledge discovery in science. Artificial Intelligence 107, 335–346 (1999)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pericliev, V. (2003). An Appraisal of UNIVAUTO – The First Discovery Program to Generate a Scientific Article. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds) Discovery Science. DS 2003. Lecture Notes in Computer Science(), vol 2843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39644-4_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39644-4_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20293-6

  • Online ISBN: 978-3-540-39644-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics