User:AyeshaBD/Semantic parsing

From Wikipedia, the free encyclopedia

Semantic parsing is the task of converting a natural language utterance to a logical form: a machine-understandable representation of its meaning.[1] Semantic parsing can thus be understood as extracting the precise meaning of an utterance. Applications of semantic parsing include machine translation,[2] question answering,[1][3] ontology induction,[4] automated reasoning,[5] and code generation.[6][7] The phrase was first used in the 1970s by Yorick Wilks as the basis for machine translation programs working with only semantic representations.[8]. Semantic parsing is one of the important tasks in computational linguistics and natural language processing. Semantic parsing maps text to formal meaning representations. This contrasts with semantic role labeling and other forms of shallow semantic processing, which do not aim to produce complete formal meanings. [9].

File:Figure-1-System-architecture-of-Semantic-parser.png
System Architecture of Semantic Parser

In computer vision, semantic parsing is a process of segmentation for 3D objects.[10][11]. Here, we have attached a system architecture for Semantic Parser to understand more briefly. In this picture it represent a basic architecture of semantic parsing, where the whole process has multiple steps like Token Analyzer takes input from input sentence and generate token, Syntactic Analyzer generate parse tree, and with the help of set of rules it generate the semantic meaning of a sentence [12].

History & Background[edit]

Surprisingly true that, Semantic parsing is not a new problem that has been since the 1970s [13]. Back then, people were trying to know how to make a computer understand to human language with the interaction with blocks in project known as SHRDLU. At the beginning of the research of semantic parsing, the way of work was 'traditional' way, which was not only included generation of grammar manually [14] but also applied programming logic [15] . In this paper they worked with a parser in their specific areas as well as they couldn't manage different tasks as the generation of grammar was hard then. At this time researcher were developing dataset and grammar like Natural Language Interface to dataset. In the 2000s, most of the work in this area involved the creation/learning and use of different grammars and lexicons on controlled tasks [16], [17] particularly general grammars such as SCFGs [18]. This improved upon manual grammars primarily because they leveraged the syntactical nature of the sentence, but they still couldn’t cover enough variation and weren’t robust enough to be used in the real world. However, following the development of advanced neural network techniques, especially the Seq2Seq model [19], and the availability of powerful computational resources, neural semantic parsing started emerging. Not only was it providing competitive results on the existing datasets, but it was robust to noise and did not require a lot of supervision and manual intervention. The current transition of traditional parsing to neural semantic parsing has not been perfect though. Neural semantic parsing with its advantages, still fails to solve the problem at a deeper level. Neural models like Seq2Seq treat the parsing problem as a sequential translation problem, and the model learns patterns in a black-box manner, which means we cannot really predict whether the model is truly solving the problem. Intermediate efforts and modifications to the Seq2Seq to incorporate syntax and semantic meaning have been attempted [20], [21] with a marked improvement in results, but there remains a lot of ambiguity to be taken care of. This faveolus history and background [22] of semantic parsing is not ending yet.

Types[edit]

Shallow Semantic Parsing[edit]

Main article: Semantic role labeling

Shallow semantic parsing is concerned with identifying entities in an utterance and labelling them with the roles they play. Shallow semantic parsing is sometimes known as slot-filling or frame semantic parsing, since its theoretical basis comes from frame semantics, wherein a word evokes a frame of related concepts and roles. Slot-filling systems are widely used in virtual assistants in conjunction with intent classifiers, which can be seen as mechanisms for identifying the frame evoked by an utterance.[23][24] Popular architectures for slot-filling are largely variants of an encoder-decoder model, wherein two recurrent neural networks (RNNs) are trained jointly to encode an utterance into a vector and to decode that vector into a sequence of slot labels.[25] This type of model is used in the Amazon Alexa spoken language understanding system.[23]. This parsing follow an unsupervised learning techniques.

Deep Semantic Parsing[edit]

Deep semantic parsing, also known as compositional semantic parsing, is concerned with producing precise meaning representations of utterances that can contain significant compositionality.[26] Shallow semantic parsers can parse utterances like "show me flights from Boston to Dallas" by classifying the intent as "list flights", and filling slots "source" and "destination" with "Boston" and "Dallas", respectively. However, shallow semantic parsing cannot parse arbitrary compositional utterances, like "show me flights from Boston to anywhere that has flights to Juneau". Deep semantic parsing attempts to parse such utterances, typically by converting them to a formal meaning representation language. Now a days, compositional semantic parsing are using into Large Language Model to solve artificial compositional generalization tasks such as SCAN [27] .

Representation languages[edit]

Early semantic parsers used highly domain-specific meaning representation languages,[28] with later systems using more extensible languages like Prolog,[29] lambda calculus,[30] lambda dependency-based compositional semantics (λ-DCS),[31] SQL,[32][33] Python,[34] Java,[35] the Alexa Meaning Representation Language,[23] and the Abstract Meaning Representation (AMR). Some work has used more exotic meaning representations, like query graphs,[36] semantic graphs,[37] or vector representations.[38]

Models[edit]

Most modern deep semantic parsing models are either based on defining a formal grammar for a chart parser or utilizing RNNs to directly translate from a natural language to a meaning representation language. Examples of systems built on formal grammars are the Cornell Semantic Parsing Framework,[39] Stanford University's Semantic Parsing with Execution (SEMPRE),[3] and the Word Alignment-based Semantic Parser (WASP).[40]

Datasets[edit]

Datasets used for training statistical semantic parsing models are divided into two main classes based on application: those used for question answering via knowledge base queries, and those used for code generation.

Question answering[edit]

Semantic Parsing for Conversational Question Answering

A standard dataset for question answering via semantic parsing is the Air Travel Information System (ATIS) dataset, which contains questions and commands about upcoming flights as well as corresponding SQL.[32] Another benchmark dataset is the GeoQuery dataset which contains questions about the geography of the U.S. paired with corresponding Prolog.[29] The Overnight dataset is used to test how well semantic parsers adapt across multiple domains; it contains natural language queries about 8 different domains paired with corresponding λ-DCS expressions.[41] Recently, semantic parsing is becoming so popular because of new research works and many large companies like Google, Microsoft, Amazon etc are working on this area. One on the resent work of Semantic Parsing for question answering is attached here [42]. In this picture it's a representation of an example conversations from SPICE. The left column shows dialogue turns (T1–T3) with user (U) and system (S) utterances. The middle column shows the annotations provided in CSQA. Blue boxes on the right show the sequence of actions (AS) and corresponding SPARQL semantic parses (SP).

Code generation[edit]

Popular datasets for code generation include two trading card datasets that link the text that appears on cards to code that precisely represents those cards. One was constructed linking Magic: The Gathering card texts to Java snippets; the other by linking Hearthstone card texts to Python snippets.[35] The IFTTT dataset[43] uses a specialized domain-specific language with short conditional commands. The Django dataset[44] pairs Python snippets with English and Japanese pseudocode describing them. The RoboCup dataset[45] pairs English rules with their representations in a domain-specific language that can be understood by virtual soccer-playing robots.


Evaluation[edit]

The performance of Semantic parsers is also measured using standard evaluation metrics as like syntactic parsing. This can be evaluated for the ratio of exact matches (percentage of sentences that were perfectly parsed), and precision, recall, and F1-score calculated based on the correct constituency or dependency assignments in the parse relative to that number in reference and/or hypothesis parses. The latter are also known as the PARSEVAL metrics.[46]


See also[edit]

References[edit]

  1. ^ a b Jia, Robin; Liang, Percy (2016-06-11). "Data Recombination for Neural Semantic Parsing". arXiv:1606.03622 [cs.CL].
  2. ^ Andreas, Jacob, Andreas Vlachos, and Stephen Clark. "Semantic parsing as machine translation." Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers). Vol. 2. 2013.
  3. ^ a b Berant, Jonathan, et al. "Semantic Parsing on Freebase from Question-Answer Pairs." EMNLP. Vol. 2. No. 5. 2013.
  4. ^ Poon, Hoifung, and Pedro Domingos. "Unsupervised ontology induction from text." Proceedings of the 48th annual meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 2010.
  5. ^ Kaliszyk, Cezary, Josef Urban, and Jiří Vyskočil. "Automating formalization by statistical and semantic parsing of mathematics." International Conference on Interactive Theorem Proving. Springer, Cham, 2017.
  6. ^ Rabinovich, Maxim; Stern, Mitchell; Klein, Dan (2017-04-25). "Abstract Syntax Networks for Code Generation and Semantic Parsing". arXiv:1704.07535 [cs.CL].
  7. ^ Yin, Pengcheng; Neubig, Graham (2017-04-05). "A Syntactic Neural Model for General-Purpose Code Generation". arXiv:1704.01696 [cs.CL].
  8. ^ Wilks, Y. and Fass, D. (1992) The Preference Semantics Family, In Computers and Mathematics with Applications, Volume 23, Issues 2-5, Pages 205-221.
  9. ^ Hoifung Poon, Pedro Domingos[https://aclanthology.org/D09-1001.pdf Unsupervised Semantic Parsing ], Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, 2009
  10. ^ Armeni, Iro, et al. "3d semantic parsing of large-scale indoor spaces." Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2016.
  11. ^ Qi, Charles R., et al. "Pointnet: Deep learning on point sets for 3d classification and segmentation." Proceedings of the IEEE conference on computer vision and pattern recognition. 2017.
  12. ^ M. F. Mridha1, Molla Rashied Hussein, Md. Musfiqur Rahaman and Jugal Krishna Das "A PROFICIENT AUTONOMOUS BANGLA SEMANTIC PARSER FOR NATURAL LANGUAGE PROCESSING." Proceedings of ARPN Journal of Engineering and Applied Sciences. Vol. 10. 2015.
  13. ^ Winograd, T et al. "Procedures as a Representation for Data in a Computer Program for Understanding Natural Language." Technical report, MASSACHUSETTS INST OF TECH CAMBRIDGE PROJECT MAC, 1971.
  14. ^ Warren, D. H. D. and Pereira, F. C. N. et al. "[https://aclanthology.org/J82-3002.pdf An efficient easily adaptable system for interpreting natural language queries]." Comput. Linguist., 8(3-4):110–122. 1982
  15. ^ Zelle, J. M. and Mooney, R. J et al. "[https://dspace.mit.edu/handle/1721.1/7095 Learning to parse database queries using inductive logic programming]." Proceedings of the national conference on artificial intelligence, pages 1050–1055, 1996.
  16. ^ Zettlemoyer and Collins, et al. "[https://homes.cs.washington.edu/~lsz/papers/zc-uai05.pdf Learning to map sentences to logical form: Structured classification with probabilistic categorial grammars]." Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, UAI’05, pages 658–666, 2005.
  17. ^ Kwiatkowski, T., Zettlemoyer, L., Goldwater, S., and Steedman, M. et al. "Inducing probabilistic ccg grammars from logical form with higher-order unification." Proceedings of the 2010 conference on empirical methods in natural language processing, pages 1223–1233, 2010.
  18. ^ Wah Wong, Y. and J. Mooney, R. et al. "Learning synchronous grammars for semantic parsing with lambda calculus." Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 960–967, 2007.
  19. ^ Dong, L. and Lapata, M. et al. "[https://arxiv.org/pdf/1601.01280.pdf Language to logical form with neural attention.]." Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 33–43, 2016.
  20. ^ Pengcheng Yin, Graham Neubig et al. "A Syntactic Neural Model for General-Purpose Code Generation." Proceedings of 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 440–450, 2017.
  21. ^ Shi, T., Tatwawadi, K., Chakrabarti, K., Mao, Y., Polozov, O., and Chen, W. et al. "A Incsql: Training incremental text-to-sql parsers with non-deterministic oracles." Published by Microsoft Research, 2018.
  22. ^ Pratik Joshi et al. "[https://pratikmjoshi.github.io/assets/thesis.pdf Semantic Parsing and its Applications in Natural Language Programming]." Published by BITS F421T Thesis, 2018.
  23. ^ a b c Kumar, Anjishnu, et al. "Just ASK: Building an Architecture for Extensible Self-Service Spoken Language Understanding." arXiv preprint arXiv:1711.00549 (2017).
  24. ^ Bapna, Ankur, et al. "Towards zero-shot frame semantic parsing for domain scaling." arXiv preprint arXiv:1707.02363(2017).
  25. ^ Liu, Bing, and Ian Lane. "Attention-based recurrent neural network models for joint intent detection and slot filling." arXiv preprint arXiv:1609.01454 (2016).
  26. ^ Liang, Percy, and Christopher Potts. "Bringing machine learning and compositional semantics together." Annu. Rev. Linguist. 1.1 (2015): 355-376.
  27. ^ Andrew Drozdov, Nathanael Schärli, Ekin Akyürek, Nathan Scales, Xinying Song, Xinyun Chen, Olivier Bousquet, Denny Zhou. [https://arxiv.org/pdf/2209.15003.pdf"COMPOSITIONAL SEMANTIC PARSING WITH LARGE LANGUAGE MODELS"] Cornell University,30 Sep 2022.
  28. ^ Woods, William A. Semantics for a question-answering system. Vol. 27. Garland Pub., 1979.
  29. ^ a b Zelle, John M., and Raymond J. Mooney. "Learning to parse database queries using inductive logic programming." Proceedings of the national conference on artificial intelligence. 1996.
  30. ^ Wong, Yuk Wah, and Raymond Mooney. "Learning synchronous grammars for semantic parsing with lambda calculus." Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics. 2007.
  31. ^ Liang, Percy. "Lambda dependency-based compositional semantics." arXiv preprint arXiv:1309.4408 (2013).
  32. ^ a b Hemphill, Charles T., John J. Godfrey, and George R. Doddington. "The ATIS spoken language systems pilot corpus." Speech and Natural Language: Proceedings of a Workshop Held at Hidden Valley, Pennsylvania, June 24–27, 1990. 1990.
  33. ^ Iyer, Srinivasan, et al. "Learning a neural semantic parser from user feedback." arXiv preprint arXiv:1704.08760 (2017).
  34. ^ Yin, Pengcheng, and Graham Neubig. "A syntactic neural model for general-purpose code generation." arXiv preprint arXiv:1704.01696 (2017).
  35. ^ a b Ling, Wang, et al. "Latent predictor networks for code generation." arXiv preprint arXiv:1603.06744 (2016).
  36. ^ Yih, Scott Wen-tau, et al. "Semantic parsing via staged query graph generation: Question answering with knowledge base." (2015).
  37. ^ Reddy, Siva, Mirella Lapata, and Mark Steedman. "Large-scale semantic parsing without question-answer pairs." Transactions of the Association of Computational Linguistics 2.1 (2014): 377-392.
  38. ^ Guu, Kelvin, John Miller, and Percy Liang. "Traversing knowledge graphs in vector space." arXiv preprint arXiv:1506.01094 (2015).
  39. ^ Artzi, Yoav. "Cornell SPF: Cornell semantic parsing framework." arXiv preprint arXiv:1311.3011 (2013).
  40. ^ Wong, Yuk Wah; Mooney, Raymond J. (2006-06-04). Learning for semantic parsing with statistical machine translation. Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics -. Association for Computational Linguistics. pp. 439–446. CiteSeerX 10.1.1.135.7209. doi:10.3115/1220835.1220891.
  41. ^ Wang, Yushi, Jonathan Berant, and Percy Liang. "Building a semantic parser overnight." Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). Vol. 1. 2015.
  42. ^ Laura Perez-Beltrachini, Parag Jain, Emilio Monti, Mirella Lapata. [https://arxiv.org/pdf/2301.12217.pdf Semantic Parsing for Conversational Question Answering over Knowledge Graphs] 'Proceedings on EACL 2023'. 28 January, 2023.
  43. ^ Quirk, Chris, Raymond Mooney, and Michel Galley. "Language to code: Learning semantic parsers for if-this-then-that recipes." Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). Vol. 1. 2015.
  44. ^ Oda, Yusuke, et al. "Learning to generate pseudo-code from source code using statistical machine translation (t)." Automated Software Engineering (ASE), 2015 30th IEEE/ACM International Conference on. IEEE, 2015.
  45. ^ Kuhlmann, Gregory, et al. "Guiding a reinforcement learner with natural language advice: Initial results in RoboCup soccer." The AAAI-2004 workshop on supervisory control of learning and adaptive systems. 2004.
  46. ^ Black, E.; Abney, S.; Flickenger, D.; Gdaniec, C.; Grishman, R.; Harrison, P.; Hindle, D.; Ingria, R.; Jelinek, F.; Klavans, J.; Liberman, M.; Marcus, M.; Roukos, S.; Santorini, B.; Strzalkowski, T. (1991). A Procedure for Quantitatively Comparing the Syntactic Coverage of English Grammars. Speech and Natural Language: Proceedings of a Workshop Held at Pacific Grove, California, February 19-22, 1991.
Retrieved from "https://en.wikipedia.org/w/index.php?title=User:AyeshaBD/Semantic_parsing&oldid=1185364635"