Sciweavers

68 search results - page 8 / 14
» Lexical and Syntactic Rules in a Tree Adjoining Grammar
Sort
View
ACL
1998
13 years 8 months ago
A Probabilistic Corpus-Driven Model for Lexical-Functional Analysis
Wc develop a l)ata-Oricntcd Parsing (DOP) model based on the syntactic representations of Lexicalf;unctional Grammar (LFG). We start by summarizing the original DOP model for tree...
Rens Bod, Ronald M. Kaplan
ACL
2004
13 years 8 months ago
Wrapping of Trees
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends TreeAdjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition t...
James Rogers
JDCTA
2010
163views more  JDCTA 2010»
13 years 1 months ago
An Efficient Syntactic Analyzer Using Semantic Connection Units
We implement a Korean syntactic analyzer which decreases many ambiguities in syntax parse trees using segmentation and semantic connection units. We use dependency grammar for par...
Yong-uk Park, Hyuk-chul Kwon
COLING
1996
13 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
EMNLP
2008
13 years 8 months ago
Sparse Multi-Scale Grammars for Discriminative Latent Variable Parsing
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...
Slav Petrov, Dan Klein