Neo-Davidsonian Semantics in Lexicalized Grammars
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Sentence Realization with Unlexicalized Tree Linearization Grammars
2012-12-01 · COLING 2012 12
· Rui Wang, Yi Zhang
SentenceText Generation
Detecting and Correcting Syntactic Errors in Machine Translation Using Feature-Based Lexicalized Tree Adjoining Grammars
2012-09-01 · ROCLINGIJCLCLP 2012 9
· Wei-Yun Ma, Kathleen McKeown
Machine TranslationTranslation
Multiple Context-Free Tree Grammars: Lexicalization and Characterization
2017-07-11
· Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transf…
Bootstrapping UD treebanks for Delexicalized Parsing
2019-09-01 · WS (NoDaLiDa) 2019 9
· Prasanth Kolachina, Aarne Ranta
Standard approaches to treebanking traditionally employ a waterfall model (Sommerville, 2010), where annotation guidelines guide the annotation process and insights from the annotation process in turn lead to subsequent …
German and French Neural Supertagging Experiments for LTAG Parsing
2018-07-01 · ACL 2018 7
· Tatiana Bladier, Andreas van Cranenburgh, Younes Samih, Laura Kallmeyer
We present ongoing work on data-driven parsing of German and French with Lexicalized Tree Adjoining Grammars. We use a supertagging approach combined with deep learning. We show the challenges of extracting LTAG supertag…
Dependency ParsingSemantic ParsingSemantic Role Labeling