Associative Search on Shogi Game Records
スポンサーリンク
概要
- 論文の詳細を見る
Associative search is information retrieval based on the similarity between two different items of text information. This paper reports experiments on associative search on a large number of short documents containing a small set of words. We also show the extension of the set of words with a semantic relation, and investigate its effect. As an instance, experiments were performed on 49,767 professional (non-handicapped) Shogi game records with 1,923 next move problems for evaluation. The extension of the set of words by pairing under semantic relations, called semantic coupling, is examined to see the effect of enlarging the word space from unigrams to bigrams. Although the search results are not as precise as next move search, we observe improvement by filtering the unigram search result with the bigram search, especially in the early phase of Shogi games. This also fits our general feeling that the bigram search detects castle patterns well.
- 2011-06-29
著者
-
Mizuhito Ogawa
Japan Advanced Institute Of Science And Technology
-
Mizuhito Ogawa
School of Information Science Japan Advanced Institute of Science and Technology
-
Kobkrit Viriyayudhakorn
School of Knowledge Science, Japan Advanced Institute of Science and Technology, Japan
-
Kobkrit Viriyayudhakorn
School Of Knowledge Science Japan Advanced Institute Of Science And Technology Japan
関連論文
- Stacking-based Context-sensitive Points-to Analysis for Java
- On the Inclusion Problem for Context-free Real-time Languages
- Alternate Stacking Technique Revisited: Inclusion Problem of Superdeterministic Pushdown Automata
- Associative Search on Shogi Game Records