النموذج المهيمن للتحلل الدلالي في السنوات الأخيرة هو صياغة تحليل كمركز تسلسل إلى تسلسل، وتوليد تنبؤات مع فك تراجع التسلسل التلقائي.في هذا العمل، نستكشف نموذجا بديلا.نقوم بصياغة تحليل دلالي كهامة تحليل التبعية، وتطبيق تقنيات فك التشفير المستندة إلى الرسم البياني المتقدمة لتحليل النحوي.نحن نقارن مختلف تقنيات فك التشفير بالنظر إلى نفس التشفير المحول المدرب مسبقا في أفضل مجموعة البيانات، بما في ذلك الإعدادات التي تكون فيها بيانات التدريب محدودة أو تحتوي على أمثلة مشروح جزئيا فقط.نجد أن نهجنا القائم على الرسم البياني لدينا هو تنافسي مع فك ترميز الترميز على الإعداد المعياري، ويقدم تحسينات كبيرة في كفاءة البيانات والإعدادات حيث تتوفر البيانات المشروح جزئيا.
The dominant paradigm for semantic parsing in recent years is to formulate parsing as a sequence-to-sequence task, generating predictions with auto-regressive sequence decoders. In this work, we explore an alternative paradigm. We formulate semantic parsing as a dependency parsing task, applying graph-based decoding techniques developed for syntactic parsing. We compare various decoding techniques given the same pre-trained Transformer encoder on the TOP dataset, including settings where training data is limited or contains only partially-annotated examples. We find that our graph-based approach is competitive with sequence decoders on the standard setting, and offers significant improvements in data efficiency and settings where partially-annotated data is available.
References used
https://aclanthology.org/
AM dependency parsing is a method for neural semantic graph parsing that exploits the principle of compositionality. While AM dependency parsers have been shown to be fast and accurate across several graphbanks, they require explicit annotations of t
Frame semantic parsing is a semantic analysis task based on FrameNet which has received great attention recently. The task usually involves three subtasks sequentially: (1) target identification, (2) frame classification and (3) semantic role labelin
Graph-based semantic parsing aims to represent textual meaning through directed graphs. As one of the most promising general-purpose meaning representations, these structures and their parsing have gained a significant interest momentum during recent
The tasks of Rich Semantic Parsing, such as Abstract Meaning Representation (AMR), share similar goals with Information Extraction (IE) to convert natural language texts into structured semantic representations. To take advantage of such similarity,
Generating long text conditionally depending on the short input text has recently attracted more and more research efforts. Most existing approaches focus more on introducing extra knowledge to supplement the short input text, but ignore the coherenc