Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ACL
2006

favoriteEmaildiscussreport

130views Computational Linguistics» more ACL 2006»

N Semantic Classes are Harder than Two

13 years 6 months ago

N Semantic Classes are Harder than Two

Download acl.ldc.upenn.edu

We show that we can automatically classify semantically related phrases into 10 classes. Classification robustness is improved by training with multiple sources of evidence, including within-document cooccurrence, HTML markup, syntactic relationships in sentences, substitutability in query logs, and string similarity. Our work provides a benchmark for automatic n-way classification into WordNet's semantic classes, both on a TREC news corpus and on a corpus of substitutable search query phrases.

Ben Carterette, Rosie Jones, Wiley Greiner, Cory B

Real-time Traffic

ACL 2006 | ACL 2007 | Automatic N-way Classification | Search Query Phrases | WordNet's Semantic Classes |

claim paper

Related Content

» Automatic Direct and Indirect Schema Mapping Experiences and Lessons Learned

» Separating DistributionFree and MistakeBound Learning Models over the Boolean Domain

» Infinite trace equivalence

» Fast Integer Merging on the EREW PRAM

» Finding Admissible and Preferred Arguments Can be Very Hard

» OMAC OneKey CBC MAC

» Inducing Classes of Terms from Text

» SPARQLDL SPARQL Query for OWLDL

» Some DiscriminantBased PAC Algorithms

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	ACL
Authors	Ben Carterette, Rosie Jones, Wiley Greiner, Cory Barr

Comments (0)