搜索结果: 1-15 共查到“文学 free”相关记录48条 . 查询时间(0.363 秒)
Measures and mechanisms of common ground: Backchannels, conversational repair, and interactive alignment in free and task-oriented social interactions
Social coordination common ground conversational repair
2017/8/29
A crucial aspect of everyday conversational interactions is our ability to establish and maintain common ground. Understanding the relevant mechanisms involved in such social coordination remains an i...
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...
Assumption-free estimation of the genetic contribution to refractive error across childhood
genetic contribution childhood
2015/12/18
Studies in relatives have generally yielded high heritability estimates for refractive error: twins 75–90%,
families 15–70%. However, because related individuals often share a common environment, th...
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...
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...
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...
Parsing in a free word order language.
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...
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...
Free variation in Finnish structural case.
Arbil: Free Tool for Creating, Editing, and Searching Metadata
Arbil Free Tool for Creating Editing Searching Metadata
2015/5/5
Arbil2 (Withers 2012) is a free Java-based software program for creating and editing metadata. It was created by Peter Withers, of The Language Archive at the Max Planck Institute for Psycholinguistic...
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 ...