36 search results - page 5 / 8 » Unambiguous Boolean grammars |
103
click to vote
ESOP
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by man...
141
click to vote
ACL
1997
15 years 6 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
145
click to vote
LREC
2010
15 years 6 months ago
2010
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
155
click to vote
ECEASST
2006
15 years 5 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
152
click to vote
KES
2004
Springer
15 years 10 months ago
2004
Springer
In this case study I argue for the usage of a machine-oriented controlled natural language as interface language to knowledge systems. Instead of using formal languages that are di...