Sciweavers

224 search results - page 39 / 45
» Syntactic Formats for Free
Sort
View
COLING
2002
13 years 7 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 7 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
ENTCS
2000
120views more  ENTCS 2000»
13 years 7 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga
CAI
2011
Springer
12 years 11 months ago
Theme and Variations on the Concatenation Product
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, ļ¬nite model theory and proļ...
Jean-Éric Pin
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 9 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a DatalogĀ¬ program and the number of ā€œcoordination stagesā€ require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher