[PDF][PDF] Named entity recognition through classifier combination
R Florian, A Ittycheriah, H Jing… - Proceedings of the …, 2003 - aclanthology.org
This paper presents a classifier-combination experimental framework for named entity
recognition in which four diverse classifiers (robust linear classifier, maximum entropy …
recognition in which four diverse classifiers (robust linear classifier, maximum entropy …
[PDF][PDF] Chunking with support vector machines
T Kudo, Y Matsumoto - Second meeting of the North American …, 2001 - aclanthology.org
Abstract We apply Support Vector Machines (SVMs) to identify English base phrases
(chunks). SVMs are known to achieve high generalization performance even with input data …
(chunks). SVMs are known to achieve high generalization performance even with input data …
Exploring cross-sentence contexts for named entity recognition with BERT
Named entity recognition (NER) is frequently addressed as a sequence classification task
where each input consists of one sentence of text. It is nevertheless clear that useful …
where each input consists of one sentence of text. It is nevertheless clear that useful …
From distributional to semantic similarity
JR Curran - 2004 - era.ed.ac.uk
Lexical-semantic resources, including thesauri and WORDNET, have been successfully
incorporated into a wide range of applications in Natural Language Processing. However …
incorporated into a wide range of applications in Natural Language Processing. However …
[PDF][PDF] Shallow Parsing using Specialized HMMs.
A Molina, F Pla - Journal of Machine Learning Research, 2002 - jmlr.org
We present a unified technique to solve different shallow parsing tasks as a tagging problem
using a Hidden Markov Model-based approach (HMM). This technique consists of the …
using a Hidden Markov Model-based approach (HMM). This technique consists of the …
[PDF][PDF] Memory-based shallow parsing
EF Sang - arXiv preprint cs/0204049, 2002 - jmlr.org
We present memory-based learning approaches to shallow parsing and apply these to five
tasks: base noun phrase identification, arbitrary base phrase recognition, clause detection …
tasks: base noun phrase identification, arbitrary base phrase recognition, clause detection …
Voting between multiple data representations for text chunking
H Shen, A Sarkar - Advances in Artificial Intelligence: 18th Conference of …, 2005 - Springer
This paper considers the hypothesis that voting between multiple data representations can
be more accurate than voting between multiple learning models. This hypothesis has been …
be more accurate than voting between multiple learning models. This hypothesis has been …
[PDF][PDF] Modeling consensus: Classifier combination for word sense disambiguation
R Florian, D Yarowsky - Proceedings of the 2002 Conference on …, 2002 - aclanthology.org
This paper demonstrates the substantial empirical success of classifier combination for the
word sense disambiguation task. It investigates more than 10 classifier combination …
word sense disambiguation task. It investigates more than 10 classifier combination …
Using ilp to construct features for information extraction from semi-structured text
G Ramakrishnan, S Joshi, S Balakrishnan… - … Conference, ILP 2007 …, 2008 - Springer
Abstract Machine-generated documents containing semi-structured text are rapidly forming
the bulk of data being stored in an organisation. Given a feature-based representation of …
the bulk of data being stored in an organisation. Given a feature-based representation of …
[PDF][PDF] Unsupervised named entity classification models and their ensembles
This paper proposes an unsupervised learning model for classifying named entities. This
model uses a training set, built automatically by means of a small-scale named entity …
model uses a training set, built automatically by means of a small-scale named entity …