Skip to main content
SpringerLink
Log in

An Abductive Treatment of Long Distance Dependencies in CHR

  • Conference paper
Constraint Solving and Language Processing (CSLP 2004)

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

Included in the following conference series:

  • 301 Accesses

Abstract

We propose a CHR treatment for long distance dependencies which abduces the missing elements while relating the constituents that must be related. We discuss our ideas both from a classical analysis point of view, and from a property-grammar based perspective. We exemplify them through relative clauses first, and next through the more challenging case of natural language coordination. We present an abductive rule schema for conjunction from which appropriate rule instances materialize through the normal process of unification in a given sentence’s parse, and which fills in (abduces) any information that may be missing in one conjunct through semantic and syntactic information found in the other. Thus semantic criteria, which in most previous approaches was understressed in favour of syntactic criteria, regains its due importance, within our encompassing while retaining economic abductive formulation.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdennadher, S., Schütz, H.: CHR: A Flexible Query Language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 1–15. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Balsa, J., Dahl, V., Pereira Lopes, J.G.: Datalog Grammars for Abductive Syntactic Error Diagnosis and Repair. In: Proceedings of the Natural Language Understanding and Logic Programming Workshop, Lisbon (1995)

    Google Scholar 

  3. Blache, P., Azulay, D.: Parsing Ill-formed Inputs with Constraints Graphs. In: Gelbukh, A. (ed.) Intelligent Text Processing and Computational Linguistics. LNCS, pp. 220–229. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Bès, G., Blache, P.: Propriétés et analyse d’un langage. In: Proceedings of TALN 1999 (1999)

    Google Scholar 

  5. Bès, G., Blache, P., Hagège, C.: The 5P Paradigm. Research report, GRIL/LPL (1999)

    Google Scholar 

  6. Christiansen, H., Dahl, V.: Logic Grammars for Diagnosis and Repair. International Journal on Artificial Intelligence Tools 2(3), 227–248 (2003)

    Article  Google Scholar 

  7. Dahl, V., Voll, K.: Concept Formation Rules: An Executable Cognitive Model of Knowledge Construction. In: Proceedings of First International Workshop on Natural Language Understanding and Cognitive Sciences, pp. 28–36. INSTICC Press (2004)

    Google Scholar 

  8. Barranco-Mendoza, A., Persaoud, D.R., Dahl, V.: A property-based model for lung cancer diagnosis. In: Proceedings of 8th Annual Int. Conf. on Computational Molecular Biology, RECOMB 2004, San Diego, California (2004) (accepted poster)

    Google Scholar 

  9. Christiansen, H., Dahl, V.: Assumptions and Abduction in Prolog. In: Proceedings MULTICPL 2004, Third International Workshop on Multiparadigm Constraint Programming Language, Saint-Malo, France (2004)

    Google Scholar 

  10. Christiansen, H.: Logical Grammars Based on Constraint Handling Rules. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, p. 481. Springer, Heidelberg (2002) (Poster abstract)

    Chapter  Google Scholar 

  11. Christiansen, H.: CHR grammars. International Journal on Theory and Practice of Logic Programming, special issue on Constraint Handling Rules (2005) (to appear)

    Google Scholar 

  12. Christiansen, H.: Abductive Language Interpretation as Bottom-up Deduction. In: Wintner, S. (ed.) NLULP 2002, Natural Language Understanding and Logic Programming, Copenhagen, Denmark, pp. 33–47 (2002)

    Google Scholar 

  13. Christiansen, H.: CHR as Grammar Formalism, a First Report. In: Apt, K.R., Bartak, R., Monfroy, E., Rossi, F. (eds.) Sixth Annual Workshop of the ERCIM Working Group on Constraints, Prague (2001)

    Google Scholar 

  14. Dahl, V., Blache, P.: Directly Executable Constraint Based Grammars. In: Proc. Journees Francophones de Programmation en Logique avec Contraintes, Angers, France, pp. 149–166 (2004)

    Google Scholar 

  15. Dahl, V., Tarau, P.: Assumptive Logic Programming. In: Proc. ASAI 2004, Cordoba, Argentina (2004)

    Google Scholar 

  16. Dahl, V.: On Implicit Meanings. In: Sadri, F., Kakas, T. (eds.) Computational Logic: from Logic Programming into the Future. Springer, Heidelberg (2002)

    Google Scholar 

  17. Dahl, V., Tarau, P., Li, R.: Assumption Grammars for Processing Natural Language. In: Proc. Fourteenth International Conference on Logic Programming, pp. 256–270. MIT Press, Cambridge (1997)

    Google Scholar 

  18. Dahl, V., McCord, M.: Treating Coordination in Logic Grammars. American Journal of Computational Linguistics 9, 69–91 (1983)

    Google Scholar 

  19. Darlymple, M., Shieber, S., Pereira, F.: Ellipsis and Higher-Order Unification. Linguistics and Philosophy 14(4), 399–452 (1991)

    Article  Google Scholar 

  20. Fruhwirth, T.W.: Theory and Practice of Constraint Handling Rules. Journal of Logic Programming 37, 95–138 (1998)

    Article  MathSciNet  Google Scholar 

  21. Haugeneder, H.: A Computational Model for Processing Coordinate Structures: Parsing Coordination will-out Grammatical Specification. In: Proc. ECAI 1992, pp. 513–517 (1992)

    Google Scholar 

  22. Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. The Journal of Logic Programming 44, 129–177 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  23. Kehler, A., Shieber, S.: Anaphoric Dependencies in Ellipsis. Computational Linguistics 23(3) (1997)

    Google Scholar 

  24. Milward, D.: Non-Constituent Coordination: Theory and Practice. In: Proceedings of COLING 1994, Kyoto, Japan, pp. 935–941 (1994)

    Google Scholar 

  25. Park, J.C., Cho, H.J.: Informed Parsing for Coordination with Combinatory Categorial Grammar. In: Proc. COLING 2000, pp. 593–599 (2000)

    Google Scholar 

  26. Steedman, M.: Gapping as Constituent Coordination. Linguistics and Philosophy, 207–260 (1990)

    Google Scholar 

  27. Tarau, P.: The Jinni 2004 Prolog Compiler: a High Performance Java and. NET based Prolog for Object and Agent Oriented Internet Programming. BinNet Corp. (2004), http://www.binnetcorp.com/download/jinnidemo/JinniUserGuide.html

  28. Voll, K., Yeh, T., Dahl, V.: An Assumptive Logic Programming Methodology for Parsing. International Journal on Artificial Intelligence Tools (2001)

    Google Scholar 

  29. Woods, W.: An Experimental Parsing System for Translation Network Grammars. In: Rustin, R. (ed.) Natural Language Processing, pp. 145–149. Algorithmic Press, New York (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logic and Functional Programming Group, Department of Computing Science, Simon Fraser University, Burnaby, B.C., Canada

    Veronica Dahl

Authors
  1. Veronica Dahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research group PLIS: Programming, Logic and Intelligent Systems, Department of Communication, Business and Information Technologies, Roskilde University, P.O. Box 260, DK-4000, Roskilde, Denmark

    Henning Christiansen

  2. Department of Computational Linguistics, Center for Computational Modeling of Language, Copenhagen Business School, Bernhard Bangs Alle 17 B, DK-2000, Frederiksberg, Denmark

    Peter Rossen Skadhauge

  3. Computer Science, Roskilde University, Building 42.1, P.O. Box, DK-4000, Roskilde, Denmark

    Jørgen Villadsen

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dahl, V. (2005). An Abductive Treatment of Long Distance Dependencies in CHR. In: Christiansen, H., Skadhauge, P.R., Villadsen, J. (eds) Constraint Solving and Language Processing. CSLP 2004. Lecture Notes in Computer Science(), vol 3438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424574_2

Download citation

  • DOI: https://doi.org/10.1007/11424574_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26165-0

  • Online ISBN: 978-3-540-31928-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation