English
Related papers

Related papers: Generating Context-Appropriate Word Orders in Turk…

200 papers

Whether language models (LMs) have inductive biases that favor typologically frequent grammatical properties over rare, implausible ones has been investigated, typically using artificial languages (ALs) (White and Cotterell, 2021;…

Computation and Language · Computer Science 2025-10-15 Nadine El-Naggar , Tatsuki Kuribayashi , Ted Briscoe

In recent years, with the development of deep learning, text generation technology has undergone great changes and provided many kinds of services for human beings, such as restaurant reservation and daily communication. The automatically…

Computation and Language · Computer Science 2020-12-25 Bin Guo , Hao Wang , Yasan Ding , Wei Wu , Shaoyang Hao , Yueqi Sun , Zhiwen Yu

Prior work has shown that the ordering in which concepts are shown to a commonsense generator plays an important role, affecting the quality of the generated sentence. However, it remains a challenge to determine the optimal ordering of a…

Computation and Language · Computer Science 2023-09-13 Tianhui Zhang , Danushka Bollegala , Bei Peng

Most natural languages have a predominant or fixed word order. For example in English the word order is usually Subject-Verb-Object. This work attempts to explain this phenomenon as well as other typological findings regarding word order…

Computation and Language · Computer Science 2021-09-02 Idan Rejwan , Avi Caciularu

Natural Language Generation (NLG) popularity has increased owing to the progress in Large Language Models (LLMs), with zero-shot inference capabilities. However, most neural systems utilize decoder-only causal (unidirectional) transformer…

Because meaning can often be inferred from lexical semantics alone, word order is often a redundant cue in natural language. For example, the words chopped, chef, and onion are more likely used to convey "The chef chopped the onion," not…

Computation and Language · Computer Science 2022-03-15 Isabel Papadimitriou , Richard Futrell , Kyle Mahowald

Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of string…

Formal Languages and Automata Theory · Computer Science 2022-05-17 Andreas Maletti , Lena Katharina Schiffer

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

Most current popular subword tokenizers are trained based on word frequency statistics over a corpus, without considering information about co-occurrence or context. Nevertheless, the resulting vocabularies are used in language models'…

Computation and Language · Computer Science 2023-02-13 Shaked Yehezkel , Yuval Pinter

Targeted Sentiment Analysis aims to extract sentiment towards a particular target from a given text. It is a field that is attracting attention due to the increasing accessibility of the Internet, which leads people to generate an enormous…

Computation and Language · Computer Science 2022-05-10 M. Melih Mutlu , Arzucan Özgür

Word order variances generally exist in different languages. In this paper, we hypothesize that cross-lingual models that fit into the word order of the source language might fail to handle target languages. To verify this hypothesis, we…

Computation and Language · Computer Science 2020-12-09 Zihan Liu , Genta Indra Winata , Samuel Cahyawijaya , Andrea Madotto , Zhaojiang Lin , Pascale Fung

Sentence order prediction is the task of finding the correct order of sentences in a randomly ordered document. Correctly ordering the sentences requires an understanding of coherence with respect to the chronological sequence of events…

Computation and Language · Computer Science 2021-09-07 Deepanway Ghosal , Navonil Majumder , Rada Mihalcea , Soujanya Poria

Many theories of semantic interpretation use lambda-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate lambda-term operations with…

cmp-lg · Computer Science 2008-02-03 Seth Kulick

Automatic text tagging is an important component in higher level analysis of text corpora, and its output can be used in many natural language processing applications. In languages like Turkish or Finnish, with agglutinative morphology,…

cmp-lg · Computer Science 2008-02-03 Kemal Oflazer , Ilker Kuruoz

For languages with no annotated resources, unsupervised transfer of natural language processing models such as named-entity recognition (NER) from resource-rich languages would be an appealing capability. However, differences in words and…

Computation and Language · Computer Science 2018-09-13 Jiateng Xie , Zhilin Yang , Graham Neubig , Noah A. Smith , Jaime Carbonell

Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that…

Computation and Language · Computer Science 2019-10-25 Sean Welleck , Kianté Brantley , Hal Daumé , Kyunghyun Cho

We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages…

Formal Languages and Automata Theory · Computer Science 2022-09-01 Jürgen Dassow , Bianca Truthe

This paper concerns the structure of meanings within natural language. Earlier, a framework named DisCoCirc was sketched that (1) is compositional and distributional (a.k.a. vectorial); (2) applies to general text; (3) captures linguistic…

Computation and Language · Computer Science 2023-01-26 Vincent Wang-Mascianica , Jonathon Liu , Bob Coecke

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in…

Formal Languages and Automata Theory · Computer Science 2013-11-27 Pierluigi Crescenzi , Daniel Gildea , Andrea Marino , Gianluca Rossi , Giorgio Satta

Word ordering is a constrained language generation task taking unordered words as input. Existing work uses linear models and neural networks for the task, yet pre-trained language models have not been studied in word ordering, let alone…

Computation and Language · Computer Science 2022-10-31 Zebin Ou , Meishan Zhang , Yue Zhang