Sciweavers

158 search results - page 6 / 32
» Direct Parsing With Metarules
Sort
View
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
CAV
2012
Springer
231views Hardware» more  CAV 2012»
12 years 12 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
ACL
2007
14 years 11 months ago
Japanese Dependency Parsing Using Sequential Labeling for Semi-spoken Language
The amount of documents directly published by end users is increasing along with the growth of Web 2.0. Such documents often contain spoken-style expressions, which are difficult...
Kenji Imamura, Gen-ichiro Kikui, Norihito Yasuda
IWPT
2001
14 years 10 months ago
Parsing and Hypergraphs
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which ...
Dan Klein, Christopher D. Manning
COLING
2008
14 years 11 months ago
Japanese Dependency Parsing Using a Tournament Model
In Japanese dependency parsing, Kudo's relative preference-based method (Kudo and Matsumoto, 2005) outperforms both deterministic and probabilistic CKY-based parsing methods....
Masakazu Iwatate, Masayuki Asahara, Yuji Matsumoto