The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Representing text chunks
Open accessAbstract
Dividing sentences in chunks of words is a useful preprocessing step for parsing, information extraction and information retrieval.(l~mshaw and Marcus, 1995) have introduced a "convenient" data representation for chunking by converting it to a tagging task.In this paper we will examine seven different data representations for the problem of recognizing noun phrase chunks.We will show that the the data representation choice has a minor influence on chunking performance.However, equipped with the most suitable data representation, our memory-based learning chunker was able to improve the best published chunking results for a standard data set.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Text Chunking Using Transformation-Based Learning
Ramshaw, L. A., & Marcus, M. P. (1999) · Text, Speech and Language Technology · doi:10.1007/978-94-017-2390-9_10 · Cited by 1,460
Abney, S. P. (1991) · Studies in Linguistics and Philosophy · doi:10.1007/978-94-011-3474-3_10 · Cited by 882
Maximum entropy models for natural language ambiguity resolution
Ratnaparkhi, A., & Marcus, M. P. (1998) · Scholarly Commons (University of Pennsylvania) · Cited by 422
Forgetting Exceptions is Harmful in Language Learning
Daelemans, W., Van Den Bosch, A., & Zavrel, J. (1999) · Machine Learning · doi:10.1023/a:1007585615670 · Cited by 231
A memory-based approach to learning shallow natural language patterns
Argamon, S., Dagan, I., & Krymolowski, Y. (1998) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/980845.980857 · Cited by 81
Cited by
End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF
Ma, X., & Hovy, E. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1101 · Cited by 2,567
Design challenges and misconceptions in named entity recognition
Ratinov, L., & Roth, D. (2009) · Proceedings of the Thirteenth Conference on Computational Natural Language Learning - CoNLL '09 · doi:10.3115/1596374.1596399 · Cited by 1,448
BERTimbau: Pretrained BERT Models for Brazilian Portuguese
Souza, F., Nogueira, R., & Lotufo, R. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-61377-8_28 · Cited by 647
A Survey on Aspect-Based Sentiment Analysis: Tasks, Methods, and Challenges
Zhang, W., Li, X., Deng, Y., Bing, L., & Lam, W. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3230975 · Cited by 567
Chunking with support vector machines
Kudo, T., & Matsumoto, Y. (2001) · Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001 - NAACL '01 · doi:10.3115/1073336.1073361 · Cited by 520
Metadata
- Authors
- Sang, E. F. T. K., & Veenstra, J.
- Venue
- Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics -
- Published
- 1999
- Pages
- 173
- OpenAlex
- W2008830554
- Cited by
- 456
- References
- 5
- FWCI
- 5.38
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Representing text chunks. https://app.cochat.ai/papers/10.3115/977035.977059
- The paper
- Sang, E. F. T. K., & Veenstra, J. (1999). Representing text chunks. Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics -. https://doi.org/10.3115/977035.977059
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.