Sciweavers

186 search results - page 35 / 38
» Grammar constraints
Sort
View
ANLP
1997
106views more  ANLP 1997»
13 years 8 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
KES
2005
Springer
14 years 25 days ago
Design of a Digital Forensics Image Mining System
Increasing amount of illicit image data transmitted via the internet has triggered the need to develop effective image mining systems for digital forensics purposes. This paper dis...
Ross Brown, Binh Pham, Olivier Y. de Vel
LACL
2001
Springer
13 years 11 months ago
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
Geoffrey K. Pullum, Barbara C. Scholz
ESOP
2009
Springer
13 years 11 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
SDL
2007
139views Hardware» more  SDL 2007»
13 years 8 months ago
A Model-Based Standard for SDL
Abstract. It is still the case that language descriptions have lots of semantic information captured using plain (English) text. These imprecise descriptions are hardly usable for ...
Andreas Prinz, Markus Scheidgen, Merete Skjelten T...