Presentation 2002/7/9
Organization of Documents in Terms of Maximal Analogies
Makoto HARAGUCHI, Shigetora NAKANO, Masaharu YOSHIOKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Given two or more similar documents in the form of texts, we present a notion of maximal analogies representing maximal sequences consisting of pairs of similar events in the documents. They are required to satisfy certain cost condition so that meaningless similarities between documents are never concluded. A bottom-up search procedure to find a maximal analogy satisfying the cost condition is also presented. In addition to the set of similar documents, we suppose another set of dissimilar ones. Then a maximal analogy is furthermore tested for their appropriateness so as not to explain the latter ones. The test can be performed by an effective subsumption check procedure.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Maximal Analogy
Paper # NLC2002-24
Date of Issue

Conference Information
Committee NLC
Conference Date 2002/7/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Natural Language Understanding and Models of Communication (NLC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Organization of Documents in Terms of Maximal Analogies
Sub Title (in English)
Keyword(1) Maximal Analogy
1st Author's Name Makoto HARAGUCHI
1st Author's Affiliation Div. Electronics and Information Eingineering, Graduate School of Engineering, Hokkaido University()
2nd Author's Name Shigetora NAKANO
2nd Author's Affiliation Div. Electronics and Information Eingineering, Graduate School of Engineering, Hokkaido University
3rd Author's Name Masaharu YOSHIOKA
3rd Author's Affiliation Div. Electronics and Information Eingineering, Graduate School of Engineering, Hokkaido University
Date 2002/7/9
Paper # NLC2002-24
Volume (vol) vol.102
Number (no) 200
Page pp.pp.-
#Pages 5
Date of Issue