搜索结果: 1-15 共查到“文学 Grammars”相关记录24条 . 查询时间(0.185 秒)
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...
Empirical Risk Minimization for Probabilistic Grammars:Sample Complexity and Hardness of Learning
Risk Minimization Probabilistic Grammars Sample Complexity and Hardness
2015/9/10
Probabilistic grammars are generative statistical models that are useful for compositional and sequential structures. They are used ubiquitously in computational linguistics. We present a framework, r...
Tree-Adjoining Grammars Are Not Closed Under Strong Lexicalization
Tree-Adjoining Grammars Not Closed Lexicalization
2015/9/10
A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenome...
Splittability of Bilexical Context-Free Grammars is Undecidable
Splittability Bilexical Context-Free Grammars Undecidable
2015/9/9
Bilexical context-free grammars (2-LCFGs) have proved to be accurate models for statistical natural language parsing. Existing dynamic programming algorithms used to parse sentences under these models...
Development of large-scale grammars for natural languages is a complicated endeavor: Grammars are developed collaboratively by teams of linguists, computational linguists, and computer
scientists, in...
Hierarchical Phrase-Based Translation with Weighted Finite-State Transducers and Shallow-n Grammars
Hierarchical Phrase-Based Translation Weighted Finite-State Transducers Shallow-n Grammars
2015/9/8
In this article we describe HiFST, a lattice-based decoder for hierarchical phrase-based translation and alignment. The decoder is implemented with standard Weighted Finite-State Transducer (WFST) ope...
Disfluencies, language comprehension, and Tree Adjoining Grammars
Parsing Disfl uencies TAG Syntax
2015/9/2
Disfluencies include editing terms such as uh and umas well as repeats and revisions. Little is known
about how disfluencies are processed, and there has been next to no research focused ...
Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
Weighted and Probabilistic Context-Free Grammars Equally Expressive
2015/9/2
This article studies the relationship between weighted context-free grammars (WCFGs), where each production is associated with a positive real-valued weight, and probabilistic context-free grammars (P...
Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes
Shared Nodes Multicomponent Tree-Adjoining
2015/8/31
This article addresses the problem that the expressive power of tree-adjoining grammars (TAGs)
is too limited to deal with certain syntactic phenomena, in particular, with scrambling in freeword-orde...
Tree Adjoining Grammars:Formalisms,Linguistic Analysis and Processing
Tree Adjoining Grammars Formalisms Linguistic Analysis Processing
2015/8/27
Take a finite set T of trees, and close it under the operation of substitution—replacing daughterless nonterminals by other trees in T whose root node label matches the nonterminal. The set of all ter...
Efficient Processing with Constraint-Logic Grammars Using Grammar Compilation
Constraint-Logic Grammars Grammar Compilation
2015/8/27
This monograph should be of interest to researchers working on building practical and efficient methods for processing highly abstract declarative constraint-based grammars, primarily head-driven phra...
There is considerable interest among computational linguists in lexicalized grammatical frameworks; lexicalized tree adjoining grammar (LTAG) is one widely studied example. In this paper, we investiga...
D-PATR:A Development Environment for Unification-Based Grammars
D-PATR Development Environment Grammars
2015/6/18
D-PATR:A Development Environment for Unification-Based Grammars.
An Agenda-Based Chart Parser for Arbitrary Probabilistic Context-Free Grammars
Chart Parser Arbitrary Probabilistic Context-Free Grammars
2015/6/12
While methods for parsing probabilistic context-free grammars (PCFGs) are well known, a tabular parsing framework for arbitrary PCFGs which allows for botton-up, topdown, and other parsing strategies...
Parsing with Treebank Grammars:Empirical Bounds,Theoretical Models,and the Structure of the Penn Treebank
Treebank Grammars Empirical Bounds Theoretical Models Penn Treebank
2015/6/12
This paper presents empirical studies and closely corresponding theoretical models of the performance of a chart parser exhaustively parsing the Penn Treebank with the Treebank’s own CFG grammar. We s...