The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Transformation-based learning in the fast lane
Open accessAbstract
Transformation-based learning has been successfully employed to solve many natural language processing problems. It achieves state-of-the-art performance on many natural language processing tasks and does not overtrain easily. However, it does have a serious drawback: the training time is often intorelably long, especially on the large corpora which are often used in NLP. In this paper, we present a novel and realistic method for speeding up the training time of a transformation-based learner without sacrificing performance. The paper compares and contrasts the training time needed and performance achieved by our modified learner with two other systems: a standard transformation-based learner, and the ICA system (Hepple, 2000). The results of these experiments show that our system is able to achieve a significant improvement in training time while still achieving the same performance as a standard transformation-based learner. This is a valuable contribution to systems and algorithms which utilize transformation-based learning at any part of the execution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Cited by
Open information extraction from the web
Etzioni, O., Banko, M., Soderland, S., & Weld, D. S. (2008) · Communications of the ACM · doi:10.1145/1409360.1409378 · Cited by 1,012
RelEx—Relation extraction using dependency parse trees
Fundel, K., Küffner, R., & Zimmer, R. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl616 · Cited by 563
Inducing multilingual text analysis tools via robust projection across aligned corpora
Yarowsky, D., Ngai, G., & Wicentowski, R. (2001) · Proceedings of the first international conference on Human language technology research - HLT '01 · doi:10.3115/1072133.1072187 · Cited by 482
Self-citationUsing predicate-argument structures for information extraction
Surdeanu, M., Harabagiu, S., Williams, J., & Aarseth, P. (2003) · Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - ACL '03 · doi:10.3115/1075096.1075098 · Cited by 364
Enriching speech recognition with automatic detection of sentence boundaries and disfluencies
Liu, Y., Shriberg, E., Stolcke, A., Hillard, D., Ostendorf, M., & Harper, M. (2006) · IEEE Transactions on Audio, Speech and Language Processing · doi:10.1109/tasl.2006.878255 · Cited by 270
Metadata
- Authors
- Ngai, G., & Florian, R.
- Venue
- Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001 - NAACL '01
- Published
- 2001
- Pages
- 1-8
- OpenAlex
- W2085606725
- Cited by
- 203
- References
- 1
- FWCI
- 12.96
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Transformation-based learning in the fast lane. https://app.cochat.ai/papers/10.3115/1073336.1073342
- The paper
- Ngai, G., & Florian, R. (2001). Transformation-based learning in the fast lane. Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001 - NAACL '01. https://doi.org/10.3115/1073336.1073342
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.