Incorporating linguistics constraints into inductive logic programming

Proceedings of the 4th Conference on Computational Natural Language Learning, CoNLL 2000 and of the 2nd Learning Language in Logic Workshop, LLL 2000 - Held in cooperation with ICGI 2000

Volumn , Issue , 2000, Pages 184-193

  Cussens, James ^a   Pulman, Stephen ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; INVERSE PROBLEMS;

BOTTOM UP; GRAMMAR INDUCTION; GRAMMAR RULES; LEARN+; LINGUISTIC CONSTRAINTS; LINGUISTIC KNOWLEDGE; LINGUISTIC PROPERTIES; PROGRAMMING ALGORITHMS; SEARCH SPACES; SMALL-SCALE EXPERIMENT;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 84956867200     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. 2: An approach to automatic lexical acquisition. In Proceedings of the 14th International Conference on Computational Linguistics, pages 1172-1176.
2. Michael Collins. 1997. Three generative, lexicalised models for statistical parsing. In Proc. ACL'97.
3. James Cussens and Stephen Pulman. 2000. Experiments in inductve chart parsing. In James Cussens and Saso Dzeroski, editors, Learning Language in Logic. Springer.
4. Luc De Raedt. 1992. Interactive Theory Revision: An Inductive Logic Programming Approach. Academic Press, London.
5. Peter A. Flach and Antonis C. Kakas, editors. 2000. Abduction and Induction: Essays on their Relation and Integration, volume 18 of Applied Logic Series. Kluwer, Dordrecht.
6. Chris Mellish. 1989. Some chart based techniques for parsing ill-formed input. In Proc 27th ACL, pages 102-109, Vancouver, BC. ACL.
7. Stephen Muggleton and Christopher Bryant. 2000. Theory completion using inverse entailment. In James Cussens and Alan Frisch, editors, Proceedings of the 10th International Conference on Inductive Logic Programming, pages 130-146, London, August. Springer.
8. Stephen Muggleton and Wray Buntine. 1988. Machine invention of first-order predicates by inverting resolution. In Proceedings of the Fifth International Conference on Machine Learning, pages 339-352. Kaufmann.
9. Stephen Muggleton and Cao Feng. 1990. Efficient induction of logic programs. In Proc. of the First Conference on Algorithmic Learning Theory, pages 473-491, Tokyo.
10. Miles Osborne. 1999. MDL-based DCG Induction for NP Identification. In Miles Osborne and Erik Tjong Kim Sang, editors, CoNLL99, pages 61-68, Bergen, Norway, June. EACL.
11. Miles Osborne. 2000. Estimation of Stochastic Attribute-Value Grammars using an Informative Sample. In Coling 2000.
12. F.C.N. Pereira. 1981. Extraposition grammars. Computational Linguistics, 7:243-256.
13. FraCaS project. 1996. Fracas: A frame-work for computational semantics. http://www.cogsci.ed.ac.uk/~fracas/.
14. Ehud Shapiro. 1983. Algorithmic Program Debugging. MIT Press, Cambridge.
15. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24(1-2): 3-26. Available at the Computation and Language e-print archive as cmplg/9404008.
16. Lars Thalmann and Christer Samuelsson. 1995. A uniform framework for grammar induction and robust parsing. In Proceedings of the 5th Scandinavian Conference on Artificial Intelligence, pages 293-304.
17. Ruediger Wirth. 1988. Learning by failure to prove. In Derek Sleeman, editor, Proceedings of the 3rd European Working Session on Learning, pages 237-251, Glasgow, October. Pitman.
18. J. M. Zelle and R. J. Mooney. 1996. Learning to parse database queries using inductive logic programming. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, OR, August.