553 search results - page 6 / 111 » Verified, Executable Parsing |
TCS
2010
13 years 7 months ago
2010
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
EUROCAST
2007
Springer
14 years 22 days ago
2007
Springer
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...
CICLING
2009
Springer
14 years 9 months ago
2009
Springer
A desirable property for any system dealing with unrestricted natural language text is robustness, the ability to analyze any input regardless of its grammaticality. In this paper ...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
CLIMA
2008
13 years 10 months ago
2008
The paper deals with the problem of agents conformance with multiparty protocols. We introduce a notion of conformance of a set of k agents with a multiparty protocol with k roles,...