paper-with-me

Papers

Exploiting Language Variants Via Grammar Parsing Having Morphologically Rich Information

2014-10-01 · WS 2014 10 · Qaiser Abbas
📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Grammar Induction with Neural Language Models: An Unusual Replication

2018-08-29 · EMNLP (ACL) 2018 10 · Phu Mon Htut, Kyunghyun Cho, Samuel R. Bowman

A substantial thread of recent work on latent tree learning has attempted to develop neural network models with parse-valued latent variables and train them on non-parsing tasks, in the hope of having them discover inter…

Constituency ParsingLanguage ModelingLanguage Modelling

Exploiting Frame-Semantics and Frame-Semantic Parsing for Automatic Extraction of Typological Information from Descriptive Grammars of Natural Languages

2019-09-01 · RANLP 2019 9 · Shafqat Mumtaz Virk, Azam Sheikh Muhammad, Lars Borin, Muhammad Irfan Aslam 외

We describe a novel system for automatic extraction of typological linguistic information from descriptive grammars of natural languages, applying the theory of frame semantics in the form of frame-semantic parsing. The …

DescriptiveSemantic Parsing

Exploiting Multiple Treebanks for Parsing with Quasi-synchronous Grammars

2012-07-01 · ACL 2012 7 · Zhenghua Li, Ting Liu, Wanxiang Che
Information Retrieval

BenchCLAMP: A Benchmark for Evaluating Language Models on Syntactic and Semantic Parsing

2022-06-21 · NeurIPS 2023 11 · Subhro Roy, Sam Thomson, Tongfei Chen, Richard Shin 외

Recent work has shown that generation from a prompted or fine-tuned language model can perform well at semantic parsing when the output is constrained to be a valid semantic representation. We introduce BenchCLAMP, a Ben…

DecoderLanguage ModelingLanguage ModellingSemantic Parsing+2

Exact yet Efficient Graph Parsing, Bi-directional Locality and the Constructivist Hypothesis

2020-07-01 · ACL 2020 6 · Yajie Ye, Weiwei Sun

A key problem in processing graph-based meaning representations is graph parsing, i.e. computing all possible derivations of a given graph according to a (competence) grammar. We demonstrate, for the first time, that exa…