• Journal of the Korea Society of Computer and Information
• /
• v.23 no.7
• /
• pp.105-111
• /
• 2018

Last March, the world Go competition between AlphaGo, AI Go program developed by Google Deep Mind and professional Go player Lee Sedol has shown us that the 4th industrial revolution using AI has come close. Especially, there ar many system combined with AI hae been developing including program for researching legal information, system for expecting jurisdiction, and processing big data, there is saying that even AI legal person is ready for its appearance. As legal field is mostly based on text-based document, such characteristic makes it easier to adopt artificial intelligence technology. When a legal person receives a case, the first thing to do is searching for legal information and judical precedent, which is the one of the strength of AI. It is very difficult for a human being to utilize a flow of legal knowledge and figures by analyzing them but for AI, this is nothing but a simple job. The ability of AI searching for regulation, precedent, and literature related to legal issue is way over our expectation. AI is evaluated to be able to review 1 billion pages of legal document per second and many people agree that lot of legal job will be replaced by AI. Along with development of AI service, legal service is becoming more advanced and if it devotes to ethical solving of legal issues, which is the final goal, not only the legal field but also it will help to gain nation's trust. If nations start to trust the legal service, it would never be completely replaced by AI. What is more, if it keeps offering advanced, ethical, and quick legal service, value of law devoting to the society will increase and finally, will make contribution to the nation. In this time where we have to compete with AI, we should try hard to increase value of traditional legal service provided by human. In the future, priority of good legal person will be his/her ability to use AI. The only field left to human will be understanding and recovering emotion of human caused by legal problem, which cannot be done by AI's controlling function. Then, what would be the attitude of legal people in this period? It would be to learn the new technology and applying in the field rather than going against it, this will be the way to survive in this new AI period.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.67-76
• /
• 2002

MP3 audio format has good quality and high compression rate ; therefore, the use of MP3 format increases. The requirement of keeping the extra information such as author and lyrics in MP3 files increases. And the tagging systems designed to meet this requirement are suggested. ID3 vl tag and Lyrics3 v2 tag are two most widely used tagging systems. But ID3 vl tag and Lyrics3 v2 tag are the last things to arrive when the file is being streamed. Therefore, users cannot get the tag information until the entire audio file is downloaded. Moreover information synchronized with audio stream may lose its feature. In this paper, a system searching and playing audio files based on tag information in MP3 files is implemented. This system solves the problem that the tag information is ignored when an MP3 files is played on internet. An audio object is described in an XML document, and timing and synchronization between elements in that In document is provided in HTML+TIME style using XSL.

• Journal of Digital Contents Society
• /
• v.18 no.7
• /
• pp.1323-1331
• /
• 2017

Despite the fact that the copyright has grown into a large-scale business, there are many constant problems especially in image copyright. In this study, we propose an automatic object extraction and classification system for the scanned educational book image by combining document image processing and intelligent information technology like deep learning. First, the proposed technology removes noise component and then performs a visual attention assessment-based region separation. Then we carry out grouping operation based on extracted block areas and categorize each block as a picture or a character area. Finally, the caption area is extracted by searching around the classified picture area. As a result of the performance evaluation, it can be seen an average accuracy of 83% in the extraction of the image and caption area. For only image region detection, up-to 97% of accuracy is verified.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.2 s.32
• /
• pp.29-37
• /
• 2005

The compensation data for submerged land have been filed in the form of document or managed with spread sheet like Excell up to now. In the case of dam or highway construction, huge compensation data for the submerged or included land have been managed inefficiently by the administrative manpower. Moreover, where and how to keep the enormous data becomes big problems. In response to the requirements, an submerged land compensation management system based on the location and property information of parcels was developed. The compensation management system has many functions including site searching for compensation, compensation money computing, and compensation data managing. It is expected that the submerged land compensation management system creates various information effects.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.99-115
• /
• 2005

Extensible Markup Language (XML) is an Internet standard that is used to express and convert data, In order to find the necessary information out of XML documents, you need a search system for XML documents, In this research, we have developed a search system that can find documents that matches the structure and content of a given XML document, making the best use of XML structure, Search metrics take account of the similarity in tag names, tag values, and the structure of tags, After a search, the system displays the ranked results in the order of aggregate similarity, Three methods of query are provided: keyword search which is conventional; search with tag names and their values; and search with XML documents, These three methods enable users to choose the method that best suits their preference, resulting in the increase of the usefulness of the system.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.169-180
• /
• 2007

This paper discusses a new unsupervised XML document clustering technique based on the function transform and FFT(Fast Fourier Transform). An XML document is transformed into a discrete function based on the hierarchical nesting structure of the elements. The discrete function is, then, transformed into vectors using FFT. The vectors of two documents are compared using a weighted Euclidean distance metric. If the comparison is lower than the pre specified threshold, the two documents are considered similar in the structure and are grouped into the same cluster. XML clustering can be useful for the storage and searching of XML documents. The experiments were conducted with 800 synthetic documents and also with 520 real documents. The experiments showed that the function transform and FFT are effective for the incremental and unsupervised clustering of XML documents similar in structure.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.317-324
• /
• 2006

In this paper, we propose a new indexing technique to solve various queries which have a strong good point not only database indexing schema take advantage of converting from semi-structured data to structured data but also performance is more faster than before. We represent structure information of XML document between nodes of tree that additional numbering information which can be bit-stream without modified structure of XML tree. And, We add in indexing schema searching incidental structure information in the process. In Querying schema, we recover ancestor nodes through give information of node using indexing schema in complete path query expression as well as relative path query expression. Therefore, it takes advantage of making derivative query expression with given query. In this process, we recognize that indexing and querying schema can get searched result set faster and more accurate. Because response time is become shorter by bit operating, when query occur and it just needs information of record set earch node in database.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.3
• /
• pp.157-177
• /
• 1998

The 21st century will be the advanced Information society era. The management of very large quantity of electronic documents is important because new applications such as Digital Libraries, CSCW (Computer-Supported Cooperative Work) in Intranet, CALS (Commerce At the Light Speed) are emerging, which require the functionalities of efficient storing, searching and managing a bulk of electronic documents. SGML(Standard Generalized Markup Language) is an ISO Standard for representing structure information of electronic documents. This paper proposes an effective data model for storing and managing SGML documents. We also describe the design and implementation details of SGML document management system, which has capabilities of storing SGML instances, generating schema dynamically, and retrieving structure elements efficiently.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.3
• /
• pp.1-10
• /
• 2022

With the development of web technology, large amounts of web documents are being produced. This web document contains various spatial texts, and by converting these texts into spatial information, it is the basis for searching for text documents with spatial query. These spatial texts consist of a wide range of areas, including postal codes and local phone numbers, as well as administrative place names and POI names. This paper presents algorithms that can map locations based on spatial text information existing within web documents. Through these algorithms, web documents can be searched for documents describing the region on a map rather than a general web search. In this paper, we demonstrated the presented algorithms are useful by implementing a web geo-text query system.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.57-66
• /
• 2022

In this paper, we propose a legal document search method that uses the Sentence-BERT model. The general public who wants to use the legal search service has difficulty searching for relevant precedents due to a lack of understanding of legal terms and structures. In addition, the existing keyword and text mining-based legal search methods have their limits in yielding quality search results for two reasons: they lack information on the context of the judgment, and they fail to discern homonyms and polysemies. As a result, the accuracy of the legal document search results is often unsatisfactory or skeptical. To this end, This paper aims to improve the efficacy of the general public's legal search in the Supreme Court precedent and Legal Aid Counseling case database. The Sentence-BERT model embeds contextual information on precedents and counseling data, which better preserves the integrity of relevant meaning in phrases or sentences. Our initial research has shown that the Sentence-BERT search method yields higher accuracy than the Doc2Vec or TF-IDF search methods.