{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:39:05Z","timestamp":1743154745818,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030821982"},{"type":"electronic","value":"9783030821999"}],"license":[{"start":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T00:00:00Z","timestamp":1628294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T00:00:00Z","timestamp":1628294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-82199-9_1","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T09:02:45Z","timestamp":1636534965000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LexDivPara: A Measure of Paraphrase Quality with Integrated Sentential Lexical Complexity"],"prefix":"10.1007","author":[{"given":"Thanh","family":"Thieu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ha","family":"Do","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi","family":"Pu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathyanarayanan","family":"Aakur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saad","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alfter, D., Volodina, E.: Towards single word lexical complexity prediction. In: Proceedings of the Thirteenth Workshop on Innovative Use of NLP for Building Educational Applications, New Orleans, Louisiana, pp. 79\u201388. Association for Computational Linguistics (2018)","DOI":"10.18653\/v1\/W18-0508"},{"key":"1_CR2","unstructured":"Diego Antognini. Py-rouge (2018)"},{"key":"1_CR3","volume-title":"Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit","author":"S Bird","year":"2009","unstructured":"Bird, S., Klein, E., Loper, E.: Natural Language Processing with Python: Analyzing Text with the Natural Language Toolkit. O\u2019Reilly Media, Inc., Newton (2009)"},{"key":"1_CR4","unstructured":"Burges, C.J.C., Svore, K.M., Wu, Q., Gao, J.: Ranking, boosting, and model adaptation (2008)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Cer, D., Diab, M., Agirre, E., Lopez-Gazpio, I., Specia, L.: SemEval-2017 Task 1: semantic textual similarity multilingual and crosslingual focused evaluation, Vancouver, Canada, pp. 1\u201314. Association for Computational Linguistics (2017)","DOI":"10.18653\/v1\/S17-2001"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cer, D., et al.: Universal sentence encoder for English. In: 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, Brussels, Belgium, pp. 169\u2013174. Association for Computational Linguistics (2018)","DOI":"10.18653\/v1\/D18-2029"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: A Scalable Tree Boosting System (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Hu, J.E., Rudinger, R., Post, M., Van Durme, B.: ParaBank: monolingual bitext generation and sentential paraphrasing via lexically-constrained neural machine translation. In: AAAI 2019, Honolulu, Hawaii (2019)","DOI":"10.1609\/aaai.v33i01.33016521"},{"key":"1_CR9","unstructured":"Ganitkevitch, J., Van Durme, B., Callison-Burch, C.: PPDB: the paraphrase database, pp. 758\u2013764. Association for Computational Linguistics (2013)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Hu, J.E., et al.: Improved lexically constrained decoding for translation and monolingual rewriting. In: NAACL 2019, Minneapolis, Minnesota (2019)","DOI":"10.18653\/v1\/N19-1090"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Hu, J.E., Singh, A., Holzenberger, N., Post, M., Van Durme, B.: Large-scale, diverse, paraphrastic bitexts via sampling and clustering. In: Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL), Hong Kong, China, pp. 44\u201354. Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/K19-1005"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Iyyer, M., Manjunatha, V., Boyd-Graber, J., Daum\u00c8 III, H.: Deep unordered composition rivals syntactic methods for text classification. In: Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing, vol. 1: Long Papers), Beijing, China, pp. 1681\u20131691. Association for Computational Linguistics (2015)","DOI":"10.3115\/v1\/P15-1162"},{"key":"1_CR13","first-page":"61","volume":"53","author":"V Johansson","year":"2009","unstructured":"Johansson, V.: Lexical diversity and lexical density in speech and writing: a developmental perspective. Lund Work. Papers Linguist. 53, 61\u201379 (2009)","journal-title":"Lund Work. Papers Linguist."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Kriz, R., Miltsakaki, E., Apidianaki, M., Callison-Burch, C.: Simplification using paraphrases and context-based lexical substitution. In: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, vol. 1 (Long Papers), New Orleans, Louisiana, pp. 207\u2013217. Association for Computational Linguistics (2018)","DOI":"10.18653\/v1\/N18-1019"},{"key":"1_CR15","unstructured":"Lin, C.Y.: ROUGE: a package for automatic evaluation of summaries. In: Text Summarization Branches Out, Barcelona, Spain, pp. 74\u201381. Association for Computational Linguistics (2004)"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1111\/j.1540-4781.2011.01232_1.x","volume":"96","author":"L Xiaofei","year":"2012","unstructured":"Xiaofei, L.: The relationship of lexical richness to the quality of ESL learners\u2019 oral narratives. Mod. Lang. J. 96(2), 190\u2013208 (2012)","journal-title":"Mod. Lang. J."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Maddela, M., Xu, W.: A word-complexity lexicon and a neural readability ranking model for lexical simplification. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, pp. 3749\u20133760. Association for Computational Linguistics (2018)","DOI":"10.18653\/v1\/D18-1410"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Manning, C., Surdeanu, M., Bauer, J., Finkel, J., Bethard, S., McClosky, D.: The stanford CoreNLP natural language processing toolkit, pp. 55\u201360. Association for Computational Linguistics (2014)","DOI":"10.3115\/v1\/P14-5010"},{"key":"1_CR19","volume-title":"Levenshtein Distance: Information theory, Computer science, String (computer science), String metric, Damerau?Levenshtein distance, Spell checker, Hamming distance","author":"FP Miller","year":"2009","unstructured":"Miller, F.P., Vandome, A.F., McBrewster, J.: Levenshtein Distance: Information theory, Computer science, String (computer science), String metric, Damerau?Levenshtein distance, Spell checker, Hamming distance. Alpha Press, Orlando (2009)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Papineni, K., Roukos, S., Ward, T., Zhu, W.J.: Bleu: a method for automatic evaluation of machine translation. In: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, Philadelphia, Pennsylvania, USA, pap. 311\u2013318. Association for Computational Linguistics (2002)","DOI":"10.3115\/1073083.1073135"},{"key":"1_CR21","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511732942","volume-title":"Assessing Vocabulary","author":"J Read","year":"2000","unstructured":"Read, J.: Assessing Vocabulary. Cambridge University Press, Cambridge (2000)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Sakaguchi, K., Van Durme, B.: Efficient online scalar annotation with bounded support, Melbourne, Australia, pp. 208\u2013218. Association for Computational Linguistics (2018)","DOI":"10.18653\/v1\/P18-1020"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Wieting, J., Gimpel, K.: ParaNMT-50M: pushing the limits of paraphrastic sentence embeddings with millions of machine translations, pp. 451\u2013462. Association for Computational Linguistics (2018)","DOI":"10.18653\/v1\/P18-1042"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-12027-0_11","volume-title":"Advances in Artificial Intelligence \u2013 IBERAMIA 2014","author":"R Wilkens","year":"2014","unstructured":"Wilkens, R., Vecchia, A.D., Boito, M.Z., Padr\u00f3, M., Villavicencio, A.: Size does not matter. frequency does. a study of features for measuring lexical complexity. In: Bazzan, A.L.C., Pichara, K. (eds.) IBERAMIA 2014. LNCS (LNAI), vol. 8864, pp. 129\u2013140. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12027-0_11"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Yang, Y., et al.: Multilingual universal sentence encoder for semantic retrieval, pp. 87\u201394 (2019)","DOI":"10.18653\/v1\/2020.acl-demos.12"},{"issue":"6","key":"1_CR27","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82199-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T09:04:27Z","timestamp":1636535067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82199-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,7]]},"ISBN":["9783030821982","9783030821999"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82199-9_1","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021,8,7]]},"assertion":[{"value":"7 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IntelliSys","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Proceedings of SAI Intelligent Systems Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"intellisys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/saiconference.com\/IntelliSys","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}