Essays about: "natural language machine"

Showing result 1 - 5 of 284 essays containing the words natural language machine.

  1. 1. Bridging Language & Data : Optimizing Text-to-SQL Generation in Large Language Models

    University essay from Linköpings universitet/Artificiell intelligens och integrerade datorsystem

    Author : Niklas Wretblad; Fredrik Gordh Riseby; [2024]
    Keywords : Chaining; Classification; Data Quality; Few-Shot Learning; Large Language Model; Machine Learning; Noise; Prompt; Prompt Engineering; SQL; Structured Query Language; Text-to-SQL; Zero-Shot Learning; Noise Identification;

    Abstract : This thesis explores text-to-SQL generation using Large Language Models within a financial context, aiming to assess the efficacy of current benchmarks and techniques. The central investigation revolves around the accuracy of the BIRD-Bench benchmark and the applicability of text-to-SQL models in real-world scenarios. READ MORE

  2. 2. Approximating Reasoning with Transformer Language Models

    University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

    Author : Daniel Enström; Viktor Kjellberg; [2023-10-19]
    Keywords : natural language processing; nlp; automated reasoning; logic; inference; machine learning; transformers; language models; BERT; BART;

    Abstract : We conduct experiments with BART, a generative language-model architecture, to investigate its capabilities for approximating reasoning by learning from data. For this we use the SimpleLogic dataset, a dataset of satisfiability problems in propositional logic originally created by Zhang et al. (2022). READ MORE

  3. 3. Nested Noun Phrase Detection in English Text with BERT

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Shweta Misra; [2023]
    Keywords : Phrase detection; nested noun phrase identification; phrase structure identification; sentence parsing; transformer models; machine learning; natural language processing; Frasdetektering; kapslad substantivfrasidentifiering; frasstrukturidentifiering; meningsanalys; transformers-modeller; maskininlärning; naturlig språkbehandling;

    Abstract : In this project, we address the task of nested noun phrase identification in English sentences, where a phrase is defined as a group of words functioning as one unit in a sentence. Prior research has extensively explored the identification of various phrases for language understanding and text generation tasks. READ MORE

  4. 4. Optimising Machine Learning Models for Imbalanced Swedish Text Financial Datasets: A Study on Receipt Classification : Exploring Balancing Methods, Naive Bayes Algorithms, and Performance Tradeoffs

    University essay from Linnéuniversitetet/Institutionen för datavetenskap och medieteknik (DM)

    Author : Li Ang Hu; Long Ma; [2023]
    Keywords : Imbalanced datasets; Swedish text financial datasets; Accuracy; Matthews correlation coefficient; Recall; Multinomial Naive Bayes; SMOTE; TomekLinks; Performance optimization;

    Abstract : This thesis investigates imbalanced Swedish text financial datasets, specifically receipt classification using machine learning models. The study explores the effectiveness of under-sampling and over-sampling methods for Naive Bayes algorithms, collaborating with Fortnox for a controlled experiment. READ MORE

  5. 5. Analyzing the performance of active learning strategies on machine learning problems

    University essay from Uppsala universitet/Avdelningen för systemteknik

    Author : Vendela Werner; [2023]
    Keywords : computer science; bioinformatics; machine learning; active learning; artificial intelligence; supervised learning; Astrazeneca; maskininlärning; artificiell intelligens; datorvetenskap; active learning; bioinformatik; supervised learning;

    Abstract : Digitalisation within industries is rapidly advancing and data possibilities are growing daily. Machine learning models need a large amount of data that are well-annotated for good performance. To get well-annotated data, an expert is needed, which is expensive, and the annotation itself could be very time-consuming. READ MORE