English
Related papers

Related papers: Parsing of Myanmar sentences with function tagging

200 papers

This paper presents new state-of-the-art models for three tasks, part-of-speech tagging, syntactic parsing, and semantic parsing, using the cutting-edge contextualized embedding framework known as BERT. For each task, we first replicate and…

Computation and Language · Computer Science 2020-05-26 Han He , Jinho D. Choi

We describe a unified and coherent syntactic framework for supporting a semantically-informed syntactic approach to statistical machine translation. Semantically enriched syntactic tags assigned to the target-language training texts…

One of the limitations of semantic parsing approaches to open-domain question answering is the lexicosyntactic gap between natural language questions and knowledge base entries -- there are many ways to ask a question, all with the same…

Computation and Language · Computer Science 2016-08-08 Shashi Narayan , Siva Reddy , Shay B. Cohen

We present an empirical investigation of various ways to automatically identify phrases in a tagged corpus that are useful for dialogue act tagging. We found that a new method (which measures a phrase's deviation from an…

Artificial Intelligence · Computer Science 2007-05-23 Ken Samuel , Sandra Carberry , K. Vijay-Shanker

In this work, we explore a Connectionist Temporal Classification (CTC) based end-to-end Automatic Speech Recognition (ASR) model for the Myanmar language. A series of experiments is presented on the topology of the model in which the…

Machine Learning · Computer Science 2021-05-17 Khin Me Me Chit , Laet Laet Lin

In this paper, we are going to focus on speed up of the Word Sense Disambiguation procedure by filtering the relevant senses of an ambiguous word through Part-of-Speech Tagging. First, this proposed approach performs the Part-of-Speech…

Computation and Language · Computer Science 2016-10-24 Alok Ranjan Pal , Anupam Munshi , Diganta Saha

To Rogers (1994) we owe the insight that monadic second order predicate logic with multiple successors (MSO) is well suited in many respects as a realistic formal base for syntactic theorizing. However, the agreeable formal properties of…

cmp-lg · Computer Science 2008-02-03 Uwe Moennich

We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition network. Parsing complexity w.r.t. input length matches the state…

Formal Languages and Automata Theory · Computer Science 2019-02-19 Grzegorz Herman

In this paper, we propose using deep neural networks to extract important information from Vietnamese legal questions, a fundamental task towards building a question answering system in the legal domain. Given a legal question in natural…

Computation and Language · Computer Science 2023-05-01 Nguyen Anh Tu , Hoang Thi Thu Uyen , Tu Minh Phuong , Ngo Xuan Bach

Frame semantic parsing is a semantic analysis task based on FrameNet which has received great attention recently. The task usually involves three subtasks sequentially: (1) target identification, (2) frame classification and (3) semantic…

Computation and Language · Computer Science 2021-09-28 Zhichao Lin , Yueheng Sun , Meishan Zhang

We demonstrate the effectiveness of multilingual learning for unsupervised part-of-speech tagging. The central assumption of our work is that by combining cues from multiple languages, the structure of each becomes more apparent. We…

Computation and Language · Computer Science 2014-01-23 Tahira Naseem , Benjamin Snyder , Jacob Eisenstein , Regina Barzilay

Keyphrases efficiently summarize a document's content and are used in various document processing and retrieval tasks. Several unsupervised techniques and classifiers exist for extracting keyphrases from text documents. Most of these…

Computation and Language · Computer Science 2016-08-04 Sujatha Das Gollapalli , Xiao-li Li

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…

Computation and Language · Computer Science 2014-03-26 K. Sureka , K. G. Srinivasagan , S. Suganthi

File formats specify how data is encoded for persistent storage. They cannot be formalized as context-free grammars since their specifications include context-sensitive patterns such as the random access pattern and the type-length-value…

Programming Languages · Computer Science 2023-04-24 Jialun Zhang , Greg Morrisett , Gang Tan

In this paper, we present a novel approach to natural language understanding that utilizes context-free grammars (CFGs) in conjunction with sequence-to-sequence (seq2seq) deep learning. Specifically, we take a CFG authored to generate…

Computation and Language · Computer Science 2016-07-26 Adam James Summerville , James Ryan , Michael Mateas , Noah Wardrip-Fruin

In the following paper, we present a simple method for sampling trees with or without replacement from BCFLs. A BCFL is a context-free language (CFL) corresponding to an incomplete string with holes, which can be completed by valid…

Formal Languages and Automata Theory · Computer Science 2024-08-13 Breandan Considine

The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…

Programming Languages · Computer Science 2017-08-29 José María Rey-Poza , Julio Mariño-Carballo

A sentence can be translated into more than one correct sentences. However, most of the existing neural machine translation models only use one of the correct translations as the targets, and the other correct sentences are punished as the…

Computation and Language · Computer Science 2018-05-15 Shuming Ma , Xu Sun , Yizhong Wang , Junyang Lin

In essence, the two tagging methods (direct tagging and tagging with sentences compression) are to tag the information we need by using regular expression which basing on the inherent language patterns of the natural language. Though it has…

Computation and Language · Computer Science 2018-10-08 Peihui Chen

Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true semantic ambiguities are in the input. This…

cmp-lg · Computer Science 2008-02-03 Jason Eisner
‹ Prev 1 4 5 6 7 8 10 Next ›