串联(数学)
计算机科学
解析
结构化
信息抽取
自然语言处理
群众
分解
人工智能
自然语言
主题(文档)
情报检索
万维网
算术
数学
生态学
哲学
财务
认识论
经济
生物
作者
Peter Parapatics,Michael Dittenbach
标识
DOI:10.1145/1651343.1651351
摘要
In several application domains research in natural language processing and information extraction has spawned valuable tools that support humans in structuring, aggregating and managing large amounts of information available as text. Patent claims, although subject to a number of rigid constraints and therefore forced into foreseeable structures, are written in a language even good parsing algorithms tend to fail miserably at. This is primarily caused by long and complex sentences that are a concatenation of a multitude of descriptive elements. We present an approach to split patent claims into several parts in order to improve parsing performance for further automatic processing.
科研通智能强力驱动
Strongly Powered by AbleSci AI