Computational Syntax-Semantics Interface with Type-Theory of Acyclic Recursion for Underspecified Semantics
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Grail theorem prover: Type theory for syntax and semantics
As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory. From the prespective of grammar design, type-logical grammars develop the syntactic and semantic aspects of linguistic p…
Vocal Bursts Type PredictionJoint Universal Syntactic and Semantic Parsing
While numerous attempts have been made to jointly parse syntax and semantics, high performance in one domain typically comes at the price of performance in the other. This trade-off contradicts the large body of research…
Semantic ParsingDistributional Semantics and Linguistic Theory
Distributional semantics provides multi-dimensional, graded, empirically induced word representations that successfully capture many aspects of meaning in natural languages, as shown in a large body of work in computatio…
The syntax-semantics interface in a child's path: A study of 3- to 11-year-olds' elicited production of Mandarin recursive relative clauses
There have been apparently conflicting claims over the syntax-semantics relationship in child acquisition. However, few of them have assessed the child's path toward the acquisition of recursive relative clauses (RRCs). …
Language AcquisitionObjectDivide and...conquer? On the limits of algorithmic approaches to syntactic semantic structure
In computer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A D&C algorithm works by recursively and monotonically breaking down a problem into sub problems of the sam…
valid