Sciweavers

675 search results - page 15 / 135
» On Compression of Parse Trees
Sort
View
NAACL
2010
13 years 5 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
COLING
2000
13 years 8 months ago
Structural disambiguation of morpho-syntactic categorial parsing for Korean
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
Jeongwon Cha, Gary Geunbae Lee
ACL
2008
13 years 9 months ago
A Unified Syntactic Model for Parsing Fluent and Disfluent Speech
This paper describes a syntactic representation for modeling speech repairs. This representation makes use of a right corner transform of syntax trees to produce a tree representa...
Tim Miller, William Schuler
DCC
1998
IEEE
13 years 11 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson
ACL
2001
13 years 9 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth