Search

With the exponential growth of online review platforms, understanding user preferences and interests in the tourism domain has become increasingly critical for businesses and service providers. However, extracting meaningful insights from the vast amount of available data poses a significant challenge. Traditional methods often struggle to capture the nuanced and hierarchical nature of user interests within the tourism domain. This paper pioneers the integration of domain information modeling technology into the realm of online review information mining, presenting a novel approach to constructing a user tourism interest model. Unlike existing methods, which primarily rely on flat or simplistic representations of user data, our approach leverages the hierarchical structure inherent in tourism domain information modeling. By harnessing big data within the tourism domain, we construct hierarchical tourism attributes and apply a conditional random field model along with an affective dictionary to facilitate the hierarchical mining of user travel interest information. This culminates in the establishment of a comprehensive user travel interest model using advanced information modeling techniques. Building upon this foundation, we further propose a dynamic user travel interest model, showcasing its adaptability and responsiveness to changing user preferences. Finally, we validate the accuracy and effectiveness of our model through simulation experiments within a user travel recommendation system, demonstrating significant improvements over traditional methods. [ABSTRACT FROM AUTHOR]

Lotic fish species distributions are frequently predicted using remotely sensed habitat variables that characterize the adjacent landscape and serve as proxies for instream habitat. Recent advancements in statistical methodology, however, allow for leveraging fish assemblage data when predicting distributions. This is important because assemblage composition likely provides better information about instream habitat compared to landscape-derived metrics and therefore may improve predictions. To better understand the value of using multi-species fish data in species distribution modeling, we fit two conditional random fields (CRF) models to quantify the relative importance of fish assemblage co-occurrence, landscape-derived habitat variables, and interactions between these two predictor groups (i.e., effects of co-occurrence could be context-dependent) at over 1200 stream catchments in Pennsylvania, USA. We first compared predictive performance of CRF models against traditionally used single-species logistic regressions (generalized linear models; GLMs) and found that inclusion of fish assemblage data often improved predictive performance. The multi-species CRF models performed significantly better at predicting occurrence for 63% of species with an average percent increase in AUC of 25% compared to GLMs. Furthermore, the CRF identified species co-occurrences as more informative, and thus relatively more important, at predicting occurrence than the other effect types. The CRF also suggested that allowing these biotic effects to be context-dependent was important for predicting occurrence of many species. These findings illustrate the value of fish assemblage data for landscape-scale species distribution modeling and leveraging this information can improve predictions and inferences to help inform the management and conservation of freshwater fishes. [ABSTRACT FROM AUTHOR]

In the realm of digital libraries, efficiently managing and accessing scientific publications necessitates automated bibliographic reference segmentation. This study addresses the challenge of accurately segmenting bibliographic references, a task complicated by the varied formats and styles of references. Focusing on the empirical evaluation of Conditional Random Fields (CRF), Bidirectional Long Short-Term Memory with CRF (BiLSTM + CRF), and Transformer Encoder with CRF (Transformer + CRF) architectures, this research employs Byte Pair Encoding and Character Embeddings for vector representation. The models underwent training on the extensive Giant corpus and subsequent evaluation on the Cora Corpus to ensure a balanced and rigorous comparison, maintaining uniformity across embedding layers, normalization techniques, and Dropout strategies. Results indicate that the BiLSTM + CRF architecture outperforms its counterparts by adeptly handling the syntactic structures prevalent in bibliographic data, achieving an F1-Score of 0.96. This outcome highlights the necessity of aligning model architecture with the specific syntactic demands of bibliographic reference segmentation tasks. Consequently, the study establishes the BiLSTM + CRF model as a superior approach within the current state-of-the-art, offering a robust solution for the challenges faced in digital library management and scholarly communication. [ABSTRACT FROM AUTHOR]

We examine named entity recognition (NER), an essential and commonly used first step in many natural language processing tasks, including chatbots and language translation. We focus on the application of NER to texts that have a lot of noise, such as tweets, which is difficult due to the casual and unstructured language often used in these mediums. In this study, we make use of the largest available labeled data sets for Turkish NER, specifically targeting three informal platforms, namely Twitter, Facebook and Donanimhaber. We choose Turkish as a representative agglutinative language, which has a significantly different structure than other well-known languages such as English, French, and German. We emphasize that the methodologies and insights gained from this study can be extended to other agglutinative languages, like Finnish, Hungarian, Japanese, and Korean. We apply NER to these datasets using 16 different named entity tags through a framework that employs bidirectional long short-term memory (BiLSTM) networks followed by conditional random fields (CRF), known together as the BiLSTM-CRF model. Our experiments show an F1 score of 84% on a combined dataset, which indicates that deep learning models can also be effectively used for business applications in informal settings in agglutinative languages such as Turkish. [ABSTRACT FROM AUTHOR]

This study addressed the critical role of isolating switches in controlling circuit connections for the stable operation of the substation. Our research introduced an innovative state detection system that utilized depth information guidance, comprising a controllable pan-tilt mechanism, a depth camera, and an industrial computer. The software component employed a two-stage strategy for precise isolating switch detection. Initially, the red green blue with depth (RGB-D) saliency network identified the approximate area of the isolating switch target. Subsequently, a fully connected conditional random field was applied to extract accurate detection results. The real-time state of the isolating switch was determined based on the geometric relationship between its arms. This approach enhanced the accuracy of isolating switch detection, ensuring practical applicability in engineering scenarios. The significance of this research lies in its contribution to advancing isolating switch monitoring through depth information guidance, promoting a more robust and reliable power system. The key improvement is implementing a two-stage strategy, combining RGB-D saliency analysis and conditional random field processing, resulting in enhanced accuracy in isolating switch detection. As validated through extensive experiments, the proposed system's successful application in practical engineering underscores its effectiveness in meeting the accuracy requirements for isolating switch detection and state detection. This innovation holds promise for broader applications in power systems, showcasing its potential to elevate the reliability and efficiency of electrical networks. Code of the proposed system is available at: https://github.com/miaomiao0909/Isolating-Switch-Detection/tree/master. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background and objective: Pelvic bone tumors represent a harmful orthopedic condition, encompassing both benign and malignant forms. Addressing the issue of limited accuracy in current machine learning algorithms for bone tumor image segmentation, we have developed an enhanced bone tumor image segmentation algorithm. This algorithm is built upon an improved full convolutional neural network, incorporating both the fully convolutional neural network (FCNN-4s) and a conditional random field (CRF) to achieve more precise segmentation. Methodology: The enhanced fully convolutional neural network (FCNN-4s) was employed to conduct initial segmentation on preprocessed images. Following each convolutional layer, batch normalization layers were introduced to expedite network training convergence and enhance the accuracy of the trained model. Subsequently, a fully connected conditional random field (CRF) was integrated to fine-tune the segmentation results, refining the boundaries of pelvic bone tumors and achieving high-quality segmentation. Results: The experimental outcomes demonstrate a significant enhancement in segmentation accuracy and stability when compared to the conventional convolutional neural network bone tumor image segmentation algorithm. The algorithm achieves an average Dice coefficient of 93.31 %, indicating superior performance in real-time operations. Conclusion: In contrast to the conventional convolutional neural network segmentation algorithm, the algorithm presented in this paper boasts a more intricate structure, proficiently addressing issues of over-segmentation and under-segmentation in pelvic bone tumor segmentation. This segmentation model exhibits superior real-time performance, robust stability, and is capable of achieving heightened segmentation accuracy.

In Indonesia, where the majority of the population is Muslim, one of the obligations of a Muslim is zakat. To reduce illiteracy about zakat among Muslims, they need to have access to basic information about it. In order to facilitate the acquisition of this information, this study utilized named entity recognition (NER) and defined 12 named entity classes for the zakat domain, including the pillars of Islam, various types of zakat, and zakat management institutions. The Conditional Random Fields method was used for testing Indonesian-NER in three scenarios. In the specific context of the Zakat domain, NER can extract information about organizations, individuals, and locations involved in collecting and distributing Zakat funds. This information can improve the Zakat system’s efficiency and transparency and support research and analysis on Zakat-related topics. The average performance evaluation of the Indonesian-NER model showed a precision of 0.902, recall of 0.834, and an F1-score of 0.867.

Abstract Background In the healthcare domain today, despite the substantial adoption of electronic health information systems, a significant proportion of medical reports still exist in paper-based formats. As a result, there is a significant demand for the digitization of information from these paper-based reports. However, the digitization of paper-based laboratory reports into a structured data format can be challenging due to their non-standard layouts, which includes various data types such as text, numeric values, reference ranges, and units. Therefore, it is crucial to develop a highly scalable and lightweight technique that can effectively identify and extract information from laboratory test reports and convert them into a structured data format for downstream tasks. Methods We developed an end-to-end Natural Language Processing (NLP)-based pipeline for extracting information from paper-based laboratory test reports. Our pipeline consists of two main modules: an optical character recognition (OCR) module and an information extraction (IE) module. The OCR module is applied to locate and identify text from scanned laboratory test reports using state-of-the-art OCR algorithms. The IE module is then used to extract meaningful information from the OCR results to form digitalized tables of the test reports. The IE module consists of five sub-modules, which are time detection, headline position, line normalization, Named Entity Recognition (NER) with a Conditional Random Fields (CRF)-based method, and step detection for multi-column. Finally, we evaluated the performance of the proposed pipeline on 153 laboratory test reports collected from Peking University First Hospital (PKU1). Results In the OCR module, we evaluate the accuracy of text detection and recognition results at three different levels and achieved an averaged accuracy of 0.93. In the IE module, we extracted four laboratory test entities, including test item name, test result, test unit, and reference value range. The overall F1 score is 0.86 on the 153 laboratory test reports collected from PKU1. With a single CPU, the average inference time of each report is only 0.78 s. Conclusion In this study, we developed a practical lightweight pipeline to digitalize and extract information from paper-based laboratory test reports in diverse types and with different layouts that can be adopted in real clinical environments with the lowest possible computing resources requirements. The high evaluation performance on the real-world hospital dataset validated the feasibility of the proposed pipeline.

Background: In the healthcare domain today, despite the substantial adoption of electronic health information systems, a significant proportion of medical reports still exist in paper-based formats. As a result, there is a significant demand for the digitization of information from these paper-based reports. However, the digitization of paper-based laboratory reports into a structured data format can be challenging due to their non-standard layouts, which includes various data types such as text, numeric values, reference ranges, and units. Therefore, it is crucial to develop a highly scalable and lightweight technique that can effectively identify and extract information from laboratory test reports and convert them into a structured data format for downstream tasks. Methods: We developed an end-to-end Natural Language Processing (NLP)-based pipeline for extracting information from paper-based laboratory test reports. Our pipeline consists of two main modules: an optical character recognition (OCR) module and an information extraction (IE) module. The OCR module is applied to locate and identify text from scanned laboratory test reports using state-of-the-art OCR algorithms. The IE module is then used to extract meaningful information from the OCR results to form digitalized tables of the test reports. The IE module consists of five sub-modules, which are time detection, headline position, line normalization, Named Entity Recognition (NER) with a Conditional Random Fields (CRF)-based method, and step detection for multi-column. Finally, we evaluated the performance of the proposed pipeline on 153 laboratory test reports collected from Peking University First Hospital (PKU1). Results: In the OCR module, we evaluate the accuracy of text detection and recognition results at three different levels and achieved an averaged accuracy of 0.93. In the IE module, we extracted four laboratory test entities, including test item name, test result, test unit, and reference value range. The overall F1 score is 0.86 on the 153 laboratory test reports collected from PKU1. With a single CPU, the average inference time of each report is only 0.78 s. Conclusion: In this study, we developed a practical lightweight pipeline to digitalize and extract information from paper-based laboratory test reports in diverse types and with different layouts that can be adopted in real clinical environments with the lowest possible computing resources requirements. The high evaluation performance on the real-world hospital dataset validated the feasibility of the proposed pipeline. [ABSTRACT FROM AUTHOR]

In the field of automobile production equipment fault, the entity category of Chinese named entity is complicated, and the traditional word vector can not solve the polysemy of one word. In view of these problems, this study proposes a named entity recognition model in the field of automobile production equipment fault based on BERT(Bidirectional Encoder Representations From Transformer). First, the semantic information and syntactic features are extracted by BERT pretraining model to generate dynamic word vectors. Then, the word vector is input into bidirectional long-short term memory for bidirectional encoding to obtain the semantic features of long sequences. Finally, the conditional random field is used for sequence decoding to learn the dependency relationship between labels and obtain the optimal label sequence. Experiments are carried out on the self-built real automobile production equipment fault data set, and the accuracy, recall rate and F1 value are 87.9 %, 89.6 % and 88.7 %, respectively. [ABSTRACT FROM AUTHOR]

Multi-person pose estimation is the task of estimating the coordinates of body joints and predicting the body poses for multiple people in an images. This problem has made breakthroughs in recent years, but the solutions still suffer from some shortcomings. A serious weakness of the state-of-the-art models is the number of poses detected by these models which is generally much larger than the actual number of human instances in the input image. This makes the existing models unreliable and thus unusable in real-world tasks. In this paper, we propose a more reliable multi-person pose estimation method consisting of three main blocks: a top-down multi-person pose estimation, a human detection, and a pose selection block. The proposed method incorporates the bounding box of the segmented objects to select the best subset of the initial pose set. We formulate the pose selection problem using Conditional Random Fields. First, we introduce a set of potential functions to form a general probability model. Then an inference algorithm is proposed to select the best poses which maximize the probability function. Finally, the proposed solution is implemented by a neural network. The proposed pose selection model is a model-agnostic method that can be easily used in conjunction with other pose estimation and object detection models. Experiments demonstrate that the reliability and precision of the proposed model are higher than those of the state-of-the-art models. • We solve a serious problem of the state-of-the-art multi-person pose estimation models. • Our method incorporates instance segmentation results to select the best estimated poses. • We formulate the problem using CRFs. We introduce a set of potential functions and use an efficient inference algorithm. • The proposed solution is implemented as a model-agnostic method. • Experiments show that the reliability and precision of the proposed model are higher than other models. [ABSTRACT FROM AUTHOR]

The compaction quality of rockfill materials plays a pivotal role in ensuring the stability and durability of runway structures. However, traditional assessment methods relying on limited random sampling may lack representativeness for the entire construction site and overlook potential areas of insufficient compaction. Addressing this challenge, this paper employs the dynamic deformation modulus (EVD), a rapid and nondestructive testing method, to assess the compaction quality of runway rockfill. Subsequently, this paper propose a 3D Conditional Random Field (CRF) model based on EVD to simulate the uncertain spatial distribution of rockfill compaction quality, allowing for the estimation of the overall construction area's compaction quality with a limited number of sample points. The validity of the model is demonstrated through a case study involving a runway expansion project. Additionally, three critical construction factors--namely, measurement points, compaction passes, and compaction materials--are analyzed throughout the construction process. This analysis provides managers with valuable insights and decision-making tools to promptly evaluate the quality of compaction areas, ensuring the stability and durability of the runway.

In the realm of digital libraries, efficiently managing and accessing scientific publications necessitates automated bibliographic reference segmentation. This study addresses the challenge of accurately segmenting bibliographic references, a task complicated by the varied formats and styles of references. Focusing on the empirical evaluation of Conditional Random Fields (CRF), Bidirectional Long Short-Term Memory with CRF (BiLSTM + CRF), and Transformer Encoder with CRF (Transformer + CRF) architectures, this research employs Byte Pair Encoding and Character Embeddings for vector representation. The models underwent training on the extensive Giant corpus and subsequent evaluation on the Cora Corpus to ensure a balanced and rigorous comparison, maintaining uniformity across embedding layers, normalization techniques, and Dropout strategies. Results indicate that the BiLSTM + CRF architecture outperforms its counterparts by adeptly handling the syntactic structures prevalent in bibliographic data, achieving an F1-Score of 0.96. This outcome highlights the necessity of aligning model architecture with the specific syntactic demands of bibliographic reference segmentation tasks. Consequently, the study establishes the BiLSTM + CRF model as a superior approach within the current state-of-the-art, offering a robust solution for the challenges faced in digital library management and scholarly communication.

Valued constraint satisfaction problems with ordered variables (VCSPO) are a special case of Valued CSPs in which variables are totally ordered and soft constraints are imposed on tuples of variables that do not violate the order. We study a restriction of VCSPO, in which soft constraints are imposed on a segment of adjacent variables and a constraint language Γ consists of { 0 , 1 } -valued characteristic functions of predicates. This kind of potentials generalizes the so-called pattern-based potentials, which were applied in many tasks of structured prediction. For a constraint language Γ we introduce a closure operator, Γ ∩ ¯ ⊇ Γ , and give examples of constraint languages for which | Γ ∩ ¯ | is small. If all predicates in Γ are cartesian products, we show that the minimization of a generalized pattern-based potential (or, the computation of its partition function) can be made in O (| V | · | D | 2 · | Γ ∩ ¯ | 2) time, where V is a set of variables, D is a domain set. If, additionally, only non-positive weights of constraints are allowed, the complexity of the minimization task drops to O (| V | · | Γ ∩ ¯ | · | D | · max ϱ ∈ Γ ‖ ϱ ‖ 2) where ‖ ϱ ‖ is the arity of ϱ ∈ Γ . For a general language Γ and non-positive weights, the minimization task can be carried out in O (| V | · | Γ ∩ ¯ | 2) time. We argue that in many natural cases Γ ∩ ¯ is of moderate size, though in the worst case | Γ ∩ ¯ | can blow up and depend exponentially on max ϱ ∈ Γ ‖ ϱ ‖ . [ABSTRACT FROM AUTHOR]

Grammar error correction (GEC) is a crucial task in the field of Natural Language Processing (NLP). Its objective is to automatically detect and rectify grammatical mistakes in sentences, which possesses immense application research value. Currently, mainstream grammar-correction methods primarily rely on sequence labeling and text generation, which are two kinds of end-to-end methods. These methods have shown exemplary performance in areas with low error density but often fail to deliver satisfactory results in high-error density situations where multiple errors exist in a single sentence. Consequently, these methods tend to overcorrect correct words, leading to a high rate of false positives. To address this issue, we researched the specific characteristics of the Chinese grammar error correction (CGEC) task in high-error density situations. We proposed a grammar-correction method based on prompt templates. Firstly, we proposed a strategy for constructing prompt templates suitable for CGEC. This strategy transforms the CGEC task into a masked fill-in-the-blank task compatible with the masked language model BERT. Secondly, we proposed a method for dynamically updating templates, which incorporates already corrected errors into the template through dynamic updates to improve the template quality. Moreover, we used the phonetic and graphical resemblance knowledge from the confusion set as guiding information. By combining this with BERT's prediction results, the model can more accurately select the correct characters, significantly enhancing the accuracy of the model's prediction correction results. Our methods were validated through experiments on a public grammar-correction dataset. The results indicate that our method achieves higher correction performance and lower false correction rates in high-error density scenarios. [ABSTRACT FROM AUTHOR]

Background and objective: Bone tumor is a kind of harmful orthopedic disease, there are benign and malignant points. Aiming at the problem that the accuracy of the existing machine learning algorithm for bone tumor image segmentation is not high, a bone tumor image segmentation algorithm based on improved full convolutional neural network which consists fully convolutional neural network (FCNN-4s) and conditional random field (CRF). Methodology: The improved fully convolutional neural network (FCNN-4s) was used to perform coarse segmentation on preprocessed images. Batch normalization layers were added after each convolutional layer to accelerate the convergence speed of network training and improve the accuracy of the trained model. Then, a fully connected conditional random field (CRF) was fused to refine the bone tumor boundary in the coarse segmentation results, achieving the fine segmentation effect. Results: The experimental results show that compared with the traditional convolutional neural network bone tumor image segmentation algorithm, the algorithm has a great improvement in segmentation accuracy and stability, the average Dice can reach 91.56%, the real-time performance is better. Conclusion: Compared with the traditional convolutional neural network segmentation algorithm, the algorithm in this paper has a more refined structure, which can effectively solve the problem of over-segmentation and under-segmentation of bone tumors. The segmentation prediction has better real-time performance, strong stability, and can achieve higher segmentation accuracy.

Ambiguities in information and difficulties in distinguishing truth from fiction during natural disasters produce negative emotions and create problems in emergency rescue work. In this study, we focused on two aspects. First, we propose a method that improves upon the existing streaming data clustering method based on twin networks, which is a single-pass topic clustering method based on the Siamese-bidirectional gated recurring units (BiGRUs)-attention technique. Second, a bidirectional encoder representation from transformers (BERT)-BiGRU-conditional random field (CRF) sentiment analysis model based on the idea of sequence tagging was designed. Combining this method with the proposed topic clustering method, we propose a new disaster management method that analyzes the public opinion before and after a disaster. We conducted experiments that showed that the single-pass topic clustering model based on Siamese-BiGRU-attention outperformed other clustering methods in terms of clustering performance. Simultaneously, the BERT-BiGRU-CRF model was employed to statistically analyze data on daily public opinion monitoring. The statistics of the clustering results before and after disasters occur and the emotion distribution based on each category were obtained. Overall, the proposed method can help rescue workers and governmental officials understand the sentiments of the public more clearly and provide the necessary response measures more effectively during disasters. [ABSTRACT FROM AUTHOR]

The accurate and reliable derivation of the pap smear cell, which contains cytoplasm and nucleus regions, depends on the segmentation process employed in the cervical cancer detection mechanism. In this paper, an Improved Boykov’s Graph Cut-based Conditional Random Fields and Superpixel imposed Semantic Segmentation Technique (IBGC-CRF-SPSST) is proposed for efficient cervical cancer detection. This proposed IBGC-CRF-SPSST embeds the complete benefits of constraint association among pixels and superpixel edge data for accurate determination of the nuclei and cytoplasmic boundaries so as to ensure efficient differentiation of the healthy and unhealthy cancer cells. Finally, the pixel-level forecasting potential of Conditional Random Fields is included for enhancing the degree of semantic-based segmentation accuracy to a predominant level. The experimental evaluated results of the proposed IBGC-CRF-SPSST aim to produce an accuracy of 99.78%, a mean processing time of 2.18sec, a precision of 96%, a sensitivity of 98.92%, and a specificity of 99.32% value which is determined to be excellent and on par with the existing detection techniques used for investigating cervical cancer.

To date, several POS taggers have been introduced to facilitate the success of semantic analysis for different languages. However, the task of POS tagging becomes a bit intricate in morphologically complex languages, like Amharic. In this paper, we evaluated different models such as bidirectional long short term memory, convolutional neural network in combination with bidirectional long short term memory, and conditional random field for Amharic POS tagging. Various features, both language-dependent and -independent, have been explored in a conditional random field model. Besides, word-level and character-level features are analyzed in deep neural network models. A convolutional neural network is utilized for encoding features at the word and character level. Each model's performance has evaluated on the dataset that contained 321 K tokens and manually tagged with 31 POS tags. Lastly, the best performance obtained by an end-to-end deep neural network model, convolutional neural network in combination with bidirectional long term short memory and conditional random field, is 97.23% accuracy. This is the highest accuracy for Amharic POS tagging task and is competent with contemporary taggers currently existing in different languages.

Software is unavoidable in software development and maintenance. In literature, many methods are discussed which fails to achieve efficient software bug detection and classification. In this paper, efficient Adaptive Deep Learning Model (ADLM) is developed for automatic duplicate bug report detection and classification process. The proposed ADLM is a combination of Conditional Random Fields decoding with Long Short-Term Memory (CRF-LSTM) and Dingo Optimizer (DO). In the CRF, the DO can be consumed to choose the efficient weight value in network. The proposed automatic bug report detection is proceeding with three stages like pre-processing, feature extraction in addition bug detection with classification. Initially, the bug report input dataset is gathered from the online source system. In the pre-processing phase, the unwanted information from the input data are removed by using cleaning text, convert data types and null value replacement. The pre-processed data is sent into the feature extraction phase. In the feature extraction phase, the four types of feature extraction method are utilized such as contextual, categorical, temporal and textual. Finally, the features are sent to the proposed ADLM for automatic duplication bug report detection and classification. The proposed methodology is proceeding with two phases such as training and testing phases. Based on the working process, the bugs are detected and classified from the input data. The projected technique is assessed by analyzing performance metrics such as accuracy, precision, Recall, F_Measure and kappa. [ABSTRACT FROM AUTHOR]

Text-to-scene conversion systems map natural language text to formal representations required for visual scenes. The difficulty involved in this mapping is one of the most critical challenges for developing these systems. The current study mapped Persian natural language text as the headmost system to a conceptual scene model. This conceptual scene model is an intermediate semantic representation between natural language and the visual scene and contains descriptions of visual elements of the scene. It will be used to produce meaningful animation based on an input story in this ongoing study. The mapping task was modeled as a sequential labeling problem, and a conditional random field (CRF) model was trained and tested for sequential labeling of scene model elements. To the best of the authors' knowledge, no dataset for this task exists; thus, the required dataset was collected for this task. The lack of required off-the-shelf natural language processing modules and a significant error rate in the available corpora were important challenges to dataset collection. Some features of the dataset were manually annotated. The results were evaluated using standard text classification metrics, and an average accuracy of 85.7% was obtained, which is satisfactory. [ABSTRACT FROM AUTHOR]

In order to obtain the knowledge information of financial texts more efficiently and make the extracted information such as entity relation attribute more accurate, this paper studies the grammatical features of financial news texts and the semantic features of How Net, and puts forward the scheme of financial information extraction based on How Net. First, the phrase matching is carried out in the dictionary. Then the neural network is used for weighting, BiLSTM is used for character vector feature enhancement training, and then conditional random field (CRF) is used to complete named entity recognition, and then the relationship extraction of entity pairs from the dependency syntax is carried out to complete the research on the construction method of knowledge extraction of text in the financial field. The experimental results show that this model is superior to the other three models in entity recognition, and the overall performance is improved by about 1.2%. In relation extraction, the accuracy and recall rate of the model algorithm adopted in this paper are improved by 5% and 1.5% respectively, which shows that the improvement of the algorithm is effective. [ABSTRACT FROM AUTHOR]

Biomedical Named-Entity Recognition (BioNER) has become an essential part of text mining due to the continuously increasing digital archives of biological and medical articles. While there are many well-performing BioNER tools for entities such as genes, proteins, diseases or species, there is very little research into food and dietary constituent named-entity recognition. For this reason, in this paper, we study seven BioNER models for food and dietary constituents recognition. Specifically, we study a dictionary-based model, a conditional random fields (CRF) model and a new hybrid model, called FooDCoNER (Food and Dietary Constituents Named-Entity Recognition), which we introduce combining the former two models. In addition, we study deep language models including BERT, BioBERT, RoBERTa and ELECTRA. As a result, we find that FooDCoNER does not only lead to the overall best results, comparable with the deep language models, but FooDCoNER is also much more efficient with respect to run time and sample size requirements of the training data. The latter has been identified via the study of learning curves. Overall, our results not only provide a new tool for food and dietary constituent NER but also shed light on the difference between classical machine learning models and recent deep language models.

A place name is a textual identification of a specific spatial location by people and is an important carrier of geographical information. The recognition of Chinese place names is of great importance in information retrieval and event extraction. The traditional approach is to transform the recognition of Chinese place names into a sequential annotation problem, with commonly used classification models such as support vector machines and conditional random fields. In this paper, Chinese address recognition is converted into a sequential annotation task, and a multi-feature fusion approach to Chinese address recognition is proposed. A deep learning network architecture model based on the fusion of character, word, and address features is constructed to convert characters, words, and their features into vector representations; finally, the sequential annotation of sentences is performed by CRF to achieve the recognition and extraction of address information. On the autonomously constructed dataset, the proposed method MFBL (Multi-Feature-BiLSTM) improves in accuracy by 4 to 10 percentage points compared to other methods, demonstrating that the MFBL model has better performance in the address recognition task.

Named entities are the main carriers of relevant medical knowledge in Electronic Medical Records (EMR). Clinical electronic medical records lead to problems such as word segmentation ambiguity and polysemy due to the specificity of Chinese language structure, so a Clinical Named Entity Recognition (CNER) model based on multi-head self-attention combined with BILSTM neural network and Conditional Random Fields is proposed. Firstly, the pre-trained language model organically combines char vectors and word vectors for the text sequences of the original dataset. The sequences are then fed into the parallel structure of the multi-head self-attention module and the BILSTM neural network module, respectively. By splicing the output of the neural network module to obtain multi-level information such as contextual information and feature association weights. Finally, entity annotation is performed by CRF. The results of the multiple comparison experiments show that the structure of the proposed model is very reasonable and robust, and it can effectively improve the Chinese CNER model. The model can extract multi-level and more comprehensive text features, compensate for the defect of long-distance dependency loss, with better applicability and recognition performance.

Grammar error correction (GEC) is a crucial task in the field of Natural Language Processing (NLP). Its objective is to automatically detect and rectify grammatical mistakes in sentences, which possesses immense application research value. Currently, mainstream grammar-correction methods primarily rely on sequence labeling and text generation, which are two kinds of end-to-end methods. These methods have shown exemplary performance in areas with low error density but often fail to deliver satisfactory results in high-error density situations where multiple errors exist in a single sentence. Consequently, these methods tend to overcorrect correct words, leading to a high rate of false positives. To address this issue, we researched the specific characteristics of the Chinese grammar error correction (CGEC) task in high-error density situations. We proposed a grammar-correction method based on prompt templates. Firstly, we proposed a strategy for constructing prompt templates suitable for CGEC. This strategy transforms the CGEC task into a masked fill-in-the-blank task compatible with the masked language model BERT. Secondly, we proposed a method for dynamically updating templates, which incorporates already corrected errors into the template through dynamic updates to improve the template quality. Moreover, we used the phonetic and graphical resemblance knowledge from the confusion set as guiding information. By combining this with BERT’s prediction results, the model can more accurately select the correct characters, significantly enhancing the accuracy of the model’s prediction correction results. Our methods were validated through experiments on a public grammar-correction dataset. The results indicate that our method achieves higher correction performance and lower false correction rates in high-error density scenarios.

The impact of land cover change across the planet continues to necessitate accurate methods to detect and monitor evolving processes from satellite imagery. In this context, regional and global land cover mapping over time has largely treated time as independent and addressed temporal map consistency as a post-classification endeavor. However, we argue that time can be better modeled as codependent during the model classification stage to produce more consistent land cover estimates over long time periods and gradual change events. To produce temporally-dependent land cover estimates—meaning land cover is predicted over time in connected sequences as opposed to predictions made for a given time period without consideration of past land cover—we use structured learning with conditional random fields (CRFs), coupled with a land cover augmentation method to produce time series training data and bi-weekly Landsat imagery over 20 years (1999–2018) across the Southern Cone region of South America. A CRF accounts for the natural dependencies of land change processes. As a result, it is able to produce land cover estimates over time that better reflect real change and stability by reducing pixel-level annual noise. Using CRF, we produced a twenty-year dataset of land cover over the region, depicting key change processes such as cropland expansion and tree cover loss at the Landsat scale. The augmentation and CRF approach introduced here provides a more temporally consistent land cover product over traditional mapping methods. [ABSTRACT FROM AUTHOR]

Understanding users' requirements are essential to developing an effective AI service system, in which requirement expressions of users can be resolved into intent detection and slot filling tasks. In a lot of literature, the two tasks are normally considered as independent tasks and obtain satisfactory performance. Recently, many researchers have found that intent detection and slot filling can benefit each other since they always appear together in a sentence and may include shared information. Most of the existing joint models employ the structures of encoder and decoder and capture the cross-impact between two tasks by concatenation of hidden state information from two encoders, which ignore the dependencies among slot tags in specific intent. In this paper, we propose a novel Double-Bi-LSTM-CRF Model (DBLC), which can fit the dependency among hidden slot tags while considering the cross-impact between intent detection and slot filling. We also design and implement an intention chatbot on the tourism area, which can assist users to complete a travel plan through human-computer interaction. Extensive experiments show that our DBLC achieves state-of-the-art results on the benchmark ATIS, SNIPS, and multi-domain datasets. [ABSTRACT FROM AUTHOR]