Abstract
This paper presents an important phase of our new approach for summarizing the given Vietnamese paragraph. The central of this phase is an algorithm for computing verbal relationships in the process of generating the Vietnamese paragraph from the logical expression of discourse representation structure (DRS), which is the first-order logic expressions without explicit quantifiers, and represents the meaning as well as reflects the potential contexts of a given discourse or a sequence of sentences. By defining elements to describe the appropriate information in each predicate of the logical expression (or can be called “DRS-conditions”), the algorithm is based on in turn considering three consecutive predicates in a logical expression for determining: the relationship between the first and second sentence, the relationship between the second and third sentence, and the priority when comparing these two relationships. The evaluation achieves two given criteria: the semantic completeness of summarization, and the natural quality of new reduced paragraph.
Highlights
IntroductionThe study of transforming a given paragraph to a new summary
The study of transforming a given paragraph to a new summary (Das and Martins [7], Lloret [20], Mani and Mayburi [21], Jezek and Steinberger [13], Jones [14,15]) has to answer three important questions (Jones [14,15]): (i) how to represent the meaning of the source paragraph; (ii) how to construct a computing representation form of the destination paragraph by transforming the source computing representation form; (iii) how to transform the destination computing representation form into the complete paragraph
Follow the idea of “abstraction”, this paper addresses an important problem in our new approach for summarizing the given Vietnamese paragraph having more than two simple sentences: generate the new reduced Vietnamese paragraph from the logical expression of discourse representation structure (DRS) (Kamp [16], Covington and Schmitz [5], Covington et al [6], Blackburn and Bos [1])—under the form of expressions without explicit quantifiers in firstorder logic (FOL)
Summary
The study of transforming a given paragraph to a new summary Using the logical expression representing the semantic of the paragraph, our objective is to propose a solution for transforming this logical expression into a new reduced complete Vietnamese paragraph. Lan (x) vui_veij (x) con_trai (y) h.oc_cùng (x,y) khoái_chí (y) d-iêij m_cao (z) d-u’.o’c (y,z). ∃x∃y∃z[lan(x) & vui_veij (x) &con_trai (y) & ho.c_cùng (x,y) & khoái_chí (y) & d-iêij m_cao (z) & được (y,z)]. With this logical expression, we transform into the new reduced Vietnamese paragraph as follows:. The considered objects in this research are complete logical expressions encoding the semantics of Vietnamese paragraphs. The heart of the proposed solution is an algorithm that auto generates the new reduced Vietnamese paragraph from the logical expression.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
