基于规则的音译搜索引擎中解决音译歧义的词规范化方法
Rule based Approach for Word Normalization by resolving Transcription Ambiguity in Transliterated Search Queries
摘要:
查询词与文档词的匹配是诸如向量空间模型等尽力信息检索模型的基本功能。在我们的基于SMS的信息系统的问题中,我们期望普通人参与信息搜索。我们的系统允许移动用户制定自己的话,自己的音译风格和拼写形式的查询。为了实现这种灵活性,我们已经解决了由于用户查询术语中固有的转录噪声而导致的术语级歧义。我们已经开发了一个基于规则的方法来选择最相关的关闭标准的条款,每个嘈杂的条款在用户查询。我们已经使用了四个不同版本的规则为基础的算法与变化的规则集。我们制定了这个规则集,包括基本的Levenshtein最小编辑距离算法的术语匹配。本文介绍了马拉地语和印地语文献信息系统的实验和相应的结果。我们对马拉地语和印地语文学进行了实验,其中包括歌曲,gazals,powadas,bharud和其他类型的标准音译形式,如ITRANS。
英文摘要:
Query term matching with document term matching is the basic function of any best effort Information Retrieval models like Vector Space Model. In our problem of SMS based Information Systems we expect common people to participate in information search. Our system allows mobile users to formulate their queries in their own words, own transliteration style and spelling formation. To achieve this flexibility we have resolved the term level ambiguity due to inherent transcription noise in user query terms. We have developed a rule based approach to select most relevantly close standard term for each noisy term in the user query. We have used four different versions of the rule based algorithm with variation in the rule set. We have formulated this rule set including the basic Levenshtein minimum edit distance algorithm for term matching. This paper presents the experiments and corresponding results of Marathi and Hindi language literature information system. We have experimented on Marathi and Hindi literature which include songs, gazals, powadas, bharud and other types in a standard transliteration form like ITRANS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。