Sciweavers

170 search results - page 3 / 34
» Parsing with Non-Deterministic Functions
Sort
View
IALP
2009
13 years 5 months ago
A Modular Cascaded Approach to Complete Parsing
In this paper, we propose a modular cascaded approach to data driven dependency parsing. Each module or layer leading to the complete parse produces a linguistically valid partial...
Samar Husain, Phani Gadde, Bharat Ram Ambati, Dipt...
COLING
2008
13 years 9 months ago
Relational-Realizational Parsing
State-of-the-art statistical parsing models applied to free word-order languages tend to underperform compared to, e.g., parsing English. Constituency-based models often fail to c...
Reut Tsarfaty, Khalil Sima'an
IJCNLP
2004
Springer
14 years 25 days ago
Iterative CKY Parsing for Probabilistic Context-Free Grammars
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
Yoshimasa Tsuruoka, Jun-ichi Tsujii
HASKELL
2009
ACM
14 years 2 months ago
Lazy functional incremental parsing
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
Jean-Philippe Bernardy
ACL
2000
13 years 8 months ago
An Improved Parser for Data-Oriented Lexical-Functional Analysis
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...
Rens Bod