TAILIEUCHUNG - Báo cáo khoa học: "A Graph Approach to Spelling Correction in Domain-Centric Search"

Spelling correction for keyword-search queries is challenging in restricted domains such as personal email (or desktop) search, due to the scarcity of query logs, and due to the specialized nature of the domain. For that task, this paper presents an algorithm that is based on statistics from the corpus data (rather than the query log). This algorithm, which employs a simple graph-based approach, can incorporate different types of data sources with different levels of reliability (., email subject vs. email body), and can handle complex spelling errors like splitting and merging of words. . | A Graph Approach to Spelling Correction in Domain-Centric Search Zhuowei Bao University of Pennsylvania Philadelphia PA 19104 USA zhuowei@ Benny Kimelfeld IBM Research-Almaden San Jose CA 95120 USA kimelfeld@ Yunyao Li IBM Research-Almaden San Jose CA 95120 USA yunyaoli@ Abstract Spelling correction for keyword-search queries is challenging in restricted domains such as personal email or desktop search due to the scarcity of query logs and due to the specialized nature of the domain. For that task this paper presents an algorithm that is based on statistics from the corpus data rather than the query log . This algorithm which employs a simple graph-based approach can incorporate different types of data sources with different levels of reliability . email subject vs. email body and can handle complex spelling errors like splitting and merging of words. An experimental study shows the superiority of the algorithm over existing alternatives in the email domain. 1 Introduction An abundance of applications require spelling correction which at the high level is the following task. The user intends to type a chunk q of text but types instead the chunk s that contains spelling errors which we discuss in detail later due to uncareful typing or lack of knowledge of the exact spelling of q. The goal is to restore q when given s. Spelling correction has been extensively studied in the literature and we refer the reader to comprehensive summaries of prior work Peterson 1980 Kukich 1992 Jurafsky and Martin 2000 Mitton 2010 . The focus of this paper is on the special case where q is a search query and where s instead of q is submitted to a search engine with the goal of retrieving documents that match the search query q . Spelling correction for search queries is important because a significant portion of posed queries may be misspelled Cucerzan and Brill 2004 . Effective 905 spelling correction has a major effect on the experience and effort .

• Báo cáo khoa học
• A Graph Approach
• Spelling Correction
• Domain Centric Search
• báo cáo khoa học
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• Graph modeling
• Graph database
• Graph queries
• Connected data
• Iot data management
• Spectral clustering
• Graph partitioning approach
• Graph cut
• Laplacian matrix
• Normalized cut
• BMC Genomics
• Graph genomes
• Read mapping
• Pan genomics
• Reference genomes
• Graph based references
• Sequence alignment
• A Graph based Cross lingual Projection Approach
• Weakly Supervised Relation Extraction
• Gary Geunbae Lee
• SEMANIIC PARSING
• GRAPH LANGUAGE TRANSFORMATION A MULIIDIMENSIONAL
• PARSING HIGHLY INFLECTIONAL LANGUAGES
• scientific reports
• model language
• process natural language
• International Journal of computer science & communication networks
• An efficient multiple keywords search method
• Extended skip graph
• Plurality of keywords
• A bloom filter
• Image segmentation
• Defect detection
• K means and graph
• Original image
• Human operators
• BMC Chemistry
• Graph set analysis
• Solid form selection
• Hydrogen bonded network
• Chemical engineers
• Graph theoretic models
• Data integration
• Split graphs
• Microbiomes play vital roles
• Knowledge graph
• Semantic search
• Extending query
• Distinguishes concepts
• Terminological confusion
• Graph theory
• Personalized learning
• Learning path
• Recommendation system
• Compulsory requirements
• trình bày báo cáo
• tài liệu báo cáo khoa học
• báo cáo y học
• kiến thức y học
• nghiên cứu y học
• báo cáo hóa học
• công trình nghiên cứu về hóa học
• tài liệu về hóa học
• cách trình bày báo cáo
• BMC Bioinformatics
• Protein protein interaction
• Graph clustering
• Random walk
• Topic modeling
• Gene expression
• Functional module
• Protein complex
• Biomedical text mining
• Knowledge base
• Relation extraction
• Biomedical knowledge bases
• KB construction
• Heterogeneous diseases
• Somatic mutations
• Oncogenes specifically
• Mutational clustering
• Open source
• Graph layout
• Complex networks
• Ongoing biological
• Network visualization
• Fundamentally linear
• Motif finding
• Short sequences
• Exosomal RNAs
• Graph algorithms
• Genome Biology
• High throughput chromosome conformation capture
• Chromosome conformation capture methods
• Three dimensional genome
• Multi task spectral clustering method