搜索结果: 1-15 共查到“应用语言学 Parsing”相关记录41条 . 查询时间(0.062 秒)
Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication
Subset of recognition algorithm the binary linear system M matrix multiplication grammar rules subroutine
2016/10/31
We describe a recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time O(nωd) where M(m) = O(mω) is the running time for m × m matrix multiplication...
Transition-Based Parsing for Deep Dependency Structures
Analysis of structure depth dependency structure language data drive
2016/10/31
Derivations under different grammar formalisms allow extraction of various dependency structures. Particularly, bilexical deep dependency structures beyond surface tree representation can be derived f...
Synchronous Context-Free Grammars and Optimal Parsing Strategies
Synchronous Context-Free Grammars Optimal Parsing Strategies
2016/7/7
The complexity of parsing with synchronous context-free grammars is polynomial in the sentence
length for a fixed grammar, but the degree of the polynomial depends on the grammar. Specifi-
cally, th...
A Statistical Parsing Framework for Sentiment Classification
Statistical Parsing Framework Sentiment Classification
2015/9/15
We present a statistical parsing framework for sentence-level sentiment classification in this article. Unlike previous works that use syntactic parsing results for sentiment analysis, we develop a st...
Divisible Transition Systems and Multiplanar Dependency Parsing
Divisible Transition Systems Multiplanar Dependency Parsing
2015/9/11
Transition-based parsing is a widely used approach for dependency parsing that combines high efficiency with expressive feature models. Many different transition systems have been proposed, often form...
Multilingual Joint Parsing of Syntactic and Semantic Dependencies with a Latent Variable Model
Multilingual Joint Parsing Syntactic Semantic Latent Variable Model
2015/9/11
Current investigations in data-driven models of parsing have shifted from purely syntactic analysis to richer semantic representations, showing that the successful recovery of the meaning of text requ...
Incremental,Predictive Parsing with Psycholinguistically Motivated Tree-Adjoining Grammar
Incremental Predictive Parsing Psycholinguistically Tree-Adjoining Grammar
2015/9/11
Psycholinguistic research shows that key properties of the human sentence processor are incrementality, connectedness (partial structures contain no unattached nodes), and prediction (upcoming syntact...
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
Context-Free Rewriting Systemsl Data-Driven Parsing
2015/9/11
This paper presents the first efficient implementation of a weighted deductive CYK parser for
Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of CFG,
c...
Finite-State Chart Constraints for Reduced Complexity Context-Free Parsing Pipelines
Finite-State Chart Reduced Complexity Parsing Pipelines
2015/9/10
We present methods for reducing the worst-case and typical-case complexity of a context-free parsing pipeline via hard constraints derived from finite-state pre-processing. We perform O(n) predictions...
Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing
Dependency Parsing Schemata Mildly Non-Projective Dependency Parsing
2015/9/9
We introduce dependency parsing schemata, a formal framework based on Sikkel's parsing schemata for constituency parsers, which can be used to describe, analyze, and compare dependency parsing algorit...
Noun phrases (nps) are a crucial part of natural language, and can have a very complex structure. However, this np structure is largely ignored by the statistical parsing field, as the most widely use...
Complexity,Parsing,and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar
Complexity Parsing Factorization Tree-Local Multi-Component Tree-Adjoining Grammar
2015/9/8
Tree-Local Multi-Component Tree-Adjoining Grammar (TL-MCTAG) is an appealing formalism for natural language representation because it arguably allows the encapsulation of the appropriate domain of loc...
Wide-Coverage Deep Statistical Parsing Using Automatic Dependency Structure Annotation
Wide-Coverage Deep Statistical Parsing Automatic Dependency Structure Annotation
2015/9/6
A number of researchers have recently conducted experiments comparing “deep” hand-crafted wide-coverage with “shallow” treebank- and machine-learning-based parsers at the level of dependencies, using ...
Algorithms for Deterministic Incremental Dependency Parsing
Dependency Parsing Computing language
2015/9/6
Parsing algorithms that process the input from left to right and construct a single derivation
have often been considered inadequate for natural language parsing because of the massive
ambiguity typ...
Probabilistic modeling of lexicalized grammars is difficult because these grammars exploit complicated data structures, such as typed feature structures. This prevents us from applying common methods ...