Access the full text.
Sign up today, get DeepDyve free for 14 days.
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.
Artificial Intelligence and Law – Springer Journals
Published: Sep 19, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.