{"title":"使用特征模板和束搜索策略的印度尼西亚移位-减少选区解析器","authors":"Robert Sebastian Herlim, A. Purwarianti","doi":"10.1109/ICAICTA.2018.8541292","DOIUrl":null,"url":null,"abstract":"In natural language processing, the syntactic analysis process (such as constituency parsing) is required to understand word context in the sentence. We propose a modification on using binarization technique alternative and feature multiplication factors for shift-reduce constituency parser using beam search approach and structured learning algorithm. Our modification in binarization technique is inspired from assorted tagging schemes in NER, while the feature multiplication factors is used to scale up our scoring system for beam search algorithm. For evaluation, we mainly used the new INACL Treebank (consisting 11,356 and 4,457 instances for training and test set), resulted 50.3% in f1-score. Our parser also compared with previous work by using the same training and test set for IDN-Treebank, resulted 74.0% in f1-score.","PeriodicalId":184882,"journal":{"name":"2018 5th International Conference on Advanced Informatics: Concept Theory and Applications (ICAICTA)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Indonesian Shift-Reduce Constituency Parser Using Feature Templates & Beam Search Strategy\",\"authors\":\"Robert Sebastian Herlim, A. Purwarianti\",\"doi\":\"10.1109/ICAICTA.2018.8541292\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In natural language processing, the syntactic analysis process (such as constituency parsing) is required to understand word context in the sentence. We propose a modification on using binarization technique alternative and feature multiplication factors for shift-reduce constituency parser using beam search approach and structured learning algorithm. Our modification in binarization technique is inspired from assorted tagging schemes in NER, while the feature multiplication factors is used to scale up our scoring system for beam search algorithm. For evaluation, we mainly used the new INACL Treebank (consisting 11,356 and 4,457 instances for training and test set), resulted 50.3% in f1-score. Our parser also compared with previous work by using the same training and test set for IDN-Treebank, resulted 74.0% in f1-score.\",\"PeriodicalId\":184882,\"journal\":{\"name\":\"2018 5th International Conference on Advanced Informatics: Concept Theory and Applications (ICAICTA)\",\"volume\":\"117 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 5th International Conference on Advanced Informatics: Concept Theory and Applications (ICAICTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAICTA.2018.8541292\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Advanced Informatics: Concept Theory and Applications (ICAICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICTA.2018.8541292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Indonesian Shift-Reduce Constituency Parser Using Feature Templates & Beam Search Strategy
In natural language processing, the syntactic analysis process (such as constituency parsing) is required to understand word context in the sentence. We propose a modification on using binarization technique alternative and feature multiplication factors for shift-reduce constituency parser using beam search approach and structured learning algorithm. Our modification in binarization technique is inspired from assorted tagging schemes in NER, while the feature multiplication factors is used to scale up our scoring system for beam search algorithm. For evaluation, we mainly used the new INACL Treebank (consisting 11,356 and 4,457 instances for training and test set), resulted 50.3% in f1-score. Our parser also compared with previous work by using the same training and test set for IDN-Treebank, resulted 74.0% in f1-score.