@techreport{
 title = {Deep-BGT at PARSEME Shared Task 2018: Bidirectional LSTM-CRF Model for Verbal Multiword Expression Identification},
 type = {techreport},
 pages = {248-253},
 websites = {http://multiword.sourceforge.net/PHITE.php?sitesig=CONF&page=CONF_04_LAW-MWE-CxG_},
 id = {314b932d-9cfc-34a8-803d-8ad58e4b57e1},
 created = {2019-10-12T16:27:04.770Z},
 accessed = {2019-10-12},
 file_attached = {true},
 profile_id = {1971c810-6732-3a00-9f6b-d217e1a53071},
 group_id = {cbcfbfec-195f-3b99-b6a1-d26e1dd80ff5},
 last_modified = {2019-10-12T16:27:04.851Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {This paper describes the Deep-BGT system that participated to the PARSEME shared task 2018 on automatic identification of verbal multiword expressions (VMWEs). Our system is language-independent and uses the bidirectional Long Short-Term Memory model with a Conditional Random Field layer on top (bidirectional LSTM-CRF). To the best of our knowledge, this paper is the first one that employs the bidirectional LSTM-CRF model for VMWE identification. Furthermore , the gappy 1-level tagging scheme is used for discontiguity and overlaps. Our system was evaluated on 10 languages in the open track and it was ranked the second in terms of the general ranking metric.},
 bibtype = {techreport},
 author = {Berk, Gözde and Erden, Berna and Ungör, Tunga G ¨}
}

{"_id":"9ppQwX6TQdo5H8kMC","bibbaseid":"berk-erden-ungr-deepbgtatparsemesharedtask2018bidirectionallstmcrfmodelforverbalmultiwordexpressionidentification","authorIDs":[],"author_short":["Berk, G.","Erden, B.","Ungör, T., G., ¨."],"bibdata":{"title":"Deep-BGT at PARSEME Shared Task 2018: Bidirectional LSTM-CRF Model for Verbal Multiword Expression Identification","type":"techreport","pages":"248-253","websites":"http://multiword.sourceforge.net/PHITE.php?sitesig=CONF&page=CONF_04_LAW-MWE-CxG_","id":"314b932d-9cfc-34a8-803d-8ad58e4b57e1","created":"2019-10-12T16:27:04.770Z","accessed":"2019-10-12","file_attached":"true","profile_id":"1971c810-6732-3a00-9f6b-d217e1a53071","group_id":"cbcfbfec-195f-3b99-b6a1-d26e1dd80ff5","last_modified":"2019-10-12T16:27:04.851Z","read":false,"starred":false,"authored":false,"confirmed":false,"hidden":false,"private_publication":false,"abstract":"This paper describes the Deep-BGT system that participated to the PARSEME shared task 2018 on automatic identification of verbal multiword expressions (VMWEs). Our system is language-independent and uses the bidirectional Long Short-Term Memory model with a Conditional Random Field layer on top (bidirectional LSTM-CRF). To the best of our knowledge, this paper is the first one that employs the bidirectional LSTM-CRF model for VMWE identification. Furthermore , the gappy 1-level tagging scheme is used for discontiguity and overlaps. Our system was evaluated on 10 languages in the open track and it was ranked the second in terms of the general ranking metric.","bibtype":"techreport","author":"Berk, Gözde and Erden, Berna and Ungör, Tunga G ¨","bibtex":"@techreport{\n title = {Deep-BGT at PARSEME Shared Task 2018: Bidirectional LSTM-CRF Model for Verbal Multiword Expression Identification},\n type = {techreport},\n pages = {248-253},\n websites = {http://multiword.sourceforge.net/PHITE.php?sitesig=CONF&page=CONF_04_LAW-MWE-CxG_},\n id = {314b932d-9cfc-34a8-803d-8ad58e4b57e1},\n created = {2019-10-12T16:27:04.770Z},\n accessed = {2019-10-12},\n file_attached = {true},\n profile_id = {1971c810-6732-3a00-9f6b-d217e1a53071},\n group_id = {cbcfbfec-195f-3b99-b6a1-d26e1dd80ff5},\n last_modified = {2019-10-12T16:27:04.851Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {This paper describes the Deep-BGT system that participated to the PARSEME shared task 2018 on automatic identification of verbal multiword expressions (VMWEs). Our system is language-independent and uses the bidirectional Long Short-Term Memory model with a Conditional Random Field layer on top (bidirectional LSTM-CRF). To the best of our knowledge, this paper is the first one that employs the bidirectional LSTM-CRF model for VMWE identification. Furthermore , the gappy 1-level tagging scheme is used for discontiguity and overlaps. Our system was evaluated on 10 languages in the open track and it was ranked the second in terms of the general ranking metric.},\n bibtype = {techreport},\n author = {Berk, Gözde and Erden, Berna and Ungör, Tunga G ¨}\n}","author_short":["Berk, G.","Erden, B.","Ungör, T., G., ¨."],"urls":{"Paper":"https://bibbase.org/service/mendeley/1971c810-6732-3a00-9f6b-d217e1a53071/file/6badabf1-d3a7-4ddf-2d63-5c715bbccce9/full_text.pdf.pdf","Website":"http://multiword.sourceforge.net/PHITE.php?sitesig=CONF&page=CONF_04_LAW-MWE-CxG_"},"bibbaseid":"berk-erden-ungr-deepbgtatparsemesharedtask2018bidirectionallstmcrfmodelforverbalmultiwordexpressionidentification","role":"author","downloads":0},"bibtype":"techreport","creationDate":"2019-10-25T20:27:35.187Z","downloads":0,"keywords":[],"search_terms":["deep","bgt","parseme","shared","task","2018","bidirectional","lstm","crf","model","verbal","multiword","expression","identification","berk","erden","ungör"],"title":"Deep-BGT at PARSEME Shared Task 2018: Bidirectional LSTM-CRF Model for Verbal Multiword Expression Identification","year":null}