English
Related papers

Related papers: Parsing of Myanmar sentences with function tagging

200 papers

In zero-shot text-to-speech, achieving a balance between fidelity to the target speaker and adherence to text content remains a challenge. While classifier-free guidance (CFG) strategies have shown promising results in image generation,…

Audio and Speech Processing · Electrical Eng. & Systems 2026-03-25 John Zheng , Farhad Maleki

The aim of syntactic tracking is to classify spatio-temporal patterns of a target's motion using natural language processing models. In this paper, we generalize earlier work by considering a constrained stochastic context free grammar…

Computation and Language · Computer Science 2018-08-07 Vikram Krishnamurthy , Sijia Gao

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…

Computation and Language · Computer Science 2023-01-09 Angelina Aquino , Franz de Leon

Compound probabilistic context-free grammars (C-PCFGs) have recently established a new state of the art for unsupervised phrase-structure grammar induction. However, due to the high space and time complexities of chart-based representation…

Computation and Language · Computer Science 2023-10-24 Yanpeng Zhao , Ivan Titov

Synchronous Tree Adjoining Grammars can be used for Machine Translation. However, translating a free order language such as Korean to English is complicated. I present a mechanism to translate scrambled Korean sentences into English by…

cmp-lg · Computer Science 2008-02-03 Hyun S. Park

The configurational information in sentences of a free word order language such as Sanskrit is of limited use. Thus, the context of the entire sentence will be desirable even for basic processing tasks such as word segmentation. We propose…

Computation and Language · Computer Science 2018-10-26 Amrith Krishna , Bishal Santra , Sasi Prasanth Bandaru , Gaurav Sahu , Vishnu Dutt Sharma , Pavankumar Satuluri , Pawan Goyal

Based on the sense definition of words available in the Bengali WordNet, an attempt is made to classify the Bengali sentences automatically into different groups in accordance with their underlying senses. The input sentences are collected…

Computation and Language · Computer Science 2015-08-07 Alok Ranjan Pal , Diganta Saha , Niladri Sekhar Dash

I present a simple algorithm for enumerating the trees generated by a Context Free Grammar (CFG). The algorithm uses a pairing function to form a bijection between CFG derivations and natural numbers, so that trees can be uniquely decoded…

Computation and Language · Computer Science 2023-05-02 Steven T. Piantadosi

This paper investigates part-of-speech tagging, an important task in Natural Language Processing (NLP) for the Nagamese language. The Nagamese language, a.k.a. Naga Pidgin, is an Assamese-lexified Creole language developed primarily as a…

Computation and Language · Computer Science 2025-10-14 Alovi N Shohe , Chonglio Khiamungam , Teisovi Angami

Probabilistic context free grammars (PCFG) have been the core of the probabilistic reasoning based parsers for several years especially in the context of the NLP. Multi entity bayesian networks (MEBN) a First Order Logic probabilistic…

Artificial Intelligence · Computer Science 2019-01-29 Shrinivasan R Patnaik Patnaikuni , Dr. Sachin R Gengaje

Prefix parsing asks whether an input prefix can be extended to a complete string generated by a given grammar. In the weighted setting, it also provides prefix probabilities, which are central to context-free language modeling,…

Computation and Language · Computer Science 2026-05-05 Clemente Pasti , Andreas Opedal , Timothy J. O'Donnell , Ryan Cotterell , Tim Vieira

Low-resource languages pose a challenge for machine translation with large language models (LLMs), which require large amounts of training data. One potential way to circumvent this data dependence is to rely on LLMs' ability to use…

Computation and Language · Computer Science 2026-04-09 Jackson Petty , Jaulie Goe , Tal Linzen

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 · Computer Science 2008-02-03 Thorsten Brants , Wojciech Skut , Brigitte Krenn

This paper presents an empirical study of two widely-used sequence prediction models, Conditional Random Fields (CRFs) and Long Short-Term Memory Networks (LSTMs), on two fundamental tasks for Vietnamese text processing, including…

Computation and Language · Computer Science 2017-08-31 Phuong Le-Hong , Minh Pham Quang Nhat , Thai-Hoang Pham , Tuan-Anh Tran , Dang-Minh Nguyen

We introduce a memory-based approach to part of speech tagging. Memory-based learning is a form of supervised learning based on similarity-based reasoning. The part of speech tag of a word in a particular context is extrapolated from the…

cmp-lg · Computer Science 2008-02-03 Walter Daelemans , Jakub Zavrel , Peter Berck , Steven Gillis

Khmer text is written from left to right with optional space. Space is not served as a word boundary but instead, it is used for readability or other functional purposes. Word segmentation is a prior step for downstream tasks such as…

Computation and Language · Computer Science 2021-04-01 Rina Buoy , Nguonly Taing , Sokchea Kor

Syntactic parsing is essential in natural-language processing, with constituent structure being one widely used description of syntax. Traditional views of constituency demand that constituents consist of adjacent words, but this poses…

Computation and Language · Computer Science 2024-10-14 Lukas Mielczarek

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…

Computation and Language · Computer Science 2018-07-12 Chaitanya Malaviya , Matthew R. Gormley , Graham Neubig

Probabilistic context-free grammars (PCFGs), which are commonly used to generate trees randomly, have been well analyzed theoretically, leading to applications in various domains. Despite their utility, the distributions that the grammar…

Disordered Systems and Neural Networks · Physics 2024-08-30 Kai Nakaishi , Koji Hukushima

We compare the effectiveness of four different syntactic CCG parsers for a semantic slot-filling task to explore how much syntactic supervision is required for downstream semantic analysis. This extrinsic, task-based evaluation provides a…

Computation and Language · Computer Science 2017-02-01 Yonatan Bisk , Siva Reddy , John Blitzer , Julia Hockenmaier , Mark Steedman