The Extraction of Chinese Temporal Expressions Based on LEX

2013 ◽  
Vol 321-324 ◽  
pp. 2013-2016
Author(s):  
Dan Dan Zhao ◽  
Liang Song ◽  
Qi Wei Yang
Keyword(s):  
Natural Language ◽  
Information Extraction ◽  
Question Answering ◽  
Temporal Information ◽  
Source Program ◽  
C Compiler ◽  
Grammar Rules ◽  
Temporal Expressions ◽  
Chinese Texts

Temporal Expressions are important structures in natural language. Temporal information is useful in many NLP applications, such as information extraction, question answering and summarization. In this paper, we present an approach for extracting temporal expressions from Chinese texts. Using LEX parser, defining grammar rules of temporal expressions as LEX source program through the cooperation of LEX and C compiler, get the temporal expressions from unprocessed Chinese corpus. Our experiments demonstrate that on the TempEval 2010 Chinese corpus this approach is valid with the F1-measure values of 93.97%.

Learning Temporal Information from Text

2011 ◽  
pp. 1146-1149 ◽  
Author(s):  
Feng Pan
Keyword(s):  
Natural Language ◽  
Intelligent Agents ◽  
Stock Price ◽  
Question Answering ◽  
Information Science ◽  
Video Retrieval ◽  
Temporal Information ◽  
Time Dimension ◽  
Temporal Expressions ◽  
Constraint Modeling

As an essential dimension of our information space, time plays a very important role in every aspect of our lives. Temporal information is necessarily required in many applications, such as temporal constraint modeling in intelligent agents (Hritcu and Buraga, 2005), semantic web services (Pan and Hobbs, 2004), temporal content modeling and annotation for semantic video retrieval (QasemiZadeh et al., 2006), geographic information science (Agarwal, 2005), data integration of historical stock price databases (Zhu et al., 2004), ubiquitous and pervasive systems for modeling the time dimension of the context (Chen et al., 2004), and so on. Extracting temporal information from text is especially useful for increasing the temporal awareness for different natural language applications, such as question answering, information retrieval, and summarization. For example, in summarizing a story in terms of a timeline, a system may have to extract and chronologically order events in which a particular person participated. In answering a question as to a person’s current occupation, a system may have to selectively determine which of several occupations reported for that person is the most recently reported one (Mani et al., 2004). This chapter presents recent advances in applying machine learning and data mining approaches to automatically extract explicit and implicit temporal information from natural language text. The extracted temporal information includes, for example, events, temporal expressions, temporal relations, (vague) event durations, event anchoring, and event orderings.

scholarly journals Building Graph for Events and Time in Natural Language Text

2020 ◽  
Vol 9 (3) ◽  
pp. 581-586
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Information Extraction ◽  
Language Processing ◽  
Question Answering ◽  
Relation Extraction ◽  
Event Extraction ◽  
Event Time ◽  
Time Graph ◽  
Question Answering Systems

Events and time are two major key terms in natural language processing due to the various event-oriented tasks these are become an essential terms in information extraction. In natural language processing and information extraction or retrieval event and time leads to several applications like text summaries, documents summaries, and question answering systems. In this paper, we present events-time graph as a new way of construction for event-time based information from text. In this event-time graph nodes are events, whereas edges represent the temporal and co-reference relations between events. In many of the previous researches of natural language processing mainly individually focused on extraction tasks and in domain-specific way but in this work we present extraction and representation of the relationship between events- time by representing with event time graph construction. Our overall system construction is in three-step process that performs event extraction, time extraction, and representing relation extraction. Each step is at a performance level comparable with the state of the art. We present Event extraction on MUC data corpus annotated with events mentions on which we train and evaluate our model. Next, we present time extraction the model of times tested for several news articles from Wikipedia corpus. Next is to represent event time relation by representation by next constructing event time graphs. Finally, we evaluate the overall quality of event graphs with the evaluation metrics and conclude the observations of the entire work

scholarly journals Introducing External Knowledge to Answer Questions with Implicit Temporal Constraints over Knowledge Base

2020 ◽  
Vol 12 (3) ◽  
pp. 45
Author(s):  
Wenqing Wu ◽  
Zhenfang Zhu ◽  
Qiang Lu ◽  
Dianyuan Zhang ◽  
Qiangqiang Guo
Keyword(s):  
Natural Language ◽  
Knowledge Base ◽  
Question Answering ◽  
Knowledge Bases ◽  
Temporal Information ◽  
Temporal Constraints ◽  
External Knowledge ◽  
Question Answering Systems ◽  
Natural Language Question ◽  
Applied Knowledge

Knowledge base question answering (KBQA) aims to analyze the semantics of natural language questions and return accurate answers from the knowledge base (KB). More and more studies have applied knowledge bases to question answering systems, and when using a KB to answer a natural language question, there are some words that imply the tense (e.g., original and previous) and play a limiting role in questions. However, most existing methods for KBQA cannot model a question with implicit temporal constraints. In this work, we propose a model based on a bidirectional attentive memory network, which obtains the temporal information in the question through attention mechanisms and external knowledge. Specifically, we encode the external knowledge as vectors, and use additive attention between the question and external knowledge to obtain the temporal information, then further enhance the question vector to increase the accuracy. On the WebQuestions benchmark, our method not only performs better with the overall data, but also has excellent performance regarding questions with implicit temporal constraints, which are separate from the overall data. As we use attention mechanisms, our method also offers better interpretability.

scholarly journals Temporal Expressions in Polish Corpus KPWr

2015 ◽  
pp. 293-317
Author(s):  
Jan Kocoń ◽  
Michał Marcińczuk ◽  
Marcin Oleksy ◽  
Tomasz Bernaś ◽  
Michał Wolski
Keyword(s):  
Discourse Analysis ◽  
Information Extraction ◽  
Question Answering ◽  
State Of The Art ◽  
Event Recognition ◽  
Event Identification ◽  
Event Description ◽  
University Of Technology ◽  
Temporal Expressions ◽  
Source Of Information

Temporal Expressions in Polish Corpus KPWrThis article presents the result of the recent research in the interpretation of Polish expressions that refer to time. These expressions are the source of information when something happens, how often something occurs or how long something lasts. Temporal information, which can be extracted from text automatically, plays significant role in many information extraction systems, such as question answering, discourse analysis, event recognition and many more. We prepared PLIMEX — a broad description of Polish temporal expressions with annotation guidelines, based on the state-of-the-art solutions for English, mainly TimeML specification. We also adapted the solution to capture the local semantics of temporal expressions, called LTIMEX. Temporal description also supports further event identification and extends event description model, focusing at anchoring events in time, ordering events and reasoning about the persistence of events. We prepared the specification, which is designed to address these issues and we annotated all documents in Polish Corpus of Wroclaw University of Technology (KPWr) using our annotation guidelines.

scholarly journals Ontology-Based Question Answering System for an Academic Domain

2021 ◽  
Author(s):  
García-Robledo Gabriela A ◽  
Reyes-Ortiz José A ◽  
González-Beltrán Beatriz A ◽  
Bravo Maricela
Keyword(s):  
Natural Language Processing ◽  
User Interface ◽  
Speech Recognition ◽  
Natural Language ◽  
Information Extraction ◽  
Language Processing ◽  
Question Answering ◽  
Question Answering System ◽  
Methods And Techniques

The development of question answering (QA) systems involves methods and techniques from the areas of Information Extraction (EI), Natural Language Processing (NLP), and sometimes speech recognition. A user interface that involves all these tasks requires deep development to improve the interaction between a user and a device. This paper describes a Spanish QA system for an academic domain through a multi-platform user interface. The system uses a voice query to be transformed into text. The semi-structured query is converted into SQWRL language to extract a system of ontologies from an academic domain using patterns. The answer of the ontologies is placed in templates classified according to the type of question. Finally, the answer is transformed into a voice. A method for experimentation is presented focusing on the questions asked in voice and their respective answers by experts from the academic domain in a set of 258 questions, obtaining a 92% accuracy.

scholarly journals Natural Language Processing: Components, Advances, Tools and Industrial Applications

2021 ◽  
Vol 9 (9) ◽  
pp. 964-971
Author(s):  
Hima Yeldo
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Information Extraction ◽  
Language Processing ◽  
Question Answering ◽  
Industrial Applications ◽  
Spam Detection ◽  
Language Understanding ◽  
Language Generation ◽  
Email Spam

Abstract: Natural Language Processing is the study that focuses the interplay between computer and the human languages NLP has spread its applications in various fields such as an email Spam detection, machine translation, summation, information extraction, and question answering etc. Natural Language Processing classifies two parts i.e. Natural Language Generation and Natural Language understanding which evolves the task to generate and understand the text.

scholarly journals Relation Extraction With Clause-Based Open Information Extraction

2021 ◽  
Author(s):  
Duc Thuan Vo
Keyword(s):  
Natural Language ◽  
Information Extraction ◽  
Language Processing ◽  
Question Answering ◽  
Relation Extraction ◽  
Linguistic Knowledge ◽  
Dependency Parsing ◽  
Grammatical Structure ◽  
Open Information Extraction ◽  
Wide Range

Information Extraction (IE) is one of the challenging tasks in natural language processing. The goal of relation extraction is to discover the relevant segments of information in large numbers of textual documents such that they can be used for structuring data. IE aims at discovering various semantic relations in natural language text and has a wide range of applications such as question answering, information retrieval, knowledge presentation, among others. This thesis proposes approaches for relation extraction with clause-based Open Information Extraction that use linguistic knowledge to capture a variety of information including semantic concepts, words, POS tags, shallow and full syntax, dependency parsing in rich syntactic and semantic structures.<div>Within the plethora of Open Information Extraction that focus on the use of syntactic and dependency parsing for the purposes of detecting relations, incoherent and uninformative relation extractions can still be found. The extracted relations can be erroneous at times and fail to have a meaningful interpretation. As such, we first propose refinements to the grammatical structure of syntactic and dependency parsing with clause structures and clause types in an effort to generate propositions that can be deemed as meaningful extractable relations. Second, considering that choosing the most efficient seeds are pivotal to the success of the bootstrapping process when extracting relations, we propose an extended clause-based pattern extraction method with selftraining for unsupervised relation extraction. The proposed self-training algorithm relies on the clause-based approach to extract a small set of seed instances in order to identify and derive new patterns. Third, we employ matrix factorization and collaborative filtering for relation extraction. To avoid the need for manually predefined schemas, we employ the notion of universal schemas that is formed as a collection of patterns derived from Open Information Extraction tools as well as from relation schemas of pre-existing datasets. While previous systems have trained relations only for entities, we exploit advanced features from relation characteristics such as clause types and semantic topics for predicting new relation instances. Finally, we present an event network representation for temporal and causal event relation extraction that benefits from existing Open IE systems to generate a set of triple relations that are then used to build an event network. The event network is bootstrapped by labeling the temporal and causal disposition of events that are directly linked to each other. The event network can be systematically traversed to identify temporal and causal relations between indirectly connected events. <br></div>

scholarly journals Relation Extraction With Clause-Based Open Information Extraction

2021 ◽  
Author(s):  
Duc Thuan Vo
Keyword(s):  
Natural Language ◽  
Information Extraction ◽  
Language Processing ◽  
Question Answering ◽  
Relation Extraction ◽  
Linguistic Knowledge ◽  
Dependency Parsing ◽  
Grammatical Structure ◽  
Open Information Extraction ◽  
Wide Range

Information Extraction (IE) is one of the challenging tasks in natural language processing. The goal of relation extraction is to discover the relevant segments of information in large numbers of textual documents such that they can be used for structuring data. IE aims at discovering various semantic relations in natural language text and has a wide range of applications such as question answering, information retrieval, knowledge presentation, among others. This thesis proposes approaches for relation extraction with clause-based Open Information Extraction that use linguistic knowledge to capture a variety of information including semantic concepts, words, POS tags, shallow and full syntax, dependency parsing in rich syntactic and semantic structures.<div>Within the plethora of Open Information Extraction that focus on the use of syntactic and dependency parsing for the purposes of detecting relations, incoherent and uninformative relation extractions can still be found. The extracted relations can be erroneous at times and fail to have a meaningful interpretation. As such, we first propose refinements to the grammatical structure of syntactic and dependency parsing with clause structures and clause types in an effort to generate propositions that can be deemed as meaningful extractable relations. Second, considering that choosing the most efficient seeds are pivotal to the success of the bootstrapping process when extracting relations, we propose an extended clause-based pattern extraction method with selftraining for unsupervised relation extraction. The proposed self-training algorithm relies on the clause-based approach to extract a small set of seed instances in order to identify and derive new patterns. Third, we employ matrix factorization and collaborative filtering for relation extraction. To avoid the need for manually predefined schemas, we employ the notion of universal schemas that is formed as a collection of patterns derived from Open Information Extraction tools as well as from relation schemas of pre-existing datasets. While previous systems have trained relations only for entities, we exploit advanced features from relation characteristics such as clause types and semantic topics for predicting new relation instances. Finally, we present an event network representation for temporal and causal event relation extraction that benefits from existing Open IE systems to generate a set of triple relations that are then used to build an event network. The event network is bootstrapped by labeling the temporal and causal disposition of events that are directly linked to each other. The event network can be systematically traversed to identify temporal and causal relations between indirectly connected events. <br></div>

Sign in / Sign up

Export Citation Format

Share Document