Constrained Atomic Term: Widening the Reach of Rule Templates in Transformation Based Learning
Lecture notes in computer sciencePublished 1 January 2005
Cícero Nogueira dos Santos, Cláudia Oliveira
Citations14
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new model for TBL templates is presented, in which the basic unit, denominated here as an atomic term (AT), encodes a variable sized window and a test that precedes the capture of a feature’s value.
Abstract
Within the framework of Transformation Based Learning (TBL), the rule template is one of the most important elements in the learning process. This paper presents a new model for TBL templates, in which the basic unit, denominated here as an atomic term (AT), encodes a variable sized window and a test that precedes the capture of a feature's value. A case study of Portuguese NP identification is described and the experimental results obtained are presented.
Keywords
Computer Science
Transformation-based error-driven learning and natural language processing: a case study in part-of-speech tagging
1,531 Citations1995Eric Brill
This paper describes a simple rule-based approach to automated learning of linguistic knowledge that has been shown for a number of tasks to capture information in a clearer and more direct fashion without a compromise in performance.
Text, speech and language technologyText Chunking Using Transformation-Based Learning
1,257 Citations1999Lance Ramshaw, Mitchell P. Marcus
This work has shown that the transformation-based learning approach can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including non-recursive “baseNP” chunks.
Transformation-based learning in the fast lane
204 Citations2001Grace Ngai, Radu Florian
This paper presents a novel and realistic method for speeding up the training time of a transformation-based learner without sacrificing performance and shows that this system is able to achieve a significant improvement in training time while still achieving the same performance as a standard transformation- based learner.
A rule-based approach to prepositional phrase attachment disambiguation
195 Citations1994Eric Brill, Philip Resnik
A new corpus- based approach to prepositional phrase attachment disambiguation is described, and results comparing performance of this algorithm with other corpus-based approaches to this problem are presented.
The MIT Press eBooksDeterministic Part-of-Speech Tagging with Finite-State Transducers
136 Citations1997Emmanuel Roche, Yves Schabes
Independence and commitment
121 Citations2000Mark Hepple
Adopting two assumptions that serve to exclude rule interactions during tagging and training, some variants of Brill's approach are arrived at that are instances of decision list models, giving tagging accuracy that is comparable to, or better than the Brill method.
Shallow parsing with pos taggers and linguistic features
34 Citations2002Beáta Megyesi
Three data-driven publicly available part-of-speech taggers are applied to shallow parsing of Swedish texts, and special attention is directed to the taggers' sensitivity to different types of linguistic information included in learning, as well as their sensitivity to the size and the various types of training data sets.
Coaxing confidences from an old friend
17 Citations2000Radu Florian, John C. Henderson +1 more
The results of these experiments show that, for the task of text chunking, the estimates produced by this technique are more informative than those generated by a state-of-the-art decision tree.
Efficient transformation-based parsing
11 Citations1996Giorgio Satta, Eric Brill
This work exploits sparseness in rule applications in transformation-based parsing to derive an algorithm two to three orders of magnitude faster than the standard parsing algorithm.