咨询与建议

限定检索结果

文献类型

  • 29 册 图书
  • 15 篇 期刊文献
  • 15 篇 会议

馆藏范围

  • 59 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 28 篇 工学
    • 20 篇 计算机科学与技术...
    • 12 篇 软件工程
    • 3 篇 电气工程
    • 2 篇 机械工程
    • 1 篇 控制科学与工程
    • 1 篇 土木工程
    • 1 篇 航空宇航科学与技...
  • 7 篇 理学
    • 6 篇 数学
    • 1 篇 生物学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 59 篇 parsing algorith...
  • 29 篇 nasa technical r...
  • 29 篇 (ntrs)
  • 9 篇 software enginee...
  • 8 篇 parsing
  • 8 篇 computer program...
  • 8 篇 semantics
  • 7 篇 analysis
  • 7 篇 grammars
  • 7 篇 syntax
  • 6 篇 applications pro...
  • 6 篇 natural language...
  • 6 篇 reports
  • 6 篇 context-free gra...
  • 6 篇 natural language...
  • 5 篇 computer program...
  • 4 篇 algorithms
  • 4 篇 expert systems
  • 4 篇 language
  • 4 篇 artificial intel...

机构

  • 2 篇 univ groningen f...
  • 2 篇 univ padua dept ...
  • 2 篇 swansea univ com...
  • 1 篇 jst erato doi bi...
  • 1 篇 department of st...
  • 1 篇 university of wi...
  • 1 篇 politecn milan d...
  • 1 篇 computer science...
  • 1 篇 nanjing univ sta...
  • 1 篇 univ laquila dis...
  • 1 篇 adobe research
  • 1 篇 exprivia spa via...
  • 1 篇 makerere univ de...
  • 1 篇 int islamic univ...
  • 1 篇 cebib - center o...
  • 1 篇 cnr icar natl re...
  • 1 篇 department of st...
  • 1 篇 hohai univ comp ...
  • 1 篇 cheriton school ...
  • 1 篇 department of co...

作者

  • 2 篇 jones alison
  • 2 篇 berger ulrich
  • 2 篇 seisenberger mon...
  • 2 篇 satta giorgio
  • 1 篇 zou xuemei
  • 1 篇 marzi francesca
  • 1 篇 satta g
  • 1 篇 demin dimitry
  • 1 篇 zou yang
  • 1 篇 turaev sherzod
  • 1 篇 messikh azeddine
  • 1 篇 aronica salvator...
  • 1 篇 nederhof mj
  • 1 篇 zhu hua
  • 1 篇 meixun jin
  • 1 篇 brandon m. smith
  • 1 篇 li zhang
  • 1 篇 xing jinjiang
  • 1 篇 song-chun zhu
  • 1 篇 beetem af

语言

  • 57 篇 英文
  • 1 篇 其他
  • 1 篇 中文
检索条件"主题词=Parsing Algorithms"
59 条 记 录,以下是51-60 订阅
A template-based English-Chinese translation system using FOPA and UAMRT
A template-based English-Chinese translation system using FO...
收藏 引用
6th International Conference on Advanced Language Processing and Web Information Technology
作者: Li Yujian Beijing Univ Technol Coll Comp Sci & Technol Beijing 100022 Peoples R China
This paper presents a template-based English-Chinese translation system characterized by two important features: Fast Optimal parsing Algorithm (FOPA) and Universal Algorithm of Matching and Replacing Templates (UAAMT... 详细信息
来源: 评论
Probabilistic parsing strategies
收藏 引用
JOURNAL OF THE ACM 2006年 第3期53卷 406-436页
作者: Nederhof, Mark-Jan Satta, Giorgio Univ Groningen Fac Arts NL-9700 AS Groningen Netherlands Univ Padua Dept Informat Engn I-35131 Padua Italy
We present new results on the relation between purely symbolic context-free parsing strategies and their probabilistic counterparts. Such parsing strategies are seen as constructions of push-down devices from grammars... 详细信息
来源: 评论
The language intersection problem for non-recursive context-free grammars
收藏 引用
INFORMATION AND COMPUTATION 2004年 第2期192卷 172-184页
作者: Nederhof, MJ Satta, G Univ Padua Dept Informat Engn I-35131 Padua Italy Univ Groningen Fac Arts NL-9700 AS Groningen Netherlands
We prove that, given as input two context-free grammars, deciding non-emptiness of intersection of the two generated languages is PSPACE-complete if at least one grammar is non-recursive. The problem remains PSPACE-co... 详细信息
来源: 评论
Fast Exact Inference with a Factored Model for Natural Language parsing  02
Fast Exact Inference with a Factored Model for Natural Langu...
收藏 引用
Annual Conference on Neural Information Processing Systems
作者: Dan Klein Christopher D. Manning Department of Computer Science Stanford University Stanford CA 94305-9040
We present a novel generative model for natural language tree structures in which semantic (lexical dependency) and syntactic (PCFG) structures are scored with separate models. This factorization provides conceptual s... 详细信息
来源: 评论
Tree adjoining grammars for RNA structure prediction
收藏 引用
THEORETICAL COMPUTER SCIENCE 1999年 第2期210卷 277-303页
作者: Uemura, Y Hasegawa, A Kobayashi, S Yokomori, T JST ERATO Doi Bioasymmetry Project Mihama Ku Chiba 26171 Japan Univ Electrocommun Dept Comp Sci & Informat Math Chofu Tokyo 182 Japan
In this paper, we are concerned with identifying a subclass of tree adjoining grammars (TAGs) that is suitable for the application to modeling and predicting RNA secondary structures. The goal of this paper is twofold... 详细信息
来源: 评论
A polynomial-time parsing algorithm for K-depth languages
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 1996年 第1期52卷 61-79页
作者: Cherubini, A SanPietro, P POLITECN MILAN DIPARTIMENTO ELETTRON & INFORMAZI-20133 MILANITALY JAPAN ADV INST SCI & TECHNOL SCH INFORMAT SCITATSUNOKUCHI 92312JAPAN
K-depth grammars extend context-free grammars allowing k greater than or equal to 1 rewriting points for a single non-terminal at every step of a derivation. The family of languages generated by k-depth grammars is a ... 详细信息
来源: 评论
INCREMENTAL SCANNING AND parsing WITH GALAXY
收藏 引用
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1991年 第7期17卷 641-651页
作者: BEETEM, JF BEETEM, AF AB CREAT CONSULTING INC MADISONWI 53705
Incremental integrated programming environments are a promising approach toward the goal of improved programmer productivity. Consistently rapid environment response is an obvious goal. Efficient use of storage has al... 详细信息
来源: 评论
TIME-BOUNDED CONTROLLED BIDIRECTIONAL GRAMMARS
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年 第1-4期35卷 93-115页
作者: HOGENDORP, JA Department of Computer Science University of Twente Enschede P.O. Box 217 7500 AE Netherlands
We study regularly controlled bidirectional (RCB) grammars from the viewpoint of time-bounded grammars. RCB-grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion,... 详细信息
来源: 评论
CONTEXT-SENSITIVE parsing
收藏 引用
COMMUNICATIONS OF THE ACM 1970年 第7期13卷 437-&页
作者: WOODS, WA Harvard Univ. Cambridge MA
This paper presents a canonical form for context-sensitive derivations and a parsing algorithm which finds each context-sensitive analysis once and only once. The amount of memory required by the algorithm is essentia... 详细信息
来源: 评论