Sciweavers

Share
6 search results - page 1 / 2
» Efficient approximate entity extraction with edit distance c...
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
9 years 10 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
DASFAA
2005
IEEE
191views Database» more  DASFAA 2005»
9 years 4 months ago
An Efficient Approach to Extracting Approximate Repeating Patterns in Music Databases
Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on ...
Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen
VLDB
2007
ACM
159views Database» more  VLDB 2007»
9 years 10 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
ACL
2006
8 years 11 months ago
An Effective Two-Stage Model for Exploiting Non-Local Dependencies in Named Entity Recognition
This paper shows that a simple two-stage approach to handle non-local dependencies in Named Entity Recognition (NER) can outperform existing approaches that handle non-local depen...
Vijay Krishnan, Christopher D. Manning
CVIU
2008
180views more  CVIU 2008»
8 years 10 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
books