tailieunhanh - Báo cáo khoa học: "Parsing Free Word Order Languages in the Paninian Framework"

There is a need to develop a suitable c o m p u t a t i o n a l g r a m m a r formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more efficient. Second, such a formalism is also likely to be linguistically more elegant and satisfying. In this paper, we describe such a formalism, called the Paninian framework, t h a t has been successfully applied to Indian languages. This p a p e r shows t h a t the Paninian framework. | Parsing Free Word Order Languages in the Paninian Framework Akshar Bharati Rajeev Sangal Department of Computer Science and Engineering Indian Institute of Technology Kanpur Kanpur 208016 India Internet sangal@ Abstract There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons First a suitably designed formalism is likely to be more efficient. Second such a formalism is also likely to be linguistically more elegant and satisfying. In this paper we describe such a formalism called the Paninian framework that has been successfully applied to Indian languages. This paper shows that the Paninian framework applied to modern Indian languages gives an elegant account of the relation between surface form vib-hakti and semantic karaka roles. The mapping is elegant and compact. The same basic account also explains active-passives and complex sentences. This suggests that the solution is not just adhoc but has a deeper underlying unity. A constraint based parser is described for the framework. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints. Efficient solutions are known for these problems. It is interesting to observe that such a parser designed for free word order languages compares well in asymptotic time complexity with the parser for context free grammars CFGs which are basically designed for positional languages. 1 Introduction A majority of human languages including Indian and other languages have relatively free word order. In free word order languages order of words contains only secondary information such as emphasis etc. Primary information relating to gross meaning . one that includes semantic relationships is contained elsewhere. Most existing computational grammars are based on context free grammars which are basically positional grammars. It is important to develop a suitable computational grammar formalism for free word order .

• Báo cáo khoa học
• Parsing Free Word
• Order Languages
• Paninian Framework
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• Bài giảng Xử lý ngôn ngữ tự nhiên
• Ngôn ngữ tự nhiên
• Kỹ thuật lập trình
• Xử lý nhập nhằng ngữ nghĩa
• Xử lý ngữ nghĩa
• Xử lý ngôn ngữ
• Natural Language Processing
• Ngôn ngữ lập trình
• Nhập nhằng cấu trúc
• Tri thức về ngôn ngữ
• Mô hình n gram
• Dịch máy
• Phương pháp dịch máy
• Hiểu ngôn ngữ
• Phân tích ngữ nghĩa
• Phân loại tin tự động
• Biểu diễn vị từ
• Thuộc tính về sự kiện
• Thuộc tính về sự kiện
• Mô hình ngôn ngữ Google Book N grams
• Mô hình ngôn ngữ KenLM
• Phương pháp làm mịn
• Tách từ tiếng Việt
• Gán nhãn từ loại
• Phân tích cú pháp
• Nghĩa từ vựng
• Phân giải nhập nhằng từ
• Phân loại văn bản
• Lexical chain
• Phản hồi thông tin
• Bài toán PTCP
• Cấu trúc ngữ pháp
• Phân tích cú pháp xác suất
• CKY kết hợp xác suất
• Văn phạm phi ngữ cảnh xác suất
• Hình thái học