skip to main content
10.1145/1568234.1568244acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicailConference Proceedingsconference-collections
research-article

Improving the comprehension of legal documentation: the case of patent claims

Published: 08 June 2009 Publication History

Abstract

With their abstract vocabulary and overly long sentences, patent claims, like several other genres of legal discourse, are notoriously difficult to read and comprehend. The enormous number of both native and non-native users reading patent claims on a daily basis raises the demand for means that make them easier and faster to understand. An obvious way to satisfy this demand is to paraphrase the original material, i.e., to rewrite it in a more appropriate style, or---even better---to summarize it in the language of preference of the reader such that the reader can rapidly grasp its essence. PATExpert is a patent processing service which incorporates, among other technologies, paraphrasing and multilingual summarization of patent claims. With the goal to offer the user the most suitable options and to evaluate alternative techniques that are based on different contextual and linguistic criteria, both paraphrasing and summarization implement "surface-oriented" strategies and "deep" strategies. The surface strategies make use of shallow linguistic criteria such as punctuation and syntactic and lexical markers. The deep strategies operate on deep-syntactic structures of the claims, using a full fledged text generator for synthesis of the paraphrase or summary, respectively.

References

[1]
A. Farzinfar, G. Lapalme, and J.-P. Declés. Résumé de textes juridiques par identification de leur structure thématique. Traitement automatique des langues, 45(1): 39--64, 2004.
[2]
B. Hachey and C. Grover. Extractive summarisation of legal texts. Artificial Intelligence and Law, 14(4): 305--345, 2006.
[3]
C.-Y. Lin. Rouge: A package for automatic evaluation of summaries. In Proceedings of the ACL Workshop on "Text Summarization Branches Out", Barcelona, 2004.
[4]
D. Lin. Dependency-based evaluation of minipar. In Proc. Workshop on the Evaluation of Parsing Systems, LREC'98, Granada, 1998.
[5]
W. C. Mann and S. Thompson. Rhetorical structure theory: Toward a functional theory of text organization. Text, 8(3): 243--281, 1988.
[6]
D. Marcu. The Theory and Practice of Discourse Parsing and Summarization. The MIT Press, November 2000.
[7]
I. Mel'cuk. Dependency Syntax: Theory and Practice. SUNY, 1988.
[8]
S. Mille and L. Wanner. Making text resources accessible to the reader: The case of patent claims. In Proceedings of the International Language Resources and Evaluation Conference (LREC), Marrakech, 2008.
[9]
M. Nagao, J. ichi Tsujii, and J. ichi Nakamura. The japanese government project for machine translation. Computational Linguistics, 11: 2--3, 1985.
[10]
D. Pressman. Patent It Yourself. Nolo, Berkeley, CA, 2006.
[11]
H. Schmid. Probabilistic part-of-speech tagging using decision trees. In Proceedings of the International Conference on New Methods in Language Processing, pages 44--49, Manchester, UK, September 1994.
[12]
S. Sheremetyeva. Natural language analysis of patent claims. In Proceedings of the ACL Workshop On Patent Corpus Processing, 2003.
[13]
A. Shinmori, M. Okumura, Y. Marukawa, and M. Iwayama. Patent processing for readability. structure analysis and term explanation. In Proceedings of the Workshop on Patent Corpus Processing held at the ACL Meeting, pages 56--65, 2003.
[14]
S. Teufel and M. Moens. Summarizing scientific articles: Experiments with relevance and rhetorical status. Computational Linguistics, 28(4): 409--445, 2002.
[15]
L. Wanner, R. Baeza-Yates, S. Brügmann, J. Codina, B. Diallo, E. Escorsa, M. Giereth, Y. Kompatsiaris, S. Papadopoulos, E. Pianta, G. Piella, I. Puhlmann, G. Rao, M. Rotard, P. Schoester, L. Serafini, and V. Zervaki. Towards content-oriented patent document processing. World Patent Information Journal, 28(4): 409--445, 2007.
[16]
L. Wanner, S. Bott, N. Bouayad-Agha, G. Casamayor, G. Ferraro, J. Graën, A. Joan, F. Lareau, S. Mille, V. Rodríguez, and V. Vidal. Paraphrasing and multilingual summarization of patent claims. In L. Wanner, S. Brügmann, and B. Diallo, editors, PATExpert: A Next Generation Patent Processing Service. IOS Press, Amsterdam, in press.
[17]
I. H. Witten and E. Frank. Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco, 2005.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICAIL '09: Proceedings of the 12th International Conference on Artificial Intelligence and Law
June 2009
244 pages
ISBN:9781605585970
DOI:10.1145/1568234
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 June 2009

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

ICAIL '09

Acceptance Rates

ICAIL '09 Paper Acceptance Rate 22 of 58 submissions, 38%;
Overall Acceptance Rate 69 of 169 submissions, 41%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)23
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2023)A Canonical Context-Preserving Representation for Open IEKnowledge-Based Systems10.1016/j.knosys.2023.110455268:COnline publication date: 23-May-2023
  • (2022)Summarization, simplification, and generationExpert Systems with Applications: An International Journal10.1016/j.eswa.2022.117627205:COnline publication date: 1-Nov-2022
  • (2021)Open Relation Extraction in Patent Claims with a Hybrid NetworkWireless Communications and Mobile Computing10.1155/2021/55472812021(1-7)Online publication date: 27-Apr-2021
  • (2021)Automated Text SimplificationACM Computing Surveys10.1145/344269554:2(1-36)Online publication date: 5-Mar-2021
  • (2021)Evolution of Semantic Similarity—A SurveyACM Computing Surveys10.1145/344075554:2(1-37)Online publication date: 18-Feb-2021
  • (2021)Data Protection in AI ServicesACM Computing Surveys10.1145/344075454:2(1-38)Online publication date: 5-Mar-2021
  • (2021)A Survey on Trajectory Data Management, Analytics, and LearningACM Computing Surveys10.1145/344020754:2(1-36)Online publication date: 5-Mar-2021
  • (2021)Deep Learning for Anomaly DetectionACM Computing Surveys10.1145/343995054:2(1-38)Online publication date: 5-Mar-2021
  • (2021)Text segmentation for patent claim simplification via Bidirectional Long‐Short Term Memory and Conditional Random FieldComputational Intelligence10.1111/coin.1245538:1(205-215)Online publication date: 14-May-2021
  • (2017)Automatic Text SimplificationSynthesis Lectures on Human Language Technologies10.2200/S00700ED1V01Y201602HLT03210:1(1-137)Online publication date: 25-Apr-2017
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media