English
Related papers

Related papers: A Freely Available Wide Coverage Morphological Ana…

200 papers

Self-supervised speech models can be trained to efficiently recognize spoken words in naturalistic, noisy environments. However, we do not understand the types of linguistic representations these models use to accomplish this task. To…

Computation and Language · Computer Science 2025-09-30 Jon Gauthier , Canaan Breiss , Matthew Leonard , Edward F. Chang

Current lexical simplification approaches rely heavily on heuristics and corpus level features that do not always align with human judgment. We create a human-rated word-complexity lexicon of 15,000 English words and propose a novel neural…

Computation and Language · Computer Science 2018-10-16 Mounica Maddela , Wei Xu

This paper presents a high-quality multilingual dataset for the documentation domain to advance research on localization of structured text. Unlike widely-used datasets for translation of plain text, we collect XML-structured parallel text…

Computation and Language · Computer Science 2020-06-25 Kazuma Hashimoto , Raffaella Buschiazzo , James Bradbury , Teresa Marshall , Richard Socher , Caiming Xiong

A lexical database tool tailored for phonological research is described. Database fields include transcriptions, glosses and hyperlinks to speech files. Database queries are expressed using HTML forms, and these permit regular expression…

cmp-lg · Computer Science 2008-02-03 Steven Bird

We generalized a voice morphing algorithm capable of handling temporally variable, multiple-attributes, and multiple instances. The generalized morphing provides a new strategy for investigating speech diversity. However, excessive…

Human-Computer Interaction · Computer Science 2024-04-23 Hideki Kawahara , Masanori Morise

We show that a general model of lexical information conforms to an abstract model that reflects the hierarchy of information found in a typical dictionary entry. We show that this model can be mapped into a well-formed XML document, and how…

Computation and Language · Computer Science 2007-07-24 Laurent Romary , Nancy Ide , Adam Kilgarriff

Polysynthetic languages have exceptionally large and sparse vocabularies, thanks to the number of morpheme slots and combinations in a word. This complexity, together with a general scarcity of written data, poses a challenge to the…

Computation and Language · Computer Science 2020-05-05 William Lane , Steven Bird

There have been multiple attempts to resolve various inflection matching problems in information retrieval. Stemming is a common approach to this end. Among many techniques for stemming, statistical stemming has been shown to be effective…

Information Retrieval · Computer Science 2016-06-22 Javid Dadashkarimi , Hossein Nasr Esfahani , Heshaam Faili , Azadeh Shakery

Language documentation projects often involve the creation of annotated text in a format such as interlinear glossed text (IGT), which captures fine-grained morphosyntactic analyses in a morpheme-by-morpheme format. However, there are few…

Computation and Language · Computer Science 2024-11-14 Michael Ginn , Lindia Tjuatja , Taiqi He , Enora Rice , Graham Neubig , Alexis Palmer , Lori Levin

We investigate inflection structure of a synthetic language using Latin as an example. We construct a bipartite graph in which one group of vertices correspond to dictionary headwords and the other group to inflected forms encountered in a…

Computation and Language · Computer Science 2023-12-18 Henryk Fukś

The development of synthesis procedures remains a fundamental challenge in materials discovery, with procedural knowledge scattered across decades of scientific literature in unstructured formats that are challenging for systematic…

This paper proposes a programmable relation extraction method for the English language by parsing texts into semantic graphs. A person can define rules in plain English that act as matching patterns onto the graph representation. These…

Computation and Language · Computer Science 2020-11-06 Alberto Cetoli

We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is…

cmp-lg · Computer Science 2008-02-03 Daniel D. K. Sleator , Davy Temperley

We introduce a language-agnostic evolutionary technique for automatically extracting chunks from dependency treebanks. We evaluate these chunks on a number of morphosyntactic tasks, namely POS tagging, morphological feature tagging, and…

Computation and Language · Computer Science 2019-08-22 Mark Anderson , David Vilares , Carlos Gómez-Rodríguez

Large language models (LLMs) are increasingly touted as powerful tools for automating scientific information extraction. However, existing methods and tools often struggle with the realities of scientific literature: long-context documents,…

Is it possible to specify a grammatical representation (descriptors and their application guidelines) to such a degree that it can be consistently applied by different grammarians e.g. for producing a benchmark corpus for parser evaluation?…

cmp-lg · Computer Science 2016-08-31 Atro Voutilainen , Timo Jarvinen

The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…

Discrete Mathematics · Computer Science 2014-02-19 V. Bino Sebastian , A Unnikrishnan , Kannan Balakrishnan , P. B Ramkumar

We incorporate morphological supervision into character language models (CLMs) via multitasking and show that this addition improves bits-per-character (BPC) performance across 24 languages, even when the morphology data and language…

Computation and Language · Computer Science 2019-06-14 Terra Blevins , Luke Zettlemoyer

A core part of linguistic typology is the classification of languages according to linguistic properties, such as those detailed in the World Atlas of Language Structure (WALS). Doing this manually is prohibitively time-consuming, which is…

Computation and Language · Computer Science 2018-02-27 Johannes Bjerva , Isabelle Augenstein

Neural language models (LMs) have shown to benefit significantly from enhancing word vectors with subword-level information, especially for morphologically rich languages. This has been mainly tackled by providing subword-level information…

Computation and Language · Computer Science 2019-10-28 Yash Shah , Ishan Tarunesh , Harsh Deshpande , Preethi Jyothi
‹ Prev 1 4 5 6 7 8 10 Next ›