Article

Free access

Theory refinement and Natural Language Learning

Author:

Hervé DéjeanAuthors Info & Claims

COLING '00: Proceedings of the 18th conference on Computational linguistics - Volume 1

Pages 229 - 235

https://doi.org/10.3115/990820.990854

Published: 31 July 2000 Publication History

Abstract

This paper presents a learning system for identifying syntactic structures. This system relies on the use of background knowledge and default values in order to build up an initial grammar and the use of theory refinement in order to improve this grammar. This combination provides a good machine learning framework for Natural Language Learning. We illustrate this point with the presentation of ALLiS, a learning system which generates a regular expression grammar of non-recursive phrases from bracketed corpora.

References

[1]

Andreas Abecker and Klaus Schmid. 1996. From theory refinement to kb maintenance: a position statement. In ECAI '96, Budapest, Hungary.

[2]

Steven Abney. 1996. Partial parsing via finite-state cascades. In Proceedings of the ESSLLI '96 Robust Parsing Workshop.

Digital Library

[3]

Shlomo Argamon, Ido Dagan, and Yuval Krymolowski. 1998. A memory-based approach to learning shallow natural language patterns. In COLING '98, Montréal.

Digital Library

[4]

Robert C. Berwick. 1985. The acquisition of syntactic knowledge. MIT press, Cambridge.

Digital Library

[5]

Eric Brill. 1993. A Corpus-Based Approach to Language Learning. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.

Digital Library

[6]

Clifford Alan Brunk and Michael Pazzani. 1995. A lexically based semantics bias for theory revision. In Morgan Kauffman, editor, Twelfth International Conference on Machine Learning, pages 81--89.

[7]

Clifford Alan Brunk. 1996. An investigation of Knowledge Intensive Approaches to Concept Learning and Theory Refinement. Ph.D. thesis, University of California, Irvine.

[8]

Sabine Buchholz, Jorn Veenstra, and Walter Daclemans. 1999. Caseaded grammatical relation assignment. In Proceedings of EMNLP/VLC-99, pages pp. 239--246, University of Maryland, USA.

[9]

Claire Cardie and David Pierce. 1998. Error-driven pruning of treebank grammars for base noun phrase identification. In Proceedings of the 17th International Conference on Computational Linguistics (COLING-ACL '98).

Digital Library

[10]

Claire Cardie and David Pierce. 1999. The role of lexicalization and pruning for base noun phrase grammars. In Proceedings of the Sixteenth National Conference on Artificial Intelligence.

Digital Library

[11]

Susan Craw and D. Sleeman. 1990. Automating the refinement of knowledge-based systems. In Proceedings of the ECAI '90 Conference, pages 167--172.

[12]

The XTAG Research Group. 1998. A lexicalized tree adjoining grammar for english. Technical Report IRCS 98--18, University of Pennsylvania.

[13]

Lauri Karttunen, Tainás Gal, and André Kempe. 1997. Xerox finite-smtate tool. Technical report, Xerox Research Centre Europe, Grenoble.

[14]

Mitchell Marcus, Béatrice Sautorini, and Mare Ann Marcinkiewicz. 1993. Building a large annotated corpus of english: the penn treebank. Computational Linguistics, 19(2):313--330.

Digital Library

[15]

Raymond J. Mooney. 1993. Induction over the unexplained: Using overly-general domain theories to aid concept learning. Machine Learning, 10:79.

Digital Library

[16]

Raymond J. Mooney. 1997. Inductive logic programming for natural language processing. In Sixth International Inductive Logic Programming Workshop, pages 205--224, Stockholm, Sweden.

Digital Library

[17]

Marcia Muñoz, Vasin Punyakanok, Dan Roth, and Dav Zimak. 1999. A learning approach to shallow parsing. In Proceedings of EMNLP-WVLC '99.

[18]

Dirk Ourston and Raymond Mooney. 1990. Changing the rules: A comprehensive approach to theory refinement. In Proceedings of the Eight National Conference on Artificial Intelligence, pages 815--820.

[19]

Lance A. Ranishaw and Mitchell P. Marcus. 1995. Text chunking using transformation-based learning. In ACL Third Workshop on Very Large Corpora, pages 82--94.

[20]

Geoffrey Sampson. 1995. English for the Computer. The SUSANNE Corpus and Analytic Scheme. Oxford: Clarendon Press.

[21]

Khalil Sima'an. 1997. Explanation-based learning of data oriented parsing. In T. Mark Ellison, editor, Computational Natural Language Learning (CoNLL), ACL/EACL-97, Madrid.

[22]

Erik Tjong Kim Sang and Jorn Veenstra. 1999. Representing text chunks. In Proceedings of EACL '99, Association for Computational Linguistics, Bergen.

Digital Library

[23]

Jacques Vergne and Emmanuel Giguet. 1998. Regards théoriques sur le "tagging". In proccedings of Traitement Automatique des Langues Naturelles (TALN 1998), Paris.

Cited By

Déjean HDaelemans WZajac R(2001)Using ALLiS for clausingProceedings of the 2001 workshop on Computational Natural Language Learning - Volume 710.3115/1117822.1117838(1-3)Online publication date: 6-Jul-2001
https://dl.acm.org/doi/10.3115/1117822.1117838
Sang EDaelemans WDéjean HKoeling RKrymolowski YPunyakanok VRoth DKay M(2000)Applying system combination to base noun phrase identificationProceedings of the 18th conference on Computational linguistics - Volume 210.3115/992730.992770(857-863)Online publication date: 31-Jul-2000
https://dl.acm.org/doi/10.3115/992730.992770
Déjean H(2000)Learning syntactic structures with XMLProceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 710.3115/1117601.1117632(133-135)Online publication date: 13-Sep-2000
https://dl.acm.org/doi/10.3115/1117601.1117632
Show More Cited By

Theory refinement and Natural Language Learning
1. Computing methodologies
  1. Artificial intelligence
2. Hardware
  1. Power and energy
    1. Power estimation and optimization

Recommendations

GLR parsing with multiple grammars for natural language queries

This article presents an approach for parsing natural language queries that integrates multiple subparsers and subgrammars, in contrast to the traditional single grammar and parser approach. In using LR(k) parsers for natural language processing, we are ...
The restriction language for computer grammars of natural language

Over the past few years, a number of systems for the computer analysis of natural language sentences have been based on augmented context-free grammars: a context-free grammar which defines a set of parse trees for a sentence, plus a group of ...
Multi-level structures for natural language processing

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

COLING '00: Proceedings of the 18th conference on Computational linguistics - Volume 1

July 2000

616 pages

ISBN:155860717X

Program Chair:
Martin Kay

Sponsors

DFKI: DFKI GmbH
Ministète de la Recherche Français
Deutsche Forschungsgemeinschaft
Loria
Centre Universitaire de Luxembourg
Universität des Saarlandes
Université; Nancy 2
Ministerium für Bildung, Kultur und Wissenschaft des Saarlandes

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 31 July 2000

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,537 of 1,537 submissions, 100%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
278
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)9

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Déjean HDaelemans WZajac R(2001)Using ALLiS for clausingProceedings of the 2001 workshop on Computational Natural Language Learning - Volume 710.3115/1117822.1117838(1-3)Online publication date: 6-Jul-2001
https://dl.acm.org/doi/10.3115/1117822.1117838
Sang EDaelemans WDéjean HKoeling RKrymolowski YPunyakanok VRoth DKay M(2000)Applying system combination to base noun phrase identificationProceedings of the 18th conference on Computational linguistics - Volume 210.3115/992730.992770(857-863)Online publication date: 31-Jul-2000
https://dl.acm.org/doi/10.3115/992730.992770
Déjean H(2000)Learning syntactic structures with XMLProceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 710.3115/1117601.1117632(133-135)Online publication date: 13-Sep-2000
https://dl.acm.org/doi/10.3115/1117601.1117632
Déjean H(2000)ALLiSProceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 710.3115/1117601.1117622(95-98)Online publication date: 13-Sep-2000
https://dl.acm.org/doi/10.3115/1117601.1117622

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents