Sciweavers

284 search results - page 3 / 57
» Efficient Parsing for French
Sort
View
JDCTA
2010
163views more  JDCTA 2010»
12 years 11 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
ACL
1996
13 years 6 months ago
Efficient Transformation-Based Parsing
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...
Giorgio Satta, Eric Brill
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 4 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
ACTA
2000
302views more  ACTA 2000»
13 years 4 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
EACL
1993
ACL Anthology
13 years 6 months ago
Ambiguity resolution in a reductionistic parser
We are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurallyunresolvable distinctionsin order to...
Atro Voutilainen, Pasi Tapanainen