发布求助
文献互助 智能选刊 最新文献

Finite-State Methods and Natural Language Processing最新文献

筛选
英文 中文
Selected Operations and Applications of n-Tape Weighted Finite-State Machines n带加权有限状态机的选择运算和应用
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-21 DOI: 10.1007/978-3-642-14684-8_4
André Kempe
{"title":"Selected Operations and Applications of n-Tape Weighted Finite-State Machines","authors":"André Kempe","doi":"10.1007/978-3-642-14684-8_4","DOIUrl":"https://doi.org/10.1007/978-3-642-14684-8_4","url":null,"abstract":"","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126531323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Joining Composition and Trimming of Finite-State Transducers 有限状态换能器的连接、组成和修整
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-21 DOI: 10.1007/978-3-642-14684-8_10
Johannes Bubenzer, Kay-Michael Würzner
{"title":"Joining Composition and Trimming of Finite-State Transducers","authors":"Johannes Bubenzer, Kay-Michael Würzner","doi":"10.1007/978-3-642-14684-8_10","DOIUrl":"https://doi.org/10.1007/978-3-642-14684-8_10","url":null,"abstract":"","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Compositions of Top-Down Tree Transducers with epsilon-Rules 具有ε -规则的自顶向下树形换能器的组成
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-21 DOI: 10.1007/978-3-642-14684-8_8
A. Maletti, H. Vogler
{"title":"Compositions of Top-Down Tree Transducers with epsilon-Rules","authors":"A. Maletti, H. Vogler","doi":"10.1007/978-3-642-14684-8_8","DOIUrl":"https://doi.org/10.1007/978-3-642-14684-8_8","url":null,"abstract":"","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115577717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Describing Georgian Morphology with a Finite-State System 用有限状态系统描述格鲁吉亚形态学
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-21 DOI: 10.1007/978-3-642-14684-8_12
Oleg Kapanadze
{"title":"Describing Georgian Morphology with a Finite-State System","authors":"Oleg Kapanadze","doi":"10.1007/978-3-642-14684-8_12","DOIUrl":"https://doi.org/10.1007/978-3-642-14684-8_12","url":null,"abstract":"","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122022737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Morphological Analysis of Tone Marked Kinyarwanda Text 声调标记的卢旺达语文本形态分析
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-21 DOI: 10.1007/978-3-642-14684-8_6
Jackson Muhirwe
{"title":"Morphological Analysis of Tone Marked Kinyarwanda Text","authors":"Jackson Muhirwe","doi":"10.1007/978-3-642-14684-8_6","DOIUrl":"https://doi.org/10.1007/978-3-642-14684-8_6","url":null,"abstract":"","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121354766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Reducing Nondeterministic Finite Automata with SAT Solvers 用SAT求解器简化不确定性有限自动机
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-21 DOI: 10.1007/978-3-642-14684-8_9
J. Geldenhuys, Brink van der Merwe, L. V. Zijl
{"title":"Reducing Nondeterministic Finite Automata with SAT Solvers","authors":"J. Geldenhuys, Brink van der Merwe, L. V. Zijl","doi":"10.1007/978-3-642-14684-8_9","DOIUrl":"https://doi.org/10.1007/978-3-642-14684-8_9","url":null,"abstract":"","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122329337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Proper Noun Recognition and Classification Using Weighted Finite State Transducers 基于加权有限状态传感器的专有名词识别与分类
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-11 DOI: 10.3233/978-1-58603-975-2-50
Jörg Didakowski, Marko Drotschmann
{"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":"https://doi.org/10.3233/978-1-58603-975-2-50","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.0,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121726742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Morphisto - An Open Source Morphological Analyzer for German Morphisto -一个开源的德语词法分析器
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-11 DOI: 10.3233/978-1-58603-975-2-224
Andrea Zielinski, Christian Simon
{"title":"Morphisto - An Open Source Morphological Analyzer for German","authors":"Andrea Zielinski, Christian Simon","doi":"10.3233/978-1-58603-975-2-224","DOIUrl":"https://doi.org/10.3233/978-1-58603-975-2-224","url":null,"abstract":"This paper presents the development of an open-source morphology tool for German integrated into a grid-based environment. Departing from the SFST-based SMOR tools (Schmid et al. [1]), we have implemented a minimal lexicon component that works in tandem with the morphological tool. Tests on a list of 30,000 high-frequency German words show that the recognition rate is comparable to other systems with even larger lexicons. Additional tools for the management of lexical data and services built on top of the finite-state transducer are also integrated as web services in the grid, so that all resources can be shared easily among lexicographers, linguists, and finite-state developers.","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115936344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 45
The Kleene Language for Weighted Finite-State Programming 加权有限状态规划的Kleene语言
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-11 DOI: 10.3233/978-1-58603-975-2-27
K. R. Beesley
{"title":"The Kleene Language for Weighted Finite-State Programming","authors":"K. R. Beesley","doi":"10.3233/978-1-58603-975-2-27","DOIUrl":"https://doi.org/10.3233/978-1-58603-975-2-27","url":null,"abstract":"Kleene is a high-level programming language for building, manipulating and testing weighted finite-state acceptors and transducers. It allows users to define networks using regular expressions and right-linear phrase-structure grammars, and it provides variables, functions and familiar control structures. Pre-edited Kleene scripts can be run from the command line, and a graphical user interface is provided for interactive programming and testing. The Kleene parser is implemented in JavaCC/JJTree, and the interpreter calls functions in the OpenFst library via the Java Native Interface (JNI). The design, implementation, development status and future plans for Kleene are described.","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"351 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Applying Finite State Morphology to Conversion Between Roman and Perso-Arabic Writing Systems 有限态形态学在罗马与波斯语文字系统转换中的应用
Finite-State Methods and Natural Language Processing Pub Date : 2009-07-11 DOI: 10.3233/978-1-58603-975-2-215
J. Maleki, Maziar Yaesoubi, Lars Ahrenberg
{"title":"Applying Finite State Morphology to Conversion Between Roman and Perso-Arabic Writing Systems","authors":"J. Maleki, Maziar Yaesoubi, Lars Ahrenberg","doi":"10.3233/978-1-58603-975-2-215","DOIUrl":"https://doi.org/10.3233/978-1-58603-975-2-215","url":null,"abstract":"This paper presents a method for converting back and forth between the Perso-Arabic and a romanized writing system for Persian. Given a word in one writing system, we use finite state transducers to generate morphological analysis for the word that is subsequently used to regenerate the orthography of the word in the other writing system. The system has been implemented in XFST and LEXC.","PeriodicalId":286427,"journal":{"name":"Finite-State Methods and Natural Language Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125198808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信