Class-based n-gram models of natural language
Computational Linguistics
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Bunsetsu identification using category-exclusive rules
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Filtering-Ranking Perceptron Learning for Partial Parsing
Machine Learning
Introduction to the CoNLL-2000 shared task: chunking
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Online Passive-Aggressive Algorithms
The Journal of Machine Learning Research
Towards translation of legal sentences into logical forms
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Hi-index | 0.00 |
Analyzing the logical structure of a sentence is important for understanding natural language. In this paper, we present a task of Recognition of Requisite Part and Effectuation Part in Law Sentences, or RRE task for short, which is studied in research on Legal Engineering. The goal of this task is to recognize the structure of a law sentence. We empirically investigate how the RRE task is conducted with respect to various supervised machine learning models. We also compared the impact of unlabeled data to RRE tasks. Experimental results for Japanese legal text domains showed that sequence learning models are suitable for RRE tasks and unlabled data also significantly contribute to the performance of RRE tasks.