中文
相关论文

相关论文: Grammatical Relations of Myanmar Sentences Augment…

200 篇论文

This paper describes a context free grammar (CFG) based grammatical relations for Myanmar sentences which combine corpus-based function tagging system. Part of the challenge of statistical function tagging for Myanmar sentences comes from…

计算与语言 · 计算机科学 2012-03-09 Win Win Thant , Tin Myat Htwe , Ni Lar Thein

This paper describes the use of Naive Bayes to address the task of assigning function tags and context free grammar (CFG) to parse Myanmar sentences. Part of the challenge of statistical function tagging for Myanmar sentences comes from the…

计算与语言 · 计算机科学 2012-05-09 Win Win Thant , Tin Myat Htwe , Ni Lar Thein

Tree adjoining grammars (TAGs) provide an ample tool to capture syntax of many Indian languages. Tamil represents a special challenge to computational formalisms as it has extensive agglutinative morphology and a comparatively difficult…

计算与语言 · 计算机科学 2017-04-20 Vijay Krishna Menon , S Rajendran , M Anandkumar , K P Soman

Grammatical relationships are an important level of natural language processing. We present a trainable approach to find these relationships through transformation sequences and error-driven learning. Our approach finds grammatical…

计算与语言 · 计算机科学 2007-05-23 Lisa Ferro , Marc Vilain , Alexander Yeh

To interpret natural language at the discourse level, it is very useful to accurately recognize dialogue acts, such as SUGGEST, in identifying speaker intentions. Our research explores the utility of a machine learning method called…

cmp-lg · 计算机科学 2007-05-23 Ken Samuel , Sandra Carberry , K. Vijay-Shanker

For the task of recognizing dialogue acts, we are applying the Transformation-Based Learning (TBL) machine learning algorithm. To circumvent a sparse data problem, we extract values of well-motivated features of utterances, such as speaker…

cmp-lg · 计算机科学 2007-05-23 Ken Samuel , Sandra Carberry , K. Vijay-Shanker

Complementary recommendations enhance the user experience by suggesting items that are frequently purchased together while serving different functions from the query item. Inferring or evaluating whether two items have a complementary…

信息检索 · 计算机科学 2025-12-02 Chihiro Yamasaki , Kai Sugahara , Yuma Nagi , Kazushi Okamoto

The grammatical analysis of texts in any written language typically involves a number of basic processing tasks, such as tokenization, morphological tagging, and dependency parsing. State-of-the-art systems can achieve high accuracy on…

计算与语言 · 计算机科学 2023-01-09 Angelina Aquino , Franz de Leon

This paper addresses issues in automated treebank construction. We show how standard part-of-speech tagging techniques extend to the more general problem of structural annotation, especially for determining grammatical functions and…

cmp-lg · 计算机科学 2008-02-03 Thorsten Brants , Wojciech Skut , Brigitte Krenn

The central role of the lexicon in Meaning-Text Theory (MTT) and other dependency-based linguistic theories cannot be replicated in linguistic theories based on context-free grammars (CFGs). We describe Tree Adjoining Grammar (TAG) as a…

cmp-lg · 计算机科学 2008-02-03 Owen Rambow , Aravind Joshi

We describe a Context Free Grammar (CFG) for Bangla language and hence we propose a Bangla parser based on the grammar. Our approach is very much general to apply in Bangla Sentences and the method is well accepted for parsing a language of…

计算与语言 · 计算机科学 2012-01-11 K. M. Azharul Hasan , Al-Mahmud , Amit Mondal , Amit Saha

Exploiting rich linguistic information in raw text is crucial for expressive text-to-speech (TTS). As large scale pre-trained text representation develops, bidirectional encoder representations from Transformers (BERT) has been proven to…

计算与语言 · 计算机科学 2022-11-14 Yixuan Zhou , Changhe Song , Jingbei Li , Zhiyong Wu , Yanyao Bian , Dan Su , Helen Meng

TMs are a pattern recognition approach that uses finite state machines for learning and propositional logic to represent patterns. In addition to being natively interpretable, they have provided competitive accuracy for various tasks. In…

计算与语言 · 计算机科学 2021-02-23 Rupsa Saha , Ole-Christoffer Granmo , Vladimir I. Zadorozhny , Morten Goodwin

Text-based reinforcement learning involves an agent interacting with a fictional environment using observed text and admissible actions in natural language to complete a task. Previous works have shown that agents can succeed in text-based…

计算与语言 · 计算机科学 2024-04-17 Mauricio Gruppi , Soham Dan , Keerthiram Murugesan , Subhajit Chaudhury

Morphological analysis involves predicting the syntactic traits of a word (e.g. {POS: Noun, Case: Acc, Gender: Fem}). Previous work in morphological tagging improves performance for low-resource languages (LRLs) through cross-lingual…

计算与语言 · 计算机科学 2018-07-12 Chaitanya Malaviya , Matthew R. Gormley , Graham Neubig

This paper presents results from the first attempt to apply Transformation-Based Learning to a discourse-level Natural Language Processing task. To address two limitations of the standard algorithm, we developed a Monte Carlo version of…

cmp-lg · 计算机科学 2007-05-23 Ken Samuel , Sandra Carberry , K. Vijay-Shanker

Large language models (LLMs) have significantly advanced autonomous agents, particularly in zero-shot tool usage, also known as function calling. This research delves into enhancing the function-calling capabilities of LLMs by exploring…

计算与语言 · 计算机科学 2024-12-05 Yi-Chang Chen , Po-Chun Hsu , Chan-Jan Hsu , Da-shan Shiu

Natural language processing is a prompt research area across the country. Parsing is one of the very crucial tool in language analysis system which aims to forecast the structural relationship among the words in a given sentence. Many…

计算与语言 · 计算机科学 2014-03-26 K. Sureka , K. G. Srinivasagan , S. Suganthi

Bangla is the seventh most spoken language by a total number of speakers in the world, and yet the development of an automated grammar checker in this language is an understudied problem. Bangla grammatical error detection is a task of…

计算与语言 · 计算机科学 2024-11-14 Shayekh Bin Islam , Ridwanul Hasan Tanvir , Sihat Afnan

This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation…

计算与语言 · 计算机科学 2007-05-23 Khalil Sima'an
‹ 上一页 1 2 3 10 下一页 ›