Sciweavers

3 search results - page 1 / 1
» Syntax vs. Semantics on Finite Structures
Sort
View
68
Voted
BIRTHDAY
1997
Springer
15 years 1 months ago
Syntax vs. Semantics on Finite Structures
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
Natasha Alechina, Yuri Gurevich
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
15 years 3 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet
COLING
2002
14 years 9 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...