Converting dependency grammars to efficiently parsable context-free grammars

Invention Grant

US07962323B2 Converting dependency grammars to efficiently parsable context-free grammars 有权

Title translation: 将依赖语法转换为有效解决上下文无关的语法

Please log in to see more content

Patent Title: Converting dependency grammars to efficiently parsable context-free grammars
Patent Title (中): 将依赖语法转换为有效解决上下文无关的语法
Application No.: US11683165

Application Date: 2007-03-07
Publication No.: US07962323B2

Publication Date: 2011-06-14
Inventor: Mark Johnson , Robert C. Moore
Applicant: Mark Johnson , Robert C. Moore
Applicant Address: US WA Redmond
Assignee: Microsoft Corporation
Current Assignee: Microsoft Corporation
Current Assignee Address: US WA Redmond
Agency: Westman, Champlin & Kelly, P.A.
Agent Joseph R. Kelly
Main IPC: G06F17/20
IPC: G06F17/20

Converting dependency grammars to efficiently parsable context-free grammars

Abstract:

Dependency grammars are transformed to context-free grammars. The context-free grammars can be used in a parser to parse input sentences and identify relationships among words in the sentence.

Abstract(Chinese):

依赖语法被转换为无上下文的语法。上下文无关的语法可以用在解析器中来解析输入句子并识别句子中的单词之间的关系。

Public/Granted literature

US20080221869A1 CONVERTING DEPENDENCY GRAMMARS TO EFFICIENTLY PARSABLE CONTEXT-FREE GRAMMARS Public/Granted day:2008-09-11

Information query

Espacenet