搜索结果: 1-15 共查到“计算语言学 Context”相关记录18条 . 查询时间(0.026 秒)
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...
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...
Word sense disambiguation (WSD) is an old and important task in computational linguistics that still remains challenging, to machines as well as to human annotators. Recently there have been several p...
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...
This article investigates the effects of different degrees of contextual granularity on language model performance. It presents a new language model that combines clustering and half-contextualization...
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...
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...
Abduction,Belief and Context in Dialogue:Studies in Computational Pragmatics
Abduction Belief Context Dialogue Computational Pragmatics
2015/8/27
The problem of pragmatics arises as soon as we move beyond the linguistic analysis of an utterance and ask what the speaker meant by it. Now, speaker’s meaning is a particular case of intention, and a...
Formal Aspects of Context
Context series
2015/8/26
This volume collects the proceedings of the International and Interdisciplinary Conference on Modelling and Using Context, held in Rio de Janeiro in January 1997, which
proved to be the first i...
Practical Experiments with Regular Approximation of Context-Free Languages
Context-Free Languages Practical Experiments
2015/8/25
Several methods are discussed that construct a finite automaton given a context-free grammar,
including both methods that lead to subsets and those that lead to supersets of the original
conte...
Context,cortex,and associations:a connectionist developmental approach to verbal analogies
analogical reasoning connectionist models cognitive development FTLD cognitive control word association
2015/6/23
We present a PDP model of binary choice verbal analogy problems (A:B as C:[D1|D2], where D1 and D2 represent choice alternatives). We train a recurrent neural network in item-relation-item triples and...
Deep dependencies from context-free statistical parsers:correcting the surface dependency approximation
Deep dependencies statistical parsers surface dependency approximation
2015/6/12
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based on loglinear classif...
Putting Ontology Alignment in Context: Usage Scenarios, Deployment and Evaluation in a Library Case
Context Usage Scenarios Deployment EvaluationCase
2015/4/3
Thesaurus alignment plays an important role in realising efficient access to heterogeneous Cultural Heritage data. Current ontology alignment techniques, however, provide only limited value for such a...
An Efficient Context-Free Parsing Algorithm
syntaxanalysis parsing context-free grammar compilers computationalcomplexity
2015/1/27
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a ...
AN EFFICIENTAUGMENTED-CONTEXT-FREEPARSINGALGORITHM
AUGMENTED-CONTEXT-FREE PARSING ALGORITHM
2015/1/27
An efficient parsing algorithm for augmented context-free grammars is introduced, and its application to on-line natural language interfaces discussed. The algorithm is a generalized LR parsing algori...