English 中文(简体)
Grammar Syntax and Linguistics
原标题:
  • 时间:2009-12-31 11:40:20
  •  标签:
  • grammar
  • bnf

I REALLY need a description of the english sentence structure in a way that can be translated by machine and is strictly rule based(no statistical stuff), it doesn t have to be a context-free grammar but that would be preferable(as it can t be and fully describe it). The best I ve found was for a BNF but it was really basic. I need something that has no exceptions except where ambigious. Any links?

问题回答

Start with A Comprehensive Grammar of the English Language by Quirk et al. It s good to read that you re not looking for a context-free grammar for English, as English is not a context-free language. I don t think any natural languages are context-free.

I am also looking into a similar issue and I will share the best that I found: http://lands.let.kun.nl/TSpublic/dreumel/formal_grammar_english.en.html

This is dependent upon the AGFL variant of grammar descriptions: http://www.agfl.cs.ru.nl/

On a very generic level, have a look at Natural Language Processing. I m afraid though, that this is not going to be very encouraging !

You could have a look at LFG which is basically a context-free grammar enriched with functional descriptions that are usually interpreted as first-order logic formulae. Grammars for a few languages have been developed within the ParGram project.





相关问题
Reserved keywords in Objective-C?

At the CocoaHeads Öresund meeting yesterday, peylow had constructed a great ObjC quiz. The competition was intense and three people were left with the same score when the final question was to be ...

ANTLR grammar license [closed]

I m planning to make an implementation of Lua for the DLR, and i would like to use the listed Lua 5.1 grammar here. However i can t see a license that it was released under, so can someone please ...

Does anyone recognise this unfamiliar notation?

I have a question from a test in a Programming Languages class that is confusing me. Give a context-free grammar to generate the following language L = { aibjck | 0 <= i <= j <= i + k } I ...

Question about building a symbol table with a yacc parser

If my yacc parser encounters the following code: int foo(int a, int b) should it add int a and int b as attributes of foo? The way I have it now, it enters a and b as separate table entries.

Tips on Using Bison --graph=[file] on Linux

Recently (about a month ago) I was trying to introduce new constructs to my company s in-house extension language, and struggling with a couple of reduce-reduce errors. While I eventually solved this ...

Yacc program not recognizing function declaration

I think my program should be able to recognize the following as a function declaration: int fn(int i) { int n; return; } but it doesn t. Here s the relevant part of my yacc file: program : ...

Grammars, Scala Parsing Combinators and Orderless Sets

I m writing an application that will take in various "command" strings. I ve been looking at the Scala combinator library to tokenize the commands. I find in a lot of cases I want to say: "These ...

What s the matter with this Grammar?

grammar Test; IDHEAD: ( a .. z | A .. Z | _ ); IDTAIL: (IDHEAD | 0 .. 9 ); ID: (IDHEAD IDTAIL*); fragment TYPE: ( text | number | bool ); define: define ID as TYPE; The problem ...

热门标签