Sciweavers

415 search results - page 62 / 83
» Tree Unification Grammar
Sort
View
ACL
2004
13 years 10 months ago
Long-Distance Dependency Resolution in Automatically Acquired Wide-Coverage PCFG-Based LFG Approximations
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
EPEW
2008
Springer
13 years 10 months ago
Natural Language Specification of Performance Trees
The accessible specification of performance queries is a key challenge in performance analysis. To this end, we seek to combine the intuitive aspects of natural language query spec...
Lei Wang 0002, Nicholas J. Dingle, William J. Knot...
COLING
2008
13 years 10 months ago
Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
Roi Reichart, Ari Rappoport
ACL
1998
13 years 10 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
ICDAR
2009
IEEE
13 years 6 months ago
Syntactic Detection and Correction of Misrecognitions in Mathematical OCR
This paper proposes a syntactic method for detection and correction of misrecognized mathematical formulae for a practical mathematical OCR system. Linear monadic context-free tre...
Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida