论文信息 - Detecting the Countability of English Compound Nouns Using Web-based Models

Detecting the Countability of English Compound Nouns Using Web-based Models

In this paper, we proposed an approach for detecting the countability of English compound nouns treating the web as a large corpus of words. We classified compound nouns into three classes: countable, uncountable, plural only. Our detecting algorithm is based on simple, viable n-gram models, whose parameters can be obtained using the WWW search engine Google. The detecting thresholds are optimized on the small training set. Finally we experimentally showed that our algorithm based on these simple models could perform the promising results with a precision of 89.2% on the total test set.

Jing Peng | Kenji Araki

[1] Frank Keller,et al. Using the Web to Obtain Frequencies for Unseen Bigrams , 2003, CL.

[2] Frank Keller,et al. The Web as a Baseline: Evaluating the Performance of Unsupervised Web-based Models for a Range of NLP Tasks , 2004, NAACL.

[3] Frank Keller,et al. Using the Web to Overcome Data Sparseness , 2002, EMNLP.

[4] Timothy Baldwin,et al. Learning the Countability of English Nouns from Corpus Data , 2003, ACL.

[5] Francis Bond,et al. Using an Ontology to Determine English Countability , 2002, COLING.

[6] Lane Schwartz,et al. Corpus-based acquisition of head noun countability features , 2002 .