{"title":"基于加权有限状态传感器的专有名词识别与分类","authors":"Jörg Didakowski, Marko Drotschmann","doi":"10.3233/978-1-58603-975-2-50","DOIUrl":null,"url":null,"abstract":"This paper presents a new approach to proper noun recognition and classification in which the knowledge of ambiguities within morphological analyses is used exhaustively in the analysis. Here a proper noun recognizer/classifier is defined by proper noun context patterns on the one hand and by a filter that takes the ambiguity information into account on the other hand. Furthermore, techniques like a lemma based coreference resolution or the softening of the closed world assumption made by the morphology are presented which improve the analysis. The approach is implemented by weighted finite state transducers and tested within the analysis system SynCoP via a hand-written grammar.","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Proper Noun Recognition and Classification Using Weighted Finite State Transducers\",\"authors\":\"Jörg Didakowski, Marko Drotschmann\",\"doi\":\"10.3233/978-1-58603-975-2-50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new approach to proper noun recognition and classification in which the knowledge of ambiguities within morphological analyses is used exhaustively in the analysis. Here a proper noun recognizer/classifier is defined by proper noun context patterns on the one hand and by a filter that takes the ambiguity information into account on the other hand. Furthermore, techniques like a lemma based coreference resolution or the softening of the closed world assumption made by the morphology are presented which improve the analysis. The approach is implemented by weighted finite state transducers and tested within the analysis system SynCoP via a hand-written grammar.\",\"PeriodicalId\":286427,\"journal\":{\"name\":\"Finite-State Methods and Natural Language Processing\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite-State Methods and Natural Language Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/978-1-58603-975-2-50\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite-State Methods and Natural Language Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-58603-975-2-50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Proper Noun Recognition and Classification Using Weighted Finite State Transducers
This paper presents a new approach to proper noun recognition and classification in which the knowledge of ambiguities within morphological analyses is used exhaustively in the analysis. Here a proper noun recognizer/classifier is defined by proper noun context patterns on the one hand and by a filter that takes the ambiguity information into account on the other hand. Furthermore, techniques like a lemma based coreference resolution or the softening of the closed world assumption made by the morphology are presented which improve the analysis. The approach is implemented by weighted finite state transducers and tested within the analysis system SynCoP via a hand-written grammar.