555 search results - page 89 / 111 » Decompositions of Grammar Constraints |
LACL
2001
Springer
14 years 27 days ago
2001
Springer
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...
ESOP
2009
Springer
14 years 10 days ago
2009
Springer
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...
CICLING
2010
Springer
13 years 11 months ago
2010
Springer
The translation quality and parsing efficiency are often disappointed when Rule based Machine Translation systems deal with long sentences. Due to the complicated syntactic structu...
SDL
2007
13 years 10 months ago
2007
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 ...
IJCAI
2003
13 years 9 months ago
2003
We have created LADDER, the first language to describe how sketched diagrams in a domain are drawn, displayed, and edited. The difficulty in creating such a language is choosing...