{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:20:55Z","timestamp":1743078055356,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624068"},{"type":"electronic","value":"9783319624075"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62407-5_18","type":"book-chapter","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T11:16:58Z","timestamp":1500031018000},"page":"262-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Representing Contexual Relations with Sanskrit Word Embeddings"],"prefix":"10.1007","author":[{"given":"Ishank","family":"Sharma","sequence":"first","affiliation":[]},{"given":"Shrey","family":"Anand","sequence":"additional","affiliation":[]},{"given":"Rinkaj","family":"Goyal","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,15]]},"reference":[{"key":"18_CR1","unstructured":"Begum, R., Husain, S., Dhwaj, A., Sharma, D.M., Bai, L., Sangal, R.: Dependency annotation scheme for Indian languages. In: IJCNLP, pp. 721\u2013726 (2008)"},{"key":"18_CR2","unstructured":"Bengio, Y., Ducharme, R., Vincent, P., Jauvin, C.: A neural probabilistic language model. J. Mach. Learn. Res. 3(Feb), 1137\u20131155 (2003)"},{"key":"18_CR3","unstructured":"Bharati, A., Chaitanya, V., Sangal, R., Ramakrishnamacharyulu, K.: Natural Language Processing: A Paninian Perspective. Prentice Hall of India Pvt. Ltd., New Delhi (1995)"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/aris.1440370103","volume":"37","author":"GG Chowdhury","year":"2003","unstructured":"Chowdhury, G.G.: Natural language processing. Ann. Rev. Inf. Sci. Technol. 37(1), 51\u201389 (2003)","journal-title":"Ann. Rev. Inf. Sci. Technol."},{"key":"18_CR5","first-page":"32","volume":"1","author":"DL Donoho","year":"2000","unstructured":"Donoho, D.L., et al.: High-dimensional data analysis: the curses and blessings of dimensionality. AMS Math Challenges Lect. 1, 32 (2000)","journal-title":"AMS Math Challenges Lect."},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1207\/s15516709cog1402_1","volume":"14","author":"JL Elman","year":"1990","unstructured":"Elman, J.L.: Finding structure in time. Cogn. Sci. 14(2), 179\u2013211 (1990)","journal-title":"Cogn. Sci."},{"key":"18_CR7","unstructured":"Goldberg, Y., Levy, O.: word2vec explained: deriving Mikolov et al.\u2019s negative-sampling word-embedding method. arXiv preprint arXiv:1402.3722 (2014)"},{"key":"18_CR8","unstructured":"Goyal, P., Huet, G.P., Kulkarni, A.P., Scharf, P.M., Bunker, R.: A distributed platform for Sanskrit processing. In: COLING, pp. 1011\u20131028 (2012)"},{"key":"18_CR9","unstructured":"Hellwig, O.: Detecting sentence boundaries in Sanskrit texts. In: Proceedings of COLING (2016)"},{"key":"18_CR10","first-page":"142","volume":"2016","author":"O Hellwig","year":"2016","unstructured":"Hellwig, O.: Improving the morphological analysis of classical Sanskrit. WSSANLP 2016, 142 (2016)","journal-title":"WSSANLP"},{"key":"18_CR11","unstructured":"Huet, G.: Towards computational processing of sanskrit. In: International Conference on Natural Language Processing (ICON). Citeseer (2003)"},{"issue":"8","key":"18_CR12","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0888-613X(87)90007-7","volume":"1","author":"SC Kak","year":"1987","unstructured":"Kak, S.C.: The paninian approach to natural language processing. Int. J. Approx. Reason. 1(1), 117\u2013130 (1987)","journal-title":"Int. J. Approx. Reason."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Kashyap, L., Joshi, S.R., Bhattacharyya, P.: Insights on Hindi Wordnet coming from the IndoWordNet. In: Dash, N.S. et al. (eds.) The WordNet in Indian Languages, pp. 19\u201344. Springer, Heidelberg (2017)","DOI":"10.1007\/978-981-10-1909-8_2"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1088\/0964-1726\/13\/1\/025","volume":"13","author":"G Kerschen","year":"2003","unstructured":"Kerschen, G., Golinval, J.C.: Feature extraction using auto-associative neural networks. Smart Mater. Struct. 13(1), 211 (2003)","journal-title":"Smart Mater. Struct."},{"key":"18_CR16","unstructured":"Krishna, A., Santra, B., Satuluri, P., Bandaru, S.P., Faldu, B., Singh, Y., Goyal, P.: Word segmentation in Sanskrit using path constrained random walks. In: Proceedings of COLING (2016)"},{"key":"18_CR17","first-page":"1","volume":"2016","author":"A Krishna","year":"2016","unstructured":"Krishna, A., Satuluri, P., Sharma, S., Kumar, A., Goyal, P.: Compound type identification in sanskrit: what roles do the corpus and grammar play? WSSANLP 2016, 1 (2016)","journal-title":"WSSANLP"},{"key":"18_CR18","unstructured":"van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(Nov), 2579\u20132605 (2008)"},{"key":"18_CR19","unstructured":"Manning, C.D., Sch\u00fctze, H., et al.: Foundations of Statistical Natural Language Processing, vol. 999. MIT Press, Cambridge (1999)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Mikolov, T., Kopecky, J., Burget, L., Glembek, O., et al.: Neural network based language models for highly inflective languages. In: IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2009, pp. 4725\u20134728. IEEE (2009)","DOI":"10.1109\/ICASSP.2009.4960686"},{"key":"18_CR21","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp. 3111\u20133119 (2013)"},{"key":"18_CR22","unstructured":"Mikolov, T., Yih, W.T., Zweig, G.: Linguistic regularities in continuous space word representations. In: Hlt-naacl, vol. 13, pp. 746\u2013751 (2013)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-93885-9_4","volume-title":"Sanskrit Computational Linguistics","author":"A Mishra","year":"2008","unstructured":"Mishra, A.: Modelling the grammatical circle of the p\u0101n\u0323inian system of Sanskrit grammar. In: Kulkarni, A., Huet, G. (eds.) ISCLS 2009. LNCS, vol. 5406, pp. 40\u201355. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-93885-9_4"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.csl.2016.06.002","volume":"41","author":"D Nandi","year":"2017","unstructured":"Nandi, D., Pati, D., Rao, K.S.: Implicit processing of LP residual for language identification. Comput. Speech Lang. 41, 68\u201387 (2017)","journal-title":"Comput. Speech Lang."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.procs.2016.08.114","volume":"96","author":"RK Pandey","year":"2016","unstructured":"Pandey, R.K., Jha, G.N.: Error analysis of sahit-a statistical Sanskrit-Hindi translator. Procedia Comput. Sci. 96, 495\u2013501 (2016)","journal-title":"Procedia Comput. Sci."},{"key":"18_CR26","unstructured":"Staal, J.: Sanskrit philosophy of language. In: History of Linguistic Thought and Contemporary Linguistics, pp. 102\u2013136 (1976)"},{"issue":"1","key":"18_CR27","first-page":"3221","volume":"15","author":"L Van Der Maaten","year":"2014","unstructured":"Van Der Maaten, L.: Accelerating t-SNE using tree-based algorithms. J. Mach. Learn. Res. 15(1), 3221\u20133245 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"18_CR28","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/j.patrec.2008.02.014","volume":"29","author":"KR \u017dalik","year":"2008","unstructured":"\u017dalik, K.R.: An efficient k-means clustering algorithm. Pattern Recogn. Lett. 29(9), 1385\u20131391 (2008)","journal-title":"Pattern Recogn. Lett."},{"key":"18_CR29","first-page":"1561","volume":"19","author":"R Zass","year":"2007","unstructured":"Zass, R., Shashua, A.: Nonnegative sparse PCA. Adv. Neural Inf. Process. Syst. 19, 1561 (2007)","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62407-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:04:54Z","timestamp":1710266694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62407-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319624068","9783319624075"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62407-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"15 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}