Judging Grammaticality with Count-Induced Tree Substitution Grammars
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Unsupervised Parsing via Constituency Tests
We propose a method for unsupervised parsing based on the linguistic notion of a constituency test. One type of constituency test involves modifying the sentence via some transformation (e.g. replacing the span with a pr…
SentenceSpecies tree inference from genomic sequences using the log-det distance
The log-det distance between two aligned DNA sequences was introduced as a tool for statistically consistent inference of a gene tree under simple non-mixture models of sequence evolution. Here we prove that the log-det …
Personalizing Lexical Simplification
A lexical simplification (LS) system aims to substitute complex words with simple words in a text, while preserving its meaning and grammaticality. Despite individual users{'} differences in vocabulary knowledge, current…
Complex Word IdentificationLexical SimplificationContrasting Human- and Machine-Generated Word-Level Adversarial Examples for Text Classification
Research shows that natural language processing models are generally considered to be vulnerable to adversarial attacks; but recent work has drawn attention to the issue of validating these adversarial inputs against cer…
Sentiment AnalysisSentiment Classificationtext-classificationText Classification+1Multiple Admissibility: Judging Grammaticality using Unlabeled Data in Language Learning
We present our work on the problem of Multiple Admissibility (MA) in language learning. Multiple Admissibility occurs in many languages when more than one grammatical form of a word fits syntactically and semantically in…