Sciweavers

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

5

COLING
2008

favoriteEmaildiscussreport

127views Computational Linguistics» more COLING 2008»

Robust Similarity Measures for Named Entities Matching

13 years 5 months ago

Robust Similarity Measures for Named Entities Matching

Download hal.archives-ouvertes.fr

Matching coreferent named entities without prior knowledge requires good similarity measures. Soft-TFIDF is a fine-grained measure which performs well in this task. We propose to enhance this kind of metrics, through a generic model in which measures may be mixed, and show experimentally the relevance of this approach.

Erwan Moreau, François Yvon, Olivier Capp&e

Real-time Traffic

COLING 2008 | Computational Linguistics | Coreferent Named Entities | Fine-grained Measure | Prior Knowledge |

claim paper

Related Content

» Measuring Semantic Similarity between Named Entities by Searching the Web Directory

» Exploiting web search to generate synonyms for entities

» Piggyback Using Search Engines for Robust CrossDomain Named Entity Recognition

» Robust Extraction of Named Entity Including Unfamiliar Word

» Cmpmi improved webbased association measure with contextual label matching

» Using Web Directories for Similarity Measurement in Personal Name Disambiguation

» Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textu...

» Crowdsourcing the evaluation of a domainadapted named entity recognition system

» Approximate String Matching for Geographic Names and Personal Names

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	COLING
Authors	Erwan Moreau, François Yvon, Olivier Cappé

Comments (0)