scispace - formally typeset
Open AccessBook ChapterDOI

Text Chunking Using Transformation-Based Learning

Lance Ramshaw, +1 more
- pp 157-176
TLDR
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.
Abstract
Transformation-based learning, a technique introduced by Eric Brill (1993b), has been shown to do part-of-speech tagging with fairly high accuracy. This same method can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including non-recursive “baseNP” chunks. For this purpose, it is convenient to view chunking as a tagging problem by encoding the chunk structure in new tags attached to each word. In automatic tests using Treebank-derived data, this technique achieved recall and precision rates of roughly 93% for baseNP chunks (trained on 950K words) and 88% for somewhat more complex chunks that partition the sentence (trained on 200K words). Working in this new application and with larger template and training sets has also required some interesting adaptations to the transformation-based learning approach.

read more

Citations
More filters

Formalizing the Use and Characteristics of Constraints in Pipeline Systems

TL;DR: A selection of images from around the world can be found at www.dropboxusercontent.com/taskbar/s3/index.php?taskbar=s3?action=detail&action=show_id&task=show&action-name-triggered
Proceedings ArticleDOI

Chunking Arabic texts using Conditional Random Fields

TL;DR: A method for chunking Arabic texts based on supervised learning using the Conditional Random Fields algorithm and the Penn Arabic Treebank to train the model and the results are very encouraging.
Journal ArticleDOI

Efficient text chunking using linear kernel with masked method

TL;DR: This paper proposes an efficient and accurate text chunking system using linear SVM kernel and a new technique called masked method and proposes a masked-based method to solve unknown word problem to enhance system performance.
Proceedings Article

A Lightweight Semantic Chunker Based on Tagging

TL;DR: A framework for the development of a fast, accurate, and highly portable semantic chunker is introduced based on a non-overlapping, shallow tree-structured language and results show that the phrase- by-phrase approach performs better than its word-by-word counterpart.
Proceedings ArticleDOI

Perspectives on Semantics of the Place from Online Resources

TL;DR: In this article, a methodology for extraction of semantic indexes related to a given geo-referenced place is presented, which correspond to the concepts that should be semantically related to that place, according to a number of perspectives.
References
More filters
Book ChapterDOI

Parsing By Chunks

TL;DR: The typical chunk consists of a single content word surrounded by a constellation of function words, matching a fixed template, and the relationships between chunks are mediated more by lexical selection than by rigid templates.
Proceedings ArticleDOI

A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text

TL;DR: The authors used a linear-time dynamic programming algorithm to find an assignment of parts of speech to words that optimizes the product of (a) lexical probabilities (probability of observing part of speech i given word i) and (b) contextual probabilities (pb probability of observing n following partsof speech).
Proceedings Article

Some advances in transformation-based part of speech tagging

TL;DR: In this article, a rule-based approach to tagging unknown words is described, where the tagger-can be extended into a k-best tagger, where multiple tags can be assigned to words in some cases of uncertainty.
Journal ArticleDOI

Performance structures: A psycholinguistic and linguistic appraisal☆

TL;DR: In this paper, two lines of research are combined to deal with a long-standing problem in both fields: why the performance structures of sentences (structures based on experimental data, such as pausing and parsing values) are not fully accountable for by linguistic theories of phrase structure.
Book

A corpus-based approach to language learning

Eric D. Brill
TL;DR: A learning algorithm is described that takes a small structurally annotated corpus of text and a larger unannotated corpus as input, and automatically learns how to assign accurate structural descriptions to sentences not in the training corpus.
Related Papers (5)