English
Related papers

Related papers: Quantifying syntax similarity with a polynomial re…

200 papers

Syntax is a latent hierarchical structure which underpins the robust and compositional nature of human language. In this work, we explore the hypothesis that syntactic dependencies can be represented in language model attention…

Computation and Language · Computer Science 2023-10-24 Jasper Jian , Siva Reddy

We present an approach for assessing how multilingual large language models (LLMs) learn syntax in terms of multi-formalism syntactic structures. We aim to recover constituent and dependency structures by casting parsing as sequence…

Computation and Language · Computer Science 2023-09-21 Alberto Muñoz-Ortiz , David Vilares , Carlos Gómez-Rodríguez

We describe a cross-lingual adaptation method based on syntactic parse trees obtained from the Universal Dependencies (UD), which are consistent across languages, to develop classifiers in low-resource languages. The idea of UD parsing is…

Computation and Language · Computer Science 2020-03-31 Nasrin Taghizadeh , Heshaam Faili

The patterns in which the syntax of different languages converges and diverges are often used to inform work on cross-lingual transfer. Nevertheless, little empirical work has been done on quantifying the prevalence of different syntactic…

Computation and Language · Computer Science 2020-07-14 Dmitry Nikolaev , Ofir Arviv , Taelin Karidi , Neta Kenneth , Veronika Mitnik , Lilja Maria Saeboe , Omri Abend

We introduce a novel dependency parser, the hexatagger, that constructs dependency trees by tagging the words in a sentence with elements from a finite set of possible tags. In contrast to many approaches to dependency parsing, our approach…

Computation and Language · Computer Science 2023-08-01 Afra Amini , Tianyu Liu , Ryan Cotterell

We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…

Databases · Computer Science 2007-05-23 Georg Gottlob , Christoph Koch , Klaus U. Schulz

We study methods for learning sentence embeddings with syntactic structure. We focus on methods of learning syntactic sentence-embeddings by using a multilingual parallel-corpus augmented by Universal Parts-of-Speech tags. We evaluate the…

Computation and Language · Computer Science 2019-10-28 Chen Liu , Anderson de Andrade , Muhammad Osama

Both syntactic and semantic structures are key linguistic contextual clues, in which parsing the latter has been well shown beneficial from parsing the former. However, few works ever made an attempt to let semantic parsing help syntactic…

Computation and Language · Computer Science 2020-10-08 Junru Zhou , Zuchao Li , Hai Zhao

We present a syntactic dependency treebank for naturalistic child and child-directed speech in English (MacWhinney, 2000). Our annotations largely followed the guidelines of the Universal Dependencies project (UD (Zeman et al., 2022)), with…

Computation and Language · Computer Science 2022-09-29 Zoey Liu , Emily Prud'hommeaux

In this paper we investigated two different methods to parse relative and noun complement clauses in English and resorted to distinct tags for their corresponding that as a relative pronoun and as a complementizer. We used an algorithm to…

Computation and Language · Computer Science 2022-12-07 Zineddine Tighidet , Nicolas Ballier

Analysis methods which enable us to better understand the representations and functioning of neural models of language are increasingly needed as deep learning becomes the dominant approach in NLP. Here we present two methods based on…

Computation and Language · Computer Science 2023-06-02 Grzegorz Chrupała , Afra Alishahi

The paper presents a language model that develops syntactic structure and uses it to extract meaningful information from the word history, thus enabling the use of long distance dependencies. The model assigns probability to every joint…

Computation and Language · Computer Science 2007-05-23 Ciprian Chelba

Given $n \geq 1$, we study the existence of a tree on $n$ vertices whose independence polynomial is symmetric and unimodal as well as the existence of a symmetric and unimodal independence polynomial of degree $n$ of a tree.

Combinatorics · Mathematics 2026-04-22 Takayuki Hibi , Selvi Kara , Dalena Vien

Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntactically-dependent words. The tendency of these…

Computation and Language · Computer Science 2024-03-05 Lluís Alemany-Puig , Ramon Ferrer-i-Cancho

In this paper, we discuss a method for identifying a seed word that would best represent a class of named entities in a graphical representation of words and their similarities. Word networks, or word graphs, are representations of…

Computation and Language · Computer Science 2018-07-13 Miguel Feria , Juan Paolo Balbin , Francis Michael Bautista

While syntactic dependency annotations concentrate on the surface or functional structure of a sentence, semantic dependency annotations aim to capture between-word relationships that are more closely related to the meaning of a sentence,…

Computation and Language · Computer Science 2018-07-05 Timothy Dozat , Christopher D. Manning

We train one multilingual model for dependency parsing and use it to parse sentences in several languages. The parsing model uses (i) multilingual word clusters and embeddings; (ii) token-level language information; and (iii)…

Computation and Language · Computer Science 2016-07-27 Waleed Ammar , George Mulcaire , Miguel Ballesteros , Chris Dyer , Noah A. Smith

We present a semantic parser for Abstract Meaning Representations which learns to parse strings into tree representations of the compositional structure of an AMR graph. This allows us to use standard neural techniques for supertagging and…

Computation and Language · Computer Science 2021-06-10 Jonas Groschwitz , Matthias Lindemann , Meaghan Fowlie , Mark Johnson , Alexander Koller

In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a…

cmp-lg · Computer Science 2008-02-03 Aravind K. Joshi , B. Srinivas

We present a novel technique for learning semantic representations, which extends the distributional hypothesis to multilingual data and joint-space embeddings. Our models leverage parallel data and learn to strongly align the embeddings of…

Computation and Language · Computer Science 2014-04-21 Karl Moritz Hermann , Phil Blunsom