A Legal Ontology Refinement Support Environment Using a Machine-Readable Dictionary

Masaki Kurematsu, Takahira Yamaguchi

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

This paper discusses how to refine a given initial legal ontology using an existing MRD (Machine-Readable Dictionary). There are two hard issues in the refinement process. One is to find out those MRD concepts most related to given legal concepts. The other is to correct bugs in a given legal ontology, using the concepts extracted from an MRD. In order to resolve the issues, we present a method to find out the best MRD correspondences to given legal concepts, using two match algorithms. Moreover, another method called a static analysis is given to refine a given legal ontology, based on the comparison between the initial legal ontology and the best MRD correspondences to given legal concepts. We have implemented a software environment to help a user refine a given legal ontology based on these methods. The empirical results have shown that the environment works well in the field of Contracts for the International Sale of Goods.

Original languageEnglish
Pages (from-to)119-137
Number of pages19
JournalArtificial Intelligence and Law
Volume5
Issue number1-2
Publication statusPublished - 1997
Externally publishedYes

Fingerprint

Glossaries
dictionary
ontology
Ontology
Static analysis
sale
work environment
Sales

Keywords

  • Contracts for the International Sale of Goods
  • Definition match
  • Legal ontologies
  • Machine-readable dictionaries
  • Ontology refinement
  • Spell match
  • Static analysis

ASJC Scopus subject areas

  • Software

Cite this

A Legal Ontology Refinement Support Environment Using a Machine-Readable Dictionary. / Kurematsu, Masaki; Yamaguchi, Takahira.

In: Artificial Intelligence and Law, Vol. 5, No. 1-2, 1997, p. 119-137.

Research output: Contribution to journalArticle

@article{890d438cb0f84deebf7375a97f70df8c,
title = "A Legal Ontology Refinement Support Environment Using a Machine-Readable Dictionary",
abstract = "This paper discusses how to refine a given initial legal ontology using an existing MRD (Machine-Readable Dictionary). There are two hard issues in the refinement process. One is to find out those MRD concepts most related to given legal concepts. The other is to correct bugs in a given legal ontology, using the concepts extracted from an MRD. In order to resolve the issues, we present a method to find out the best MRD correspondences to given legal concepts, using two match algorithms. Moreover, another method called a static analysis is given to refine a given legal ontology, based on the comparison between the initial legal ontology and the best MRD correspondences to given legal concepts. We have implemented a software environment to help a user refine a given legal ontology based on these methods. The empirical results have shown that the environment works well in the field of Contracts for the International Sale of Goods.",
keywords = "Contracts for the International Sale of Goods, Definition match, Legal ontologies, Machine-readable dictionaries, Ontology refinement, Spell match, Static analysis",
author = "Masaki Kurematsu and Takahira Yamaguchi",
year = "1997",
language = "English",
volume = "5",
pages = "119--137",
journal = "Artificial Intelligence and Law",
issn = "0924-8463",
publisher = "Springer Netherlands",
number = "1-2",

}

TY - JOUR

T1 - A Legal Ontology Refinement Support Environment Using a Machine-Readable Dictionary

AU - Kurematsu, Masaki

AU - Yamaguchi, Takahira

PY - 1997

Y1 - 1997

N2 - This paper discusses how to refine a given initial legal ontology using an existing MRD (Machine-Readable Dictionary). There are two hard issues in the refinement process. One is to find out those MRD concepts most related to given legal concepts. The other is to correct bugs in a given legal ontology, using the concepts extracted from an MRD. In order to resolve the issues, we present a method to find out the best MRD correspondences to given legal concepts, using two match algorithms. Moreover, another method called a static analysis is given to refine a given legal ontology, based on the comparison between the initial legal ontology and the best MRD correspondences to given legal concepts. We have implemented a software environment to help a user refine a given legal ontology based on these methods. The empirical results have shown that the environment works well in the field of Contracts for the International Sale of Goods.

AB - This paper discusses how to refine a given initial legal ontology using an existing MRD (Machine-Readable Dictionary). There are two hard issues in the refinement process. One is to find out those MRD concepts most related to given legal concepts. The other is to correct bugs in a given legal ontology, using the concepts extracted from an MRD. In order to resolve the issues, we present a method to find out the best MRD correspondences to given legal concepts, using two match algorithms. Moreover, another method called a static analysis is given to refine a given legal ontology, based on the comparison between the initial legal ontology and the best MRD correspondences to given legal concepts. We have implemented a software environment to help a user refine a given legal ontology based on these methods. The empirical results have shown that the environment works well in the field of Contracts for the International Sale of Goods.

KW - Contracts for the International Sale of Goods

KW - Definition match

KW - Legal ontologies

KW - Machine-readable dictionaries

KW - Ontology refinement

KW - Spell match

KW - Static analysis

UR - http://www.scopus.com/inward/record.url?scp=0031100303&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031100303&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031100303

VL - 5

SP - 119

EP - 137

JO - Artificial Intelligence and Law

JF - Artificial Intelligence and Law

SN - 0924-8463

IS - 1-2

ER -