Proceedings of the COLING/ACL on Main Conference Poster Sessions - 2006
DOI: 10.3115/1273073.1273080
|View full text |Cite
|
Sign up to set email alerts
|

N semantic classes are harder than two

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2008
2008
2008
2008

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
(9 reference statements)
0
1
0
Order By: Relevance
“…There have been studies leveraging external sources like WordNet [7] and Wikipedia [3] to determine semantic relationships among queries. [11] and [12] use the temporal frequency information of queries to infer semantic relationships among them.…”
Section: Related Workmentioning
confidence: 99%
“…There have been studies leveraging external sources like WordNet [7] and Wikipedia [3] to determine semantic relationships among queries. [11] and [12] use the temporal frequency information of queries to infer semantic relationships among them.…”
Section: Related Workmentioning
confidence: 99%