English
Related papers

Related papers: FST Morphological Analyser and Generator for Mapud…

200 papers

Canonical morphological segmentation is the process of analyzing words into the standard (aka underlying) forms of their constituent morphemes. This is a core task in language documentation, and NLP systems have the potential to…

Computation and Language · Computer Science 2024-10-16 Enora Rice , Ali Marashian , Luke Gessler , Alexis Palmer , Katharina von der Wense

An \omega-grammar is a formal grammar used to generate \omega-words (i.e. infinite length words), while an \omega-automaton is an automaton used to recognize \omega-words. This paper gives clean and uniform definitions for \omega-grammars…

Formal Languages and Automata Theory · Computer Science 2013-08-22 Zhe Chen

This paper presents an integrated tool for German morphology and statistical part-of-speech tagging which aims at making some well established methods widely available. The software is very user friendly, runs on any PC and can be…

cmp-lg · Computer Science 2008-02-03 Wolfgang Lezius , Reinhard Rapp , Manfred Wettler

We introduce Morse, a recurrent encoder-decoder model that produces morphological analyses of each word in a sentence. The encoder turns the relevant information about the word and its context into a fixed size vector representation and the…

Computation and Language · Computer Science 2019-09-25 Ekin Akyürek , Erenay Dayanık , Deniz Yuret

Neural machine translation (NMT) models are typically trained with fixed-size input and output vocabularies, which creates an important bottleneck on their accuracy and generalization capability. As a solution, various studies proposed…

Computation and Language · Computer Science 2018-05-08 Duygu Ataman , Marcello Federico

In this paper, we present an analysis of computationally generated mixed-modality definite referring expressions using combinations of gesture and linguistic descriptions. In doing so, we expose some striking formal semantic properties of…

Computation and Language · Computer Science 2020-03-18 Nikhil Krishnaswamy , James Pustejovsky

Real-world multimodal applications often require any-to-any capabilities, enabling both understanding and generation across modalities including text, image, audio, and video. However, integrating the strengths of autoregressive language…

Machine Learning · Computer Science 2025-08-15 Jiulin Li , Ping Huang , Yexin Li , Shuo Chen , Juewen Hu , Ye Tian

Recent efforts of multimodal Transformers have improved Visually Rich Document Understanding (VrDU) tasks via incorporating visual and textual information. However, existing approaches mainly focus on fine-grained elements such as words and…

Computer Vision and Pattern Recognition · Computer Science 2022-09-20 Wenjin Wang , Zhengjie Huang , Bin Luo , Qianglong Chen , Qiming Peng , Yinxu Pan , Weichong Yin , Shikun Feng , Yu Sun , Dianhai Yu , Yin Zhang

The present study has two goals relating to the grammar of prosody, understood as the rhythms and melodies of speech. First, an overview is provided of the computable grammatical and phonetic approaches to prosody analysis which use…

Computation and Language · Computer Science 2019-12-17 Dafydd Gibbon

Large language models (LLMs) produce high-dimensional embeddings that capture rich semantic and syntactic relationships between words, sentences, and concepts. Investigating the topological structures of LLM embedding spaces via mapper…

Computational Geometry · Computer Science 2025-07-25 Xinyuan Yan , Rita Sevastjanova , Sinie van der Ben , Mennatallah El-Assady , Bei Wang

We summarize the accomplishments of a multi-disciplinary workshop exploring the computational and scientific issues surrounding the discovery of linguistic units (subwords and words) in a language without orthography. We study the…

This paper presents a scalable method for integrating compositional morphological representations into a vector-based probabilistic language model. Our approach is evaluated in the context of log-bilinear language models, rendered suitably…

Computation and Language · Computer Science 2014-05-19 Jan A. Botha , Phil Blunsom

Morphological inflection generation is the task of generating the inflected form of a given lemma corresponding to a particular linguistic transformation. We model the problem of inflection generation as a character sequence to sequence…

Computation and Language · Computer Science 2016-03-23 Manaal Faruqui , Yulia Tsvetkov , Graham Neubig , Chris Dyer

This paper describes pre-processing phase of ontology graph generation system from Punjabi text documents of different domains. This research paper focuses on pre-processing of Punjabi text documents. Pre-processing is structured…

Computation and Language · Computer Science 2014-11-24 Rajveer Kaur , Saurabh Sharma

A comprehensive understanding of molecular structures is important for the prediction of molecular ground-state conformation involving property information. Meanwhile, state space model (e.g., Mamba) has recently emerged as a promising…

Chemical Physics · Physics 2025-11-14 Yuxin Gou , Aming Wu , Richang Hong , Meng Wang

Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach to generate NFA from an interaction language such as UML…

Formal Languages and Automata Theory · Computer Science 2023-08-04 Erwan Mahe , Boutheina Bannour , Christophe Gaston , Arnault Lapitre , Pascale Le Gall

Fine-grained entity typing (FET), which assigns entities in text with context-sensitive, fine-grained semantic types, is a basic but important task for knowledge extraction from unstructured text. FET has been studied extensively in natural…

Computation and Language · Computer Science 2024-06-12 Tanay Komarlu , Minhao Jiang , Xuan Wang , Jiawei Han

Arabic morphology encapsulates many valuable features such as word root. Arabic roots are being utilized for many tasks; the process of extracting a word root is referred to as stemming. Stemming is an essential part of most Natural…

Computation and Language · Computer Science 2016-11-02 Mahmoud El-Defrawy , Yasser El-Sonbaty , Nahla A. Belal

In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a…

cmp-lg · Computer Science 2016-08-31 Shuly Wintner , Nissim Francez

We present an integrated architecture for word-level and sentence-level processing in a unification-based paradigm. The core of the system is a CLP implementation of a unification engine for feature structures supporting relational values.…

cmp-lg · Computer Science 2008-02-03 Harald Trost , Johannes Matiasek