Sciweavers

1942 search results - page 2 / 389
» Parse
Sort
View
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
GRAMMARS
2000
100views more  GRAMMARS 2000»
13 years 4 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
ACL
2006
13 years 6 months ago
Speeding Up Full Syntactic Parsing by Leveraging Partial Parsing Decisions
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
Elliot Glaysher, Dan I. Moldovan
TCS
1998
13 years 4 months ago
Parsing Schemata and Correctness of Parsing Algorithms
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
Klaas Sikkel
ECML
2007
Springer
13 years 11 months ago
Probabilistic Models for Action-Based Chinese Dependency Parsing
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
Xiangyu Duan, Jun Zhao, Bo Xu