Skip to main content

Issues in Learning Language in Logic

  • Chapter
  • First Online:
Computational Logic: Logic Programming and Beyond

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

Abstract

Selected issues concerning the use of logical representations in machine learning of natural language are discussed. It is argued that the flexibility and expressivity of logical representations are particularly useful in more complex natural language learning tasks. A number of inductive logic programming (ILP) techniques for natural language are analysed including the CHILL system, abduction and the incorporation of linguistic knowledge, including active learning. Hybrid approaches integrating ILP with manual development environments and probabilistic techniques are advocated.

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Steven Abney. Stochastic attribute-value grammars. Computational Linguistics, 23(4):597–618, 1997.

    MathSciNet  Google Scholar 

  2. Pieter Adriaans and Erik de Haas. Grammar induction as substructural inductive logic programming. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  3. H. Alshawi, editor. The Core Language Engine. MIT Press, Cambridge, Mass, 1992.

    Google Scholar 

  4. George Boole. An Investigation of the Laws of Thought, on which are founded the Mathematical Theories of Logic and Probabilities. Dover, 1854.

    Google Scholar 

  5. Henrik Boström. Induction of recursive transfer rules. In James Cussens and Saso Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  6. Eric Brill. A closer look at the automatic induction of linguistic knowledge. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  7. M.E. Califf and R.J. Mooney. Relational learning of pattern-match rules for information extraction. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 328–334, Orlando, FL, July 1999.

    Google Scholar 

  8. James Cussens. Loglinear models for first-order probabilistic reasoning. In Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), pages 126–133, San Francisco, CA, 1999. Morgan Kaufmann Publishers.

    Google Scholar 

  9. James Cussens. Stochastic logic programs: Sampling, inference and applications. In Proceedings of the Sixteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-2000), pages 115–122, San Francisco, CA, 2000. Morgan Kaufmann.

    Google Scholar 

  10. James Cussens. Parameter estimation in stochastic logic programs. Machine Learning, 2001. To appear.

    Google Scholar 

  11. James Cussens and Stephen Pulman. Incorporating linguistics constraints into inductive logic programming. In Proceedings of CoNLL2000 and LLL2000, pages 184–193, Lisbon, September 2000. ACL.

    Google Scholar 

  12. Sašo Džeroski, James Cussens, and Suresh Manandhar. An introduction to inductive logic programming and learning language in logic. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  13. Martin Eineborg and Nikolaj Lindberg. ILP in part-of-speech tagging — an overview. In James Cussens and Sao Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  14. Andreas Eisele. Towards probabilistic extensions of constraint-based grammars. Contribution to DYANA-2 Deliverable R1.2B, DYANA-2 project, 1994. Available at ftp://moon.philo.uva.nl/pub/dekker/dyana/R1.2.B.

  15. D. Faure and C. Nédellec. A Corpus-based Conceptual Clustering Method for Verb Frames and Ontology Acquisition. In Paola Velardi, editor, LREC workshop on Adapting lexical and corpus ressources to sublanguages and applications, pages 5–12, Granada, Spain, May 1998.

    Google Scholar 

  16. Dimitar Kazakov. Achievements and prospects of learning word morphology with inductive logic programming. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  17. S. Muggleton and L. De atRaedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 20:629–679, 1994.

    Article  Google Scholar 

  18. Stephen Muggleton. Stochastic logic programs. In Luc De Raedt, editor, Advances in Inductive Logic Programming, volume 32 of Frontiers in Artificial Intelligence and Applications, pages 254–264. IOS Press, Amsterdam, 1996.

    Google Scholar 

  19. Stephen Muggleton. Semantics and derivation for stochastic logic programs. In Richard Dybowski, editor, Proceedings of the UAI-2000 Workshop on Fusion of Domain Knowledge with Data for Decision Support, 2000.

    Google Scholar 

  20. Claire Nedellec. Corpus-based learning of semantic relations by the ILP system, Asium. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  21. Miles Osborne. DCG induction using MDL and parsed corpora. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  22. Stefan Riezler. Probabilistic Constraint Logic Programming. PhD thesis, Universität Tübingen, 1998. AIMS Report 5(1), 1999, IMS, Universität Stuttgart.

    Google Scholar 

  23. Stefan Riezler. Learning log-linear models on constraint-based grammars for disambiguation. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  24. Lappoon R. Tang and Raymond J. Mooney. Automated construction of database interfaces: Integrating statistical and relational learning of semantic parsing. In Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora(EMNLP/VLC-2000), pages 133–141, Hong-Kong, October 2000.

    Google Scholar 

  25. Cynthia A. Thompson and Mary Elaine Califf. Improving learning by choosing examples intelligently in two natural language tasks. In James Cussens and Sašo Džeroski, editors, Learning Language in Logic, volume 1925 of LNAI. Springer, 2000.

    Google Scholar 

  26. Ruediger Wirth. Learning by failure to prove. In Derek Sleeman, editor, Proceedings of the 3rd European Working Session on Learning, pages 237–251, Glasgow, October 1988. Pitman.

    Google Scholar 

  27. J. M. Zelle and R. J. Mooney. Learning semantic grammars with constructive inductive logic programming. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 817–822, Washington, D.C., July 1993.

    Google Scholar 

  28. J. M. Zelle and R. J. Mooney. Comparative results on using inductive logic programming for corpus-based parser construction. In S. Wermter, E. Riloff, and G. Scheler, editors, Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing, pages 355–369. Springer, Berlin, 1996.

    Google Scholar 

  29. J.M. Zelle, C.A. Thompson, M.E. Califf, and R.J. Mooney. Inducing logic programs without explicit negative examples. In L. De Raedt, editor, Proceedings of the 5th International Workshop on Inductive Logic Programming, pages 403–416. Department of Computer Science, Katholieke Universiteit Leuven, 1995.

    Google Scholar 

  30. John M. Zelle and Raymond J. Mooney. An inductive logic programming method for corpus-based parser construction. Unpublished Technical Report, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cussens, J. (2002). Issues in Learning Language in Logic. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45632-5_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45632-5_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43960-8

  • Online ISBN: 978-3-540-45632-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics