341 search results - page 7 / 69 » Formal Grammars of Early Language |
110
click to vote
DLT
2003
15 years 10 days ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
112
click to vote
ICCPOL
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. For casual web users, a natural language is more accessible than formal query languages. However, understanding of a natural language query is not trivial for computer sy...
ICGI
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
COLING
1994
15 years 8 days ago
1994
This paper presents the XTAG system, a grammar development tool based on the Tree Adjoining Grammar (TAG) formalism that includes a wide-coverage syntactic grammar for English. Th...
118
click to vote
TOOLS
1992
IEEE
15 years 3 months ago
1992
IEEE
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...